/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-driver-races/char_generic_nvram_read_nvram_write_nvram.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:51:14,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:51:14,796 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:14,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:51:14,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:51:14,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:51:14,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:51:14,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:51:14,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:51:14,828 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:51:14,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:51:14,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:51:14,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:51:14,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:51:14,828 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:51:14,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:51:14,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:51:14,828 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:51:14,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:51:14,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:51:14,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:51:14,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:51:14,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:51:14,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:51:14,829 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:51:14,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:51:14,829 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:51:14,829 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:51:14,829 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:51:14,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:51:14,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:51:14,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:51:14,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:51:14,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:51:14,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:51:14,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:51:14,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:51:14,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:51:14,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:51:14,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:51:14,831 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:51:14,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:51:14,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:51:14,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:51:14,831 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:51:14,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:51:14,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:51:14,831 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:15,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:51:15,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:51:15,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:51:15,054 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:51:15,056 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:51:15,057 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i [2025-04-13 21:51:16,447 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0b58c8d6/a3f4cb06877d4e03bdbce6d08e02410b/FLAG328a22aac [2025-04-13 21:51:16,924 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:51:16,925 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i [2025-04-13 21:51:16,969 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0b58c8d6/a3f4cb06877d4e03bdbce6d08e02410b/FLAG328a22aac [2025-04-13 21:51:17,497 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0b58c8d6/a3f4cb06877d4e03bdbce6d08e02410b [2025-04-13 21:51:17,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:51:17,501 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:51:17,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:51:17,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:51:17,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:51:17,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:51:17" (1/1) ... [2025-04-13 21:51:17,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49904174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:17, skipping insertion in model container [2025-04-13 21:51:17,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:51:17" (1/1) ... [2025-04-13 21:51:17,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:51:17,901 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-driver-races/char_generic_nvram_read_nvram_write_nvram.i[5520,5533] [2025-04-13 21:51:21,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:51:21,473 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:51:21,489 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-driver-races/char_generic_nvram_read_nvram_write_nvram.i[5520,5533] [2025-04-13 21:51:21,581 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "b %b0, %1\n" : "+q" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-04-13 21:51:21,583 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "w %w0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-04-13 21:51:21,583 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "l %0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-04-13 21:51:21,583 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "q %q0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-04-13 21:51:21,668 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] [2025-04-13 21:51:21,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:51:21,986 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:51:21,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:21 WrapperNode [2025-04-13 21:51:21,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:51:21,988 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:51:21,988 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:51:21,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:51:21,992 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:21" (1/1) ... [2025-04-13 21:51:22,057 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:21" (1/1) ... [2025-04-13 21:51:22,107 INFO L138 Inliner]: procedures = 1352, calls = 1469, calls flagged for inlining = 352, calls inlined = 18, statements flattened = 394 [2025-04-13 21:51:22,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:51:22,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:51:22,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:51:22,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:51:22,115 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:21" (1/1) ... [2025-04-13 21:51:22,116 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:21" (1/1) ... [2025-04-13 21:51:22,120 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:21" (1/1) ... [2025-04-13 21:51:22,140 INFO L175 MemorySlicer]: Split 52 memory accesses to 7 slices as follows [2, 1, 4, 2, 3, 9, 31]. 60 percent of accesses are in the largest equivalence class. The 43 initializations are split as follows [2, 1, 4, 2, 3, 0, 31]. The 3 writes are split as follows [0, 0, 0, 0, 0, 3, 0]. [2025-04-13 21:51:22,140 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:21" (1/1) ... [2025-04-13 21:51:22,140 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:21" (1/1) ... [2025-04-13 21:51:22,160 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:21" (1/1) ... [2025-04-13 21:51:22,161 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:21" (1/1) ... [2025-04-13 21:51:22,165 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:21" (1/1) ... [2025-04-13 21:51:22,167 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:21" (1/1) ... [2025-04-13 21:51:22,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:51:22,176 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:51:22,176 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:51:22,176 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:51:22,177 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:21" (1/1) ... [2025-04-13 21:51:22,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:51:22,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:51:22,209 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:22,211 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:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 21:51:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 21:51:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 21:51:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 21:51:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-04-13 21:51:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-04-13 21:51:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-04-13 21:51:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 21:51:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:51:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:51:22,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:51:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 21:51:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 21:51:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 21:51:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 21:51:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-04-13 21:51:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-04-13 21:51:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-04-13 21:51:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_read_nvram [2025-04-13 21:51:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_read_nvram [2025-04-13 21:51:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 21:51:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 21:51:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-13 21:51:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-13 21:51:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-13 21:51:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-04-13 21:51:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-04-13 21:51:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-04-13 21:51:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-04-13 21:51:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_write_nvram [2025-04-13 21:51:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_write_nvram [2025-04-13 21:51:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:51:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:51:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 21:51:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 21:51:22,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-04-13 21:51:22,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-04-13 21:51:22,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-04-13 21:51:22,234 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:22,553 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:51:22,555 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:51:22,698 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6551: havoc access_ok_#t~nondet1065#1; [2025-04-13 21:51:22,698 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543: havoc __put_user_#t~nondet1063#1; [2025-04-13 21:51:22,698 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6636: havoc nvram_read_byte_#t~nondet1081#1; [2025-04-13 21:51:22,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6551: havoc access_ok_#t~nondet1065#1; [2025-04-13 21:51:22,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6535: havoc __get_user_#t~nondet1061#1; [2025-04-13 21:51:23,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6632: havoc nvram_get_size_#t~nondet1080#1; [2025-04-13 21:51:23,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6650: havoc printk_#t~nondet1083#1; [2025-04-13 21:51:23,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6624: havoc misc_register_#t~nondet1078#1; [2025-04-13 21:51:23,013 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:51:23,014 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:51:23,014 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:51:24,049 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:51:24,062 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:51:24,082 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:51:24,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:51:24 BoogieIcfgContainer [2025-04-13 21:51:24,083 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:51:24,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:51:24,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:51:24,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:51:24,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:51:17" (1/3) ... [2025-04-13 21:51:24,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22235468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:51:24, skipping insertion in model container [2025-04-13 21:51:24,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:21" (2/3) ... [2025-04-13 21:51:24,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22235468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:51:24, skipping insertion in model container [2025-04-13 21:51:24,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:51:24" (3/3) ... [2025-04-13 21:51:24,091 INFO L128 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_read_nvram_write_nvram.i [2025-04-13 21:51:24,103 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:51:24,107 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG char_generic_nvram_read_nvram_write_nvram.i that has 3 procedures, 29 locations, 34 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-13 21:51:24,107 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:51:24,194 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:51:24,221 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 42 transitions, 98 flow [2025-04-13 21:51:24,266 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 274 states, 271 states have (on average 3.2509225092250924) internal successors, (881), 273 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have 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,291 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:51:24,302 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;@7937ee93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:51:24,302 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 21:51:24,307 INFO L278 IsEmpty]: Start isEmpty. Operand has 274 states, 271 states have (on average 3.2509225092250924) internal successors, (881), 273 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have 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,312 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 21:51:24,312 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:24,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:24,313 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:51:24,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:24,319 INFO L85 PathProgramCache]: Analyzing trace with hash -339968646, now seen corresponding path program 1 times [2025-04-13 21:51:24,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:24,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837326582] [2025-04-13 21:51:24,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:24,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:24,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:51:24,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:51:24,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:24,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:26,036 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:26,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:26,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837326582] [2025-04-13 21:51:26,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837326582] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:26,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:26,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:51:26,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534318395] [2025-04-13 21:51:26,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:26,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:51:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:26,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:51:26,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:51:26,059 INFO L87 Difference]: Start difference. First operand has 274 states, 271 states have (on average 3.2509225092250924) internal successors, (881), 273 states have internal predecessors, (881), 0 states have call successors, (0), 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 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:26,752 INFO L93 Difference]: Finished difference Result 466 states and 1407 transitions. [2025-04-13 21:51:26,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 21:51:26,753 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-13 21:51:26,753 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:26,762 INFO L225 Difference]: With dead ends: 466 [2025-04-13 21:51:26,762 INFO L226 Difference]: Without dead ends: 432 [2025-04-13 21:51:26,767 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:51:26,770 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 119 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:26,771 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 14 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 21:51:26,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-04-13 21:51:26,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 340. [2025-04-13 21:51:26,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 337 states have (on average 3.106824925816024) internal successors, (1047), 339 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have 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,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1047 transitions. [2025-04-13 21:51:26,835 INFO L79 Accepts]: Start accepts. Automaton has 340 states and 1047 transitions. Word has length 10 [2025-04-13 21:51:26,837 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:26,837 INFO L485 AbstractCegarLoop]: Abstraction has 340 states and 1047 transitions. [2025-04-13 21:51:26,837 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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,838 INFO L278 IsEmpty]: Start isEmpty. Operand 340 states and 1047 transitions. [2025-04-13 21:51:26,839 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 21:51:26,839 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:26,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:26,839 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:51:26,839 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:51:26,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:26,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1948143017, now seen corresponding path program 1 times [2025-04-13 21:51:26,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:26,840 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807278637] [2025-04-13 21:51:26,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:26,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:26,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:51:26,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:51:26,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:26,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:27,519 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:27,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:27,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807278637] [2025-04-13 21:51:27,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807278637] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:27,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:27,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:51:27,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925452940] [2025-04-13 21:51:27,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:27,521 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:51:27,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:27,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:51:27,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:51:27,521 INFO L87 Difference]: Start difference. First operand 340 states and 1047 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:27,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:27,751 INFO L93 Difference]: Finished difference Result 378 states and 1136 transitions. [2025-04-13 21:51:27,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:51:27,751 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-13 21:51:27,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:27,755 INFO L225 Difference]: With dead ends: 378 [2025-04-13 21:51:27,755 INFO L226 Difference]: Without dead ends: 334 [2025-04-13 21:51:27,755 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:51:27,756 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 39 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:27,756 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 8 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:51:27,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-04-13 21:51:27,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 256. [2025-04-13 21:51:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 253 states have (on average 2.9446640316205532) internal successors, (745), 255 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have 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:27,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 745 transitions. [2025-04-13 21:51:27,787 INFO L79 Accepts]: Start accepts. Automaton has 256 states and 745 transitions. Word has length 11 [2025-04-13 21:51:27,787 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:27,787 INFO L485 AbstractCegarLoop]: Abstraction has 256 states and 745 transitions. [2025-04-13 21:51:27,787 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:27,787 INFO L278 IsEmpty]: Start isEmpty. Operand 256 states and 745 transitions. [2025-04-13 21:51:27,788 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 21:51:27,788 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:27,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:27,790 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:51:27,790 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:51:27,790 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:27,790 INFO L85 PathProgramCache]: Analyzing trace with hash -212468253, now seen corresponding path program 1 times [2025-04-13 21:51:27,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:27,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699661818] [2025-04-13 21:51:27,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:27,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:27,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 21:51:27,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:51:27,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:27,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:28,267 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:28,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:28,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699661818] [2025-04-13 21:51:28,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699661818] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:28,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:28,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:51:28,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008992522] [2025-04-13 21:51:28,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:28,268 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:51:28,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:28,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:51:28,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:51:28,268 INFO L87 Difference]: Start difference. First operand 256 states and 745 transitions. Second operand has 4 states, 3 states have (on average 4.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:28,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:28,476 INFO L93 Difference]: Finished difference Result 280 states and 788 transitions. [2025-04-13 21:51:28,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:51:28,476 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.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 12 [2025-04-13 21:51:28,477 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:28,478 INFO L225 Difference]: With dead ends: 280 [2025-04-13 21:51:28,478 INFO L226 Difference]: Without dead ends: 183 [2025-04-13 21:51:28,478 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:51:28,479 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:28,479 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 8 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:51:28,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-04-13 21:51:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-04-13 21:51:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 181 states have (on average 2.5303867403314917) internal successors, (458), 182 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have 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:28,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 458 transitions. [2025-04-13 21:51:28,495 INFO L79 Accepts]: Start accepts. Automaton has 183 states and 458 transitions. Word has length 12 [2025-04-13 21:51:28,495 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:28,495 INFO L485 AbstractCegarLoop]: Abstraction has 183 states and 458 transitions. [2025-04-13 21:51:28,495 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.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:28,495 INFO L278 IsEmpty]: Start isEmpty. Operand 183 states and 458 transitions. [2025-04-13 21:51:28,497 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 21:51:28,497 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:28,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:28,497 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:51:28,497 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:51:28,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:28,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1867436982, now seen corresponding path program 1 times [2025-04-13 21:51:28,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:28,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856805990] [2025-04-13 21:51:28,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:28,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:28,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:51:28,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:51:28,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:28,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:30,461 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:30,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:30,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856805990] [2025-04-13 21:51:30,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856805990] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:30,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:30,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:51:30,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946038138] [2025-04-13 21:51:30,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:30,462 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:51:30,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:30,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:51:30,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:51:30,463 INFO L87 Difference]: Start difference. First operand 183 states and 458 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:31,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:31,376 INFO L93 Difference]: Finished difference Result 316 states and 733 transitions. [2025-04-13 21:51:31,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:51:31,377 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-04-13 21:51:31,377 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:31,378 INFO L225 Difference]: With dead ends: 316 [2025-04-13 21:51:31,378 INFO L226 Difference]: Without dead ends: 289 [2025-04-13 21:51:31,379 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:51:31,379 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 140 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:31,380 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 22 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:51:31,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-04-13 21:51:31,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 219. [2025-04-13 21:51:31,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 217 states have (on average 2.4331797235023043) internal successors, (528), 218 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have 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:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 528 transitions. [2025-04-13 21:51:31,390 INFO L79 Accepts]: Start accepts. Automaton has 219 states and 528 transitions. Word has length 18 [2025-04-13 21:51:31,390 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:31,390 INFO L485 AbstractCegarLoop]: Abstraction has 219 states and 528 transitions. [2025-04-13 21:51:31,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:31,390 INFO L278 IsEmpty]: Start isEmpty. Operand 219 states and 528 transitions. [2025-04-13 21:51:31,391 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 21:51:31,391 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:31,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:31,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:51:31,391 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:51:31,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:31,391 INFO L85 PathProgramCache]: Analyzing trace with hash 473607972, now seen corresponding path program 1 times [2025-04-13 21:51:31,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:31,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884521940] [2025-04-13 21:51:31,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:31,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:31,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:51:31,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:51:31,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:31,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:33,660 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:33,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:33,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884521940] [2025-04-13 21:51:33,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884521940] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:33,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:33,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:51:33,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345209750] [2025-04-13 21:51:33,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:33,662 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 21:51:33,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:33,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 21:51:33,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:51:33,663 INFO L87 Difference]: Start difference. First operand 219 states and 528 transitions. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:36,040 INFO L93 Difference]: Finished difference Result 440 states and 1051 transitions. [2025-04-13 21:51:36,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 21:51:36,041 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-04-13 21:51:36,041 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:36,043 INFO L225 Difference]: With dead ends: 440 [2025-04-13 21:51:36,043 INFO L226 Difference]: Without dead ends: 404 [2025-04-13 21:51:36,044 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2025-04-13 21:51:36,045 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 230 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:36,045 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 0 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 21:51:36,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-04-13 21:51:36,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 267. [2025-04-13 21:51:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 265 states have (on average 2.4452830188679244) internal successors, (648), 266 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have 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,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 648 transitions. [2025-04-13 21:51:36,064 INFO L79 Accepts]: Start accepts. Automaton has 267 states and 648 transitions. Word has length 18 [2025-04-13 21:51:36,064 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:36,064 INFO L485 AbstractCegarLoop]: Abstraction has 267 states and 648 transitions. [2025-04-13 21:51:36,064 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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,064 INFO L278 IsEmpty]: Start isEmpty. Operand 267 states and 648 transitions. [2025-04-13 21:51:36,066 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 21:51:36,066 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:36,066 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:36,066 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:51:36,066 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:51:36,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:36,066 INFO L85 PathProgramCache]: Analyzing trace with hash -2104932410, now seen corresponding path program 2 times [2025-04-13 21:51:36,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:36,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352750731] [2025-04-13 21:51:36,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:51:36,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:36,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:51:36,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:51:36,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:51:36,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:37,520 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:37,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:37,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352750731] [2025-04-13 21:51:37,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352750731] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:37,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:37,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:51:37,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625940084] [2025-04-13 21:51:37,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:37,521 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:51:37,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:37,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:51:37,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:51:37,522 INFO L87 Difference]: Start difference. First operand 267 states and 648 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:38,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:38,715 INFO L93 Difference]: Finished difference Result 488 states and 1185 transitions. [2025-04-13 21:51:38,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:51:38,715 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-04-13 21:51:38,715 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:38,717 INFO L225 Difference]: With dead ends: 488 [2025-04-13 21:51:38,717 INFO L226 Difference]: Without dead ends: 461 [2025-04-13 21:51:38,718 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:51:38,718 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 134 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:38,719 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 32 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:51:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-04-13 21:51:38,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 285. [2025-04-13 21:51:38,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 283 states have (on average 2.469964664310954) internal successors, (699), 284 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have 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:38,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 699 transitions. [2025-04-13 21:51:38,731 INFO L79 Accepts]: Start accepts. Automaton has 285 states and 699 transitions. Word has length 18 [2025-04-13 21:51:38,731 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:38,731 INFO L485 AbstractCegarLoop]: Abstraction has 285 states and 699 transitions. [2025-04-13 21:51:38,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:38,731 INFO L278 IsEmpty]: Start isEmpty. Operand 285 states and 699 transitions. [2025-04-13 21:51:38,732 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 21:51:38,732 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:38,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:38,732 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:51:38,732 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:51:38,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:38,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2118901472, now seen corresponding path program 2 times [2025-04-13 21:51:38,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:38,733 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64094987] [2025-04-13 21:51:38,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:51:38,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:38,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:51:38,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:51:38,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:51:38,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:40,324 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:40,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:40,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64094987] [2025-04-13 21:51:40,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64094987] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:40,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:40,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:51:40,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074457050] [2025-04-13 21:51:40,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:40,325 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:51:40,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:40,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:51:40,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:51:40,326 INFO L87 Difference]: Start difference. First operand 285 states and 699 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:43,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:43,128 INFO L93 Difference]: Finished difference Result 666 states and 1564 transitions. [2025-04-13 21:51:43,128 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 21:51:43,128 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-04-13 21:51:43,128 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:43,131 INFO L225 Difference]: With dead ends: 666 [2025-04-13 21:51:43,131 INFO L226 Difference]: Without dead ends: 600 [2025-04-13 21:51:43,131 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=319, Invalid=941, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 21:51:43,132 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 282 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:43,132 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 10 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 21:51:43,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-04-13 21:51:43,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 327. [2025-04-13 21:51:43,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 325 states have (on average 2.4923076923076923) internal successors, (810), 326 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have 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:43,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 810 transitions. [2025-04-13 21:51:43,155 INFO L79 Accepts]: Start accepts. Automaton has 327 states and 810 transitions. Word has length 18 [2025-04-13 21:51:43,155 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:43,156 INFO L485 AbstractCegarLoop]: Abstraction has 327 states and 810 transitions. [2025-04-13 21:51:43,156 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:43,156 INFO L278 IsEmpty]: Start isEmpty. Operand 327 states and 810 transitions. [2025-04-13 21:51:43,158 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 21:51:43,158 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:43,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:43,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 21:51:43,158 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:51:43,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:43,158 INFO L85 PathProgramCache]: Analyzing trace with hash 429023566, now seen corresponding path program 3 times [2025-04-13 21:51:43,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:43,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599904364] [2025-04-13 21:51:43,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:51:43,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:43,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:51:43,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:51:43,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:51:43,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:44,589 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:44,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:44,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599904364] [2025-04-13 21:51:44,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599904364] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:44,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:44,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:51:44,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9888854] [2025-04-13 21:51:44,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:44,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:51:44,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:44,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:51:44,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:51:44,592 INFO L87 Difference]: Start difference. First operand 327 states and 810 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:45,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:45,740 INFO L93 Difference]: Finished difference Result 652 states and 1599 transitions. [2025-04-13 21:51:45,740 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:51:45,740 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-04-13 21:51:45,740 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:45,744 INFO L225 Difference]: With dead ends: 652 [2025-04-13 21:51:45,744 INFO L226 Difference]: Without dead ends: 613 [2025-04-13 21:51:45,744 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:51:45,745 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 145 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:45,745 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 35 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 21:51:45,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-04-13 21:51:45,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 301. [2025-04-13 21:51:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 299 states have (on average 2.4849498327759196) internal successors, (743), 300 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have 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:45,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 743 transitions. [2025-04-13 21:51:45,778 INFO L79 Accepts]: Start accepts. Automaton has 301 states and 743 transitions. Word has length 18 [2025-04-13 21:51:45,778 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:45,778 INFO L485 AbstractCegarLoop]: Abstraction has 301 states and 743 transitions. [2025-04-13 21:51:45,778 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:45,778 INFO L278 IsEmpty]: Start isEmpty. Operand 301 states and 743 transitions. [2025-04-13 21:51:45,779 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 21:51:45,779 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:45,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:45,779 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:51:45,779 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:51:45,779 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:45,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1654328604, now seen corresponding path program 3 times [2025-04-13 21:51:45,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:45,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693734020] [2025-04-13 21:51:45,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:51:45,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:45,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:51:45,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:51:45,848 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:51:45,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:55,140 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:51:55,239 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:55,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:55,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693734020] [2025-04-13 21:51:55,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693734020] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:55,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:55,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:51:55,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690516431] [2025-04-13 21:51:55,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:55,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:51:55,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:55,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:51:55,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:51:55,240 INFO L87 Difference]: Start difference. First operand 301 states and 743 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:56,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:56,520 INFO L93 Difference]: Finished difference Result 658 states and 1598 transitions. [2025-04-13 21:51:56,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 21:51:56,521 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-04-13 21:51:56,521 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:56,524 INFO L225 Difference]: With dead ends: 658 [2025-04-13 21:51:56,524 INFO L226 Difference]: Without dead ends: 622 [2025-04-13 21:51:56,524 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=462, Unknown=0, NotChecked=0, Total=650 [2025-04-13 21:51:56,524 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 146 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:56,525 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 22 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:51:56,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-04-13 21:51:56,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 357. [2025-04-13 21:51:56,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 355 states have (on average 2.4873239436619716) internal successors, (883), 356 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have 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:56,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 883 transitions. [2025-04-13 21:51:56,544 INFO L79 Accepts]: Start accepts. Automaton has 357 states and 883 transitions. Word has length 18 [2025-04-13 21:51:56,545 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:56,545 INFO L485 AbstractCegarLoop]: Abstraction has 357 states and 883 transitions. [2025-04-13 21:51:56,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:56,545 INFO L278 IsEmpty]: Start isEmpty. Operand 357 states and 883 transitions. [2025-04-13 21:51:56,545 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 21:51:56,546 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:56,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:56,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 21:51:56,546 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:51:56,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:56,550 INFO L85 PathProgramCache]: Analyzing trace with hash 581108576, now seen corresponding path program 4 times [2025-04-13 21:51:56,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:56,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458035772] [2025-04-13 21:51:56,550 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:51:56,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:56,574 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:51:56,596 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:51:56,597 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:51:56,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:57,495 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:57,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:57,496 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458035772] [2025-04-13 21:51:57,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458035772] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:57,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:57,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:51:57,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700512143] [2025-04-13 21:51:57,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:57,496 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:51:57,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:57,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:51:57,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:51:57,497 INFO L87 Difference]: Start difference. First operand 357 states and 883 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:58,486 INFO L93 Difference]: Finished difference Result 628 states and 1487 transitions. [2025-04-13 21:51:58,487 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:51:58,487 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-04-13 21:51:58,487 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:58,489 INFO L225 Difference]: With dead ends: 628 [2025-04-13 21:51:58,490 INFO L226 Difference]: Without dead ends: 589 [2025-04-13 21:51:58,490 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:51:58,490 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 132 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:58,490 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 33 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:51:58,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-04-13 21:51:58,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 349. [2025-04-13 21:51:58,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 347 states have (on average 2.4985590778097984) internal successors, (867), 348 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have 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,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 867 transitions. [2025-04-13 21:51:58,508 INFO L79 Accepts]: Start accepts. Automaton has 349 states and 867 transitions. Word has length 18 [2025-04-13 21:51:58,509 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:58,509 INFO L485 AbstractCegarLoop]: Abstraction has 349 states and 867 transitions. [2025-04-13 21:51:58,509 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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,509 INFO L278 IsEmpty]: Start isEmpty. Operand 349 states and 867 transitions. [2025-04-13 21:51:58,512 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 21:51:58,512 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:58,512 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:58,512 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 21:51:58,512 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:51:58,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:58,513 INFO L85 PathProgramCache]: Analyzing trace with hash 606911396, now seen corresponding path program 4 times [2025-04-13 21:51:58,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:58,513 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745112239] [2025-04-13 21:51:58,513 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:51:58,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:58,538 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:51:58,566 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:51:58,567 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:51:58,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:00,035 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:52:00,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:00,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745112239] [2025-04-13 21:52:00,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745112239] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:00,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:00,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:52:00,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249675796] [2025-04-13 21:52:00,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:00,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:52:00,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:00,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:52:00,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:52:00,036 INFO L87 Difference]: Start difference. First operand 349 states and 867 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:01,854 INFO L93 Difference]: Finished difference Result 594 states and 1404 transitions. [2025-04-13 21:52:01,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 21:52:01,854 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-04-13 21:52:01,855 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:01,857 INFO L225 Difference]: With dead ends: 594 [2025-04-13 21:52:01,857 INFO L226 Difference]: Without dead ends: 565 [2025-04-13 21:52:01,858 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2025-04-13 21:52:01,859 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 230 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:01,859 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 0 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 21:52:01,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-04-13 21:52:01,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 351. [2025-04-13 21:52:01,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 349 states have (on average 2.481375358166189) internal successors, (866), 350 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have 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,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 866 transitions. [2025-04-13 21:52:01,879 INFO L79 Accepts]: Start accepts. Automaton has 351 states and 866 transitions. Word has length 18 [2025-04-13 21:52:01,879 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:01,879 INFO L485 AbstractCegarLoop]: Abstraction has 351 states and 866 transitions. [2025-04-13 21:52:01,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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,880 INFO L278 IsEmpty]: Start isEmpty. Operand 351 states and 866 transitions. [2025-04-13 21:52:01,880 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:01,880 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:01,880 INFO L218 NwaCegarLoop]: trace histogram [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,880 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 21:52:01,880 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:01,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2040736873, now seen corresponding path program 1 times [2025-04-13 21:52:01,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:01,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601536661] [2025-04-13 21:52:01,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:01,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:01,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:01,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:01,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:01,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:03,323 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:52:03,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:03,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601536661] [2025-04-13 21:52:03,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601536661] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:03,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:03,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:52:03,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668573876] [2025-04-13 21:52:03,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:03,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:52:03,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:03,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:52:03,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:52:03,324 INFO L87 Difference]: Start difference. First operand 351 states and 866 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:04,465 INFO L93 Difference]: Finished difference Result 432 states and 1026 transitions. [2025-04-13 21:52:04,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 21:52:04,465 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:04,465 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:04,467 INFO L225 Difference]: With dead ends: 432 [2025-04-13 21:52:04,467 INFO L226 Difference]: Without dead ends: 383 [2025-04-13 21:52:04,467 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:52:04,467 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 78 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:04,468 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 0 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:52:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-04-13 21:52:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 359. [2025-04-13 21:52:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 357 states have (on average 2.481792717086835) internal successors, (886), 358 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have 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,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 886 transitions. [2025-04-13 21:52:04,486 INFO L79 Accepts]: Start accepts. Automaton has 359 states and 886 transitions. Word has length 19 [2025-04-13 21:52:04,486 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:04,486 INFO L485 AbstractCegarLoop]: Abstraction has 359 states and 886 transitions. [2025-04-13 21:52:04,486 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:04,486 INFO L278 IsEmpty]: Start isEmpty. Operand 359 states and 886 transitions. [2025-04-13 21:52:04,487 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:04,487 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:04,487 INFO L218 NwaCegarLoop]: trace histogram [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,488 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 21:52:04,488 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:04,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:04,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1528629583, now seen corresponding path program 2 times [2025-04-13 21:52:04,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:04,488 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117702925] [2025-04-13 21:52:04,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:52:04,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:04,511 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:04,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:04,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:52:04,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:05,383 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:52:05,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:05,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117702925] [2025-04-13 21:52:05,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117702925] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:05,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:05,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:52:05,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490619609] [2025-04-13 21:52:05,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:05,384 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:52:05,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:05,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:52:05,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:52:05,384 INFO L87 Difference]: Start difference. First operand 359 states and 886 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:06,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:06,471 INFO L93 Difference]: Finished difference Result 417 states and 993 transitions. [2025-04-13 21:52:06,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:52:06,471 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:06,471 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:06,473 INFO L225 Difference]: With dead ends: 417 [2025-04-13 21:52:06,473 INFO L226 Difference]: Without dead ends: 393 [2025-04-13 21:52:06,473 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:52:06,474 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:06,474 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:52:06,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-04-13 21:52:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 359. [2025-04-13 21:52:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 357 states have (on average 2.4761904761904763) internal successors, (884), 358 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have 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:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 884 transitions. [2025-04-13 21:52:06,493 INFO L79 Accepts]: Start accepts. Automaton has 359 states and 884 transitions. Word has length 19 [2025-04-13 21:52:06,494 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:06,494 INFO L485 AbstractCegarLoop]: Abstraction has 359 states and 884 transitions. [2025-04-13 21:52:06,494 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:06,494 INFO L278 IsEmpty]: Start isEmpty. Operand 359 states and 884 transitions. [2025-04-13 21:52:06,495 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:06,495 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:06,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:06,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 21:52:06,495 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:06,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:06,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1531008167, now seen corresponding path program 3 times [2025-04-13 21:52:06,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:06,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412674913] [2025-04-13 21:52:06,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:52:06,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:06,521 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:06,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:06,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:52:06,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:06,849 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:52:06,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:06,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412674913] [2025-04-13 21:52:06,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412674913] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:06,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:06,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 21:52:06,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322931209] [2025-04-13 21:52:06,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:06,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:52:06,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:06,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:52:06,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:52:06,850 INFO L87 Difference]: Start difference. First operand 359 states and 884 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:07,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:07,235 INFO L93 Difference]: Finished difference Result 469 states and 1093 transitions. [2025-04-13 21:52:07,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:52:07,235 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:07,235 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:07,237 INFO L225 Difference]: With dead ends: 469 [2025-04-13 21:52:07,237 INFO L226 Difference]: Without dead ends: 435 [2025-04-13 21:52:07,237 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:52:07,238 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 64 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:07,238 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 4 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:52:07,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-04-13 21:52:07,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 359. [2025-04-13 21:52:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 357 states have (on average 2.4593837535014007) internal successors, (878), 358 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have 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:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 878 transitions. [2025-04-13 21:52:07,257 INFO L79 Accepts]: Start accepts. Automaton has 359 states and 878 transitions. Word has length 19 [2025-04-13 21:52:07,257 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:07,257 INFO L485 AbstractCegarLoop]: Abstraction has 359 states and 878 transitions. [2025-04-13 21:52:07,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:07,257 INFO L278 IsEmpty]: Start isEmpty. Operand 359 states and 878 transitions. [2025-04-13 21:52:07,258 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:07,258 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:07,259 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:07,259 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 21:52:07,259 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:07,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:07,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1672975593, now seen corresponding path program 4 times [2025-04-13 21:52:07,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:07,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877330009] [2025-04-13 21:52:07,259 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:52:07,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:07,288 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:52:07,304 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:07,304 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:52:07,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:07,628 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:52:07,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:07,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877330009] [2025-04-13 21:52:07,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877330009] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:07,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:07,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 21:52:07,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173507986] [2025-04-13 21:52:07,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:07,629 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:52:07,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:07,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:52:07,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:52:07,629 INFO L87 Difference]: Start difference. First operand 359 states and 878 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:08,176 INFO L93 Difference]: Finished difference Result 429 states and 1013 transitions. [2025-04-13 21:52:08,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:52:08,177 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:08,177 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:08,179 INFO L225 Difference]: With dead ends: 429 [2025-04-13 21:52:08,179 INFO L226 Difference]: Without dead ends: 395 [2025-04-13 21:52:08,179 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:52:08,179 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 60 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:08,179 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 4 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 21:52:08,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-04-13 21:52:08,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 355. [2025-04-13 21:52:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 353 states have (on average 2.461756373937677) internal successors, (869), 354 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have 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:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 869 transitions. [2025-04-13 21:52:08,202 INFO L79 Accepts]: Start accepts. Automaton has 355 states and 869 transitions. Word has length 19 [2025-04-13 21:52:08,202 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:08,202 INFO L485 AbstractCegarLoop]: Abstraction has 355 states and 869 transitions. [2025-04-13 21:52:08,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:08,202 INFO L278 IsEmpty]: Start isEmpty. Operand 355 states and 869 transitions. [2025-04-13 21:52:08,203 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:08,203 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:08,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:08,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 21:52:08,203 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:08,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:08,203 INFO L85 PathProgramCache]: Analyzing trace with hash 561394727, now seen corresponding path program 1 times [2025-04-13 21:52:08,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:08,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886048226] [2025-04-13 21:52:08,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:08,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:08,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:08,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:08,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:08,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:09,180 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:52:09,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:09,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886048226] [2025-04-13 21:52:09,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886048226] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:09,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:09,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:52:09,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225299339] [2025-04-13 21:52:09,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:09,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:52:09,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:09,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:52:09,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:52:09,182 INFO L87 Difference]: Start difference. First operand 355 states and 869 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:09,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:09,921 INFO L93 Difference]: Finished difference Result 446 states and 1064 transitions. [2025-04-13 21:52:09,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:52:09,921 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:09,922 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:09,924 INFO L225 Difference]: With dead ends: 446 [2025-04-13 21:52:09,924 INFO L226 Difference]: Without dead ends: 397 [2025-04-13 21:52:09,924 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:52:09,924 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:09,924 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 21:52:09,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-04-13 21:52:09,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 371. [2025-04-13 21:52:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 369 states have (on average 2.4850948509485096) internal successors, (917), 370 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have 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:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 917 transitions. [2025-04-13 21:52:09,947 INFO L79 Accepts]: Start accepts. Automaton has 371 states and 917 transitions. Word has length 19 [2025-04-13 21:52:09,947 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:09,947 INFO L485 AbstractCegarLoop]: Abstraction has 371 states and 917 transitions. [2025-04-13 21:52:09,947 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:09,947 INFO L278 IsEmpty]: Start isEmpty. Operand 371 states and 917 transitions. [2025-04-13 21:52:09,948 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:09,948 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:09,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:09,948 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 21:52:09,948 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:09,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:09,948 INFO L85 PathProgramCache]: Analyzing trace with hash 578375597, now seen corresponding path program 2 times [2025-04-13 21:52:09,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:09,948 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939245060] [2025-04-13 21:52:09,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:52:09,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:09,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:10,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:10,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:52:10,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:11,239 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:52:11,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:11,240 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939245060] [2025-04-13 21:52:11,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939245060] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:11,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:11,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 21:52:11,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148622352] [2025-04-13 21:52:11,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:11,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:52:11,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:11,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:52:11,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:52:11,240 INFO L87 Difference]: Start difference. First operand 371 states and 917 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:12,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:12,618 INFO L93 Difference]: Finished difference Result 463 states and 1150 transitions. [2025-04-13 21:52:12,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:52:12,619 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:12,619 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:12,621 INFO L225 Difference]: With dead ends: 463 [2025-04-13 21:52:12,621 INFO L226 Difference]: Without dead ends: 443 [2025-04-13 21:52:12,621 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2025-04-13 21:52:12,621 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 115 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:12,621 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 0 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 21:52:12,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-04-13 21:52:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 389. [2025-04-13 21:52:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 387 states have (on average 2.5142118863049094) internal successors, (973), 388 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have 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:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 973 transitions. [2025-04-13 21:52:12,653 INFO L79 Accepts]: Start accepts. Automaton has 389 states and 973 transitions. Word has length 19 [2025-04-13 21:52:12,653 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:12,653 INFO L485 AbstractCegarLoop]: Abstraction has 389 states and 973 transitions. [2025-04-13 21:52:12,653 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:12,653 INFO L278 IsEmpty]: Start isEmpty. Operand 389 states and 973 transitions. [2025-04-13 21:52:12,654 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:12,654 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:12,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:12,654 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 21:52:12,654 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:12,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:12,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1132488197, now seen corresponding path program 3 times [2025-04-13 21:52:12,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:12,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601288196] [2025-04-13 21:52:12,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:52:12,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:12,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:12,717 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:12,717 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:52:12,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:14,553 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:52:14,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:14,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601288196] [2025-04-13 21:52:14,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601288196] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:14,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:14,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 21:52:14,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232498374] [2025-04-13 21:52:14,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:14,554 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:52:14,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:14,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:52:14,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:52:14,554 INFO L87 Difference]: Start difference. First operand 389 states and 973 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:16,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:16,300 INFO L93 Difference]: Finished difference Result 607 states and 1442 transitions. [2025-04-13 21:52:16,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 21:52:16,300 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:16,300 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:16,302 INFO L225 Difference]: With dead ends: 607 [2025-04-13 21:52:16,302 INFO L226 Difference]: Without dead ends: 587 [2025-04-13 21:52:16,303 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2025-04-13 21:52:16,303 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 210 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:16,303 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 0 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 21:52:16,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-04-13 21:52:16,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 399. [2025-04-13 21:52:16,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 397 states have (on average 2.4987405541561714) internal successors, (992), 398 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have 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,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 992 transitions. [2025-04-13 21:52:16,336 INFO L79 Accepts]: Start accepts. Automaton has 399 states and 992 transitions. Word has length 19 [2025-04-13 21:52:16,336 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:16,336 INFO L485 AbstractCegarLoop]: Abstraction has 399 states and 992 transitions. [2025-04-13 21:52:16,336 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:16,336 INFO L278 IsEmpty]: Start isEmpty. Operand 399 states and 992 transitions. [2025-04-13 21:52:16,337 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:16,337 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:16,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:16,337 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 21:52:16,337 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:16,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:16,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2030195949, now seen corresponding path program 4 times [2025-04-13 21:52:16,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:16,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830702633] [2025-04-13 21:52:16,337 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:52:16,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:16,367 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:52:16,389 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:16,389 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:52:16,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:17,072 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:52:17,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:17,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830702633] [2025-04-13 21:52:17,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830702633] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:17,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:17,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:52:17,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224005460] [2025-04-13 21:52:17,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:17,072 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:52:17,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:17,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:52:17,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:52:17,073 INFO L87 Difference]: Start difference. First operand 399 states and 992 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:17,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:17,816 INFO L93 Difference]: Finished difference Result 507 states and 1196 transitions. [2025-04-13 21:52:17,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:52:17,817 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:17,817 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:17,819 INFO L225 Difference]: With dead ends: 507 [2025-04-13 21:52:17,819 INFO L226 Difference]: Without dead ends: 487 [2025-04-13 21:52:17,819 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:52:17,819 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:17,819 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 21:52:17,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-04-13 21:52:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 383. [2025-04-13 21:52:17,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 381 states have (on average 2.477690288713911) internal successors, (944), 382 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have 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,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 944 transitions. [2025-04-13 21:52:17,849 INFO L79 Accepts]: Start accepts. Automaton has 383 states and 944 transitions. Word has length 19 [2025-04-13 21:52:17,849 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:17,849 INFO L485 AbstractCegarLoop]: Abstraction has 383 states and 944 transitions. [2025-04-13 21:52:17,849 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:17,849 INFO L278 IsEmpty]: Start isEmpty. Operand 383 states and 944 transitions. [2025-04-13 21:52:17,850 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:17,850 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:17,850 INFO L218 NwaCegarLoop]: trace histogram [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,850 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 21:52:17,850 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:17,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:17,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1476083349, now seen corresponding path program 5 times [2025-04-13 21:52:17,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:17,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166049298] [2025-04-13 21:52:17,850 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:52:17,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:17,874 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:17,916 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:17,916 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:52:17,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:20,273 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:52:20,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:20,273 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166049298] [2025-04-13 21:52:20,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166049298] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:20,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:20,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 21:52:20,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566455862] [2025-04-13 21:52:20,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:20,273 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:52:20,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:20,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:52:20,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:52:20,274 INFO L87 Difference]: Start difference. First operand 383 states and 944 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:21,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:21,791 INFO L93 Difference]: Finished difference Result 527 states and 1256 transitions. [2025-04-13 21:52:21,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:52:21,791 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:21,791 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:21,793 INFO L225 Difference]: With dead ends: 527 [2025-04-13 21:52:21,793 INFO L226 Difference]: Without dead ends: 507 [2025-04-13 21:52:21,793 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:52:21,794 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 166 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:21,794 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 0 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 21:52:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-04-13 21:52:21,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 389. [2025-04-13 21:52:21,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 387 states have (on average 2.4935400516795867) internal successors, (965), 388 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have 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,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 965 transitions. [2025-04-13 21:52:21,829 INFO L79 Accepts]: Start accepts. Automaton has 389 states and 965 transitions. Word has length 19 [2025-04-13 21:52:21,829 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:21,829 INFO L485 AbstractCegarLoop]: Abstraction has 389 states and 965 transitions. [2025-04-13 21:52:21,829 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:21,829 INFO L278 IsEmpty]: Start isEmpty. Operand 389 states and 965 transitions. [2025-04-13 21:52:21,830 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:21,830 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:21,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:21,830 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 21:52:21,830 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:21,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:21,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1826033725, now seen corresponding path program 1 times [2025-04-13 21:52:21,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:21,830 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394613699] [2025-04-13 21:52:21,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:21,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:21,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:21,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:21,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:21,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:23,316 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:52:23,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:23,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394613699] [2025-04-13 21:52:23,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394613699] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:23,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:23,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:52:23,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92448987] [2025-04-13 21:52:23,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:23,316 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:52:23,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:23,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:52:23,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:52:23,317 INFO L87 Difference]: Start difference. First operand 389 states and 965 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:25,025 INFO L93 Difference]: Finished difference Result 510 states and 1239 transitions. [2025-04-13 21:52:25,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:52:25,026 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:25,026 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:25,028 INFO L225 Difference]: With dead ends: 510 [2025-04-13 21:52:25,028 INFO L226 Difference]: Without dead ends: 461 [2025-04-13 21:52:25,028 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:52:25,028 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:25,029 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 21:52:25,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-04-13 21:52:25,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 411. [2025-04-13 21:52:25,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 409 states have (on average 2.5183374083129584) internal successors, (1030), 410 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have 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,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1030 transitions. [2025-04-13 21:52:25,064 INFO L79 Accepts]: Start accepts. Automaton has 411 states and 1030 transitions. Word has length 19 [2025-04-13 21:52:25,064 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:25,064 INFO L485 AbstractCegarLoop]: Abstraction has 411 states and 1030 transitions. [2025-04-13 21:52:25,064 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:25,064 INFO L278 IsEmpty]: Start isEmpty. Operand 411 states and 1030 transitions. [2025-04-13 21:52:25,065 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:25,065 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:25,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:25,065 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 21:52:25,065 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:25,065 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:25,065 INFO L85 PathProgramCache]: Analyzing trace with hash 984181261, now seen corresponding path program 6 times [2025-04-13 21:52:25,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:25,065 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464507143] [2025-04-13 21:52:25,065 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:52:25,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:25,089 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:25,109 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:25,109 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:52:25,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:26,207 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:52:26,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:26,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464507143] [2025-04-13 21:52:26,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464507143] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:26,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:26,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:52:26,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228767329] [2025-04-13 21:52:26,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:26,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:52:26,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:26,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:52:26,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:52:26,208 INFO L87 Difference]: Start difference. First operand 411 states and 1030 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:27,313 INFO L93 Difference]: Finished difference Result 510 states and 1235 transitions. [2025-04-13 21:52:27,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:52:27,314 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:27,314 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:27,316 INFO L225 Difference]: With dead ends: 510 [2025-04-13 21:52:27,316 INFO L226 Difference]: Without dead ends: 461 [2025-04-13 21:52:27,316 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:52:27,317 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:27,317 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:52:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-04-13 21:52:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 415. [2025-04-13 21:52:27,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 413 states have (on average 2.5181598062953996) internal successors, (1040), 414 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have 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:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1040 transitions. [2025-04-13 21:52:27,353 INFO L79 Accepts]: Start accepts. Automaton has 415 states and 1040 transitions. Word has length 19 [2025-04-13 21:52:27,354 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:27,354 INFO L485 AbstractCegarLoop]: Abstraction has 415 states and 1040 transitions. [2025-04-13 21:52:27,354 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:27,354 INFO L278 IsEmpty]: Start isEmpty. Operand 415 states and 1040 transitions. [2025-04-13 21:52:27,354 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:27,354 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:27,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:27,355 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 21:52:27,355 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:27,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:27,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1956364489, now seen corresponding path program 5 times [2025-04-13 21:52:27,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:27,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192218495] [2025-04-13 21:52:27,355 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:52:27,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:27,382 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:27,401 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:27,401 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:52:27,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:28,783 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:52:28,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:28,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192218495] [2025-04-13 21:52:28,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192218495] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:28,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:28,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:52:28,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52086620] [2025-04-13 21:52:28,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:28,784 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:52:28,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:28,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:52:28,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:52:28,784 INFO L87 Difference]: Start difference. First operand 415 states and 1040 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:29,932 INFO L93 Difference]: Finished difference Result 524 states and 1258 transitions. [2025-04-13 21:52:29,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:52:29,932 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:29,932 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:29,934 INFO L225 Difference]: With dead ends: 524 [2025-04-13 21:52:29,934 INFO L226 Difference]: Without dead ends: 469 [2025-04-13 21:52:29,935 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:52:29,935 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:29,935 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:52:29,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-04-13 21:52:29,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 417. [2025-04-13 21:52:29,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 415 states have (on average 2.513253012048193) internal successors, (1043), 416 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have 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:29,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1043 transitions. [2025-04-13 21:52:29,971 INFO L79 Accepts]: Start accepts. Automaton has 417 states and 1043 transitions. Word has length 19 [2025-04-13 21:52:29,971 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:29,971 INFO L485 AbstractCegarLoop]: Abstraction has 417 states and 1043 transitions. [2025-04-13 21:52:29,971 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:29,971 INFO L278 IsEmpty]: Start isEmpty. Operand 417 states and 1043 transitions. [2025-04-13 21:52:29,972 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:29,972 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:29,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:29,972 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 21:52:29,972 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:29,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:29,973 INFO L85 PathProgramCache]: Analyzing trace with hash 580647239, now seen corresponding path program 1 times [2025-04-13 21:52:29,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:29,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388246246] [2025-04-13 21:52:29,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:29,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:29,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:30,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:30,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:30,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:31,648 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:52:31,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:31,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388246246] [2025-04-13 21:52:31,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388246246] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:31,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:31,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 21:52:31,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900613059] [2025-04-13 21:52:31,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:31,649 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:52:31,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:31,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:52:31,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:52:31,650 INFO L87 Difference]: Start difference. First operand 417 states and 1043 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:34,092 INFO L93 Difference]: Finished difference Result 534 states and 1301 transitions. [2025-04-13 21:52:34,092 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:52:34,093 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:34,093 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:34,095 INFO L225 Difference]: With dead ends: 534 [2025-04-13 21:52:34,095 INFO L226 Difference]: Without dead ends: 507 [2025-04-13 21:52:34,095 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:52:34,096 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 130 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:34,096 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 0 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 21:52:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-04-13 21:52:34,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 417. [2025-04-13 21:52:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 415 states have (on average 2.508433734939759) internal successors, (1041), 416 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have 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:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1041 transitions. [2025-04-13 21:52:34,135 INFO L79 Accepts]: Start accepts. Automaton has 417 states and 1041 transitions. Word has length 19 [2025-04-13 21:52:34,135 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:34,135 INFO L485 AbstractCegarLoop]: Abstraction has 417 states and 1041 transitions. [2025-04-13 21:52:34,135 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:34,135 INFO L278 IsEmpty]: Start isEmpty. Operand 417 states and 1041 transitions. [2025-04-13 21:52:34,136 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:34,136 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:34,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:34,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 21:52:34,136 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:34,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:34,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1041170105, now seen corresponding path program 2 times [2025-04-13 21:52:34,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:34,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130718083] [2025-04-13 21:52:34,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:52:34,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:34,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:34,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:34,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:52:34,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:35,834 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:52:35,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:35,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130718083] [2025-04-13 21:52:35,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130718083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:35,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:35,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:52:35,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230500553] [2025-04-13 21:52:35,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:35,835 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:52:35,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:35,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:52:35,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:52:35,835 INFO L87 Difference]: Start difference. First operand 417 states and 1041 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:37,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:37,308 INFO L93 Difference]: Finished difference Result 514 states and 1247 transitions. [2025-04-13 21:52:37,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:52:37,308 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:37,308 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:37,310 INFO L225 Difference]: With dead ends: 514 [2025-04-13 21:52:37,310 INFO L226 Difference]: Without dead ends: 465 [2025-04-13 21:52:37,310 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:52:37,311 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:37,311 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 21:52:37,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-04-13 21:52:37,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 425. [2025-04-13 21:52:37,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 423 states have (on average 2.517730496453901) internal successors, (1065), 424 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have 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:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1065 transitions. [2025-04-13 21:52:37,352 INFO L79 Accepts]: Start accepts. Automaton has 425 states and 1065 transitions. Word has length 19 [2025-04-13 21:52:37,352 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:37,352 INFO L485 AbstractCegarLoop]: Abstraction has 425 states and 1065 transitions. [2025-04-13 21:52:37,353 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:37,353 INFO L278 IsEmpty]: Start isEmpty. Operand 425 states and 1065 transitions. [2025-04-13 21:52:37,353 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:37,353 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:37,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:37,353 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 21:52:37,354 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:37,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:37,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1495811895, now seen corresponding path program 6 times [2025-04-13 21:52:37,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:37,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507008951] [2025-04-13 21:52:37,354 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:52:37,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:37,376 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:37,399 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:37,399 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:52:37,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:38,334 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:52:38,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:38,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507008951] [2025-04-13 21:52:38,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507008951] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:38,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:38,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 21:52:38,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238447083] [2025-04-13 21:52:38,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:38,334 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:52:38,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:38,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:52:38,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:52:38,335 INFO L87 Difference]: Start difference. First operand 425 states and 1065 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:39,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:39,261 INFO L93 Difference]: Finished difference Result 548 states and 1328 transitions. [2025-04-13 21:52:39,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:52:39,261 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:39,261 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:39,263 INFO L225 Difference]: With dead ends: 548 [2025-04-13 21:52:39,263 INFO L226 Difference]: Without dead ends: 499 [2025-04-13 21:52:39,264 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:52:39,264 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 115 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:39,264 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 0 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:52:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-04-13 21:52:39,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 433. [2025-04-13 21:52:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 431 states have (on average 2.5266821345707657) internal successors, (1089), 432 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have 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:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1089 transitions. [2025-04-13 21:52:39,310 INFO L79 Accepts]: Start accepts. Automaton has 433 states and 1089 transitions. Word has length 19 [2025-04-13 21:52:39,310 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:39,310 INFO L485 AbstractCegarLoop]: Abstraction has 433 states and 1089 transitions. [2025-04-13 21:52:39,311 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:39,311 INFO L278 IsEmpty]: Start isEmpty. Operand 433 states and 1089 transitions. [2025-04-13 21:52:39,311 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:39,311 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:39,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:39,311 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 21:52:39,312 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:39,312 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:39,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1023727443, now seen corresponding path program 7 times [2025-04-13 21:52:39,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:39,312 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107870032] [2025-04-13 21:52:39,312 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:52:39,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:39,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:39,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:39,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:39,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:41,015 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:52:41,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:41,016 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107870032] [2025-04-13 21:52:41,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107870032] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:41,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:41,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:52:41,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979971424] [2025-04-13 21:52:41,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:41,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:52:41,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:41,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:52:41,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:52:41,016 INFO L87 Difference]: Start difference. First operand 433 states and 1089 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:42,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:42,447 INFO L93 Difference]: Finished difference Result 575 states and 1413 transitions. [2025-04-13 21:52:42,447 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:52:42,447 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:42,447 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:42,449 INFO L225 Difference]: With dead ends: 575 [2025-04-13 21:52:42,449 INFO L226 Difference]: Without dead ends: 526 [2025-04-13 21:52:42,450 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:52:42,450 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:42,450 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 0 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 21:52:42,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-04-13 21:52:42,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 431. [2025-04-13 21:52:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 429 states have (on average 2.536130536130536) internal successors, (1088), 430 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have 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:42,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1088 transitions. [2025-04-13 21:52:42,501 INFO L79 Accepts]: Start accepts. Automaton has 431 states and 1088 transitions. Word has length 19 [2025-04-13 21:52:42,501 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:42,502 INFO L485 AbstractCegarLoop]: Abstraction has 431 states and 1088 transitions. [2025-04-13 21:52:42,502 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:42,502 INFO L278 IsEmpty]: Start isEmpty. Operand 431 states and 1088 transitions. [2025-04-13 21:52:42,502 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:42,502 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:42,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:42,502 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 21:52:42,502 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:42,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:42,503 INFO L85 PathProgramCache]: Analyzing trace with hash -303431843, now seen corresponding path program 7 times [2025-04-13 21:52:42,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:42,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675495397] [2025-04-13 21:52:42,503 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:52:42,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:42,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:42,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:42,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:42,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:43,036 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:52:43,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:43,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675495397] [2025-04-13 21:52:43,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675495397] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:43,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:43,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 21:52:43,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422074095] [2025-04-13 21:52:43,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:43,037 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 21:52:43,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:43,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 21:52:43,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 21:52:43,037 INFO L87 Difference]: Start difference. First operand 431 states and 1088 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:43,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:43,698 INFO L93 Difference]: Finished difference Result 627 states and 1492 transitions. [2025-04-13 21:52:43,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:52:43,698 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:43,698 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:43,701 INFO L225 Difference]: With dead ends: 627 [2025-04-13 21:52:43,701 INFO L226 Difference]: Without dead ends: 589 [2025-04-13 21:52:43,701 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:52:43,702 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 99 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:43,702 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 0 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 21:52:43,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-04-13 21:52:43,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 437. [2025-04-13 21:52:43,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 435 states have (on average 2.5080459770114945) internal successors, (1091), 436 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have 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:43,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1091 transitions. [2025-04-13 21:52:43,754 INFO L79 Accepts]: Start accepts. Automaton has 437 states and 1091 transitions. Word has length 19 [2025-04-13 21:52:43,754 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:43,754 INFO L485 AbstractCegarLoop]: Abstraction has 437 states and 1091 transitions. [2025-04-13 21:52:43,754 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:43,754 INFO L278 IsEmpty]: Start isEmpty. Operand 437 states and 1091 transitions. [2025-04-13 21:52:43,754 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:43,755 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:43,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:43,755 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 21:52:43,755 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:43,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:43,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1397468309, now seen corresponding path program 8 times [2025-04-13 21:52:43,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:43,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996130493] [2025-04-13 21:52:43,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:52:43,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:43,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:43,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:43,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:52:43,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:45,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:52:45,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:45,618 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996130493] [2025-04-13 21:52:45,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996130493] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:45,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:45,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 21:52:45,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584738432] [2025-04-13 21:52:45,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:45,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:52:45,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:45,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:52:45,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:52:45,619 INFO L87 Difference]: Start difference. First operand 437 states and 1091 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:47,311 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 21:52:48,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:48,709 INFO L93 Difference]: Finished difference Result 713 states and 1717 transitions. [2025-04-13 21:52:48,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 21:52:48,709 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:48,709 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:48,712 INFO L225 Difference]: With dead ends: 713 [2025-04-13 21:52:48,712 INFO L226 Difference]: Without dead ends: 693 [2025-04-13 21:52:48,712 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2025-04-13 21:52:48,712 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 205 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:48,716 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 0 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-04-13 21:52:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-04-13 21:52:48,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 471. [2025-04-13 21:52:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 469 states have (on average 2.541577825159915) internal successors, (1192), 470 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have 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:48,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1192 transitions. [2025-04-13 21:52:48,775 INFO L79 Accepts]: Start accepts. Automaton has 471 states and 1192 transitions. Word has length 19 [2025-04-13 21:52:48,776 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:48,776 INFO L485 AbstractCegarLoop]: Abstraction has 471 states and 1192 transitions. [2025-04-13 21:52:48,776 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:48,776 INFO L278 IsEmpty]: Start isEmpty. Operand 471 states and 1192 transitions. [2025-04-13 21:52:48,776 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:48,776 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:48,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:48,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 21:52:48,776 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:48,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:48,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1370022253, now seen corresponding path program 9 times [2025-04-13 21:52:48,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:48,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943705296] [2025-04-13 21:52:48,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:52:48,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:48,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:48,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:48,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:52:48,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:50,082 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:52:50,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:50,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943705296] [2025-04-13 21:52:50,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943705296] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:50,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:50,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 21:52:50,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072761751] [2025-04-13 21:52:50,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:50,082 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:52:50,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:50,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:52:50,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:52:50,083 INFO L87 Difference]: Start difference. First operand 471 states and 1192 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:50,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:50,935 INFO L93 Difference]: Finished difference Result 588 states and 1450 transitions. [2025-04-13 21:52:50,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:52:50,935 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:50,936 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:50,938 INFO L225 Difference]: With dead ends: 588 [2025-04-13 21:52:50,938 INFO L226 Difference]: Without dead ends: 539 [2025-04-13 21:52:50,938 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:52:50,939 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:50,939 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 21:52:50,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-04-13 21:52:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 481. [2025-04-13 21:52:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 479 states have (on average 2.5407098121085596) internal successors, (1217), 480 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have 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:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1217 transitions. [2025-04-13 21:52:51,001 INFO L79 Accepts]: Start accepts. Automaton has 481 states and 1217 transitions. Word has length 19 [2025-04-13 21:52:51,001 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:51,001 INFO L485 AbstractCegarLoop]: Abstraction has 481 states and 1217 transitions. [2025-04-13 21:52:51,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:51,002 INFO L278 IsEmpty]: Start isEmpty. Operand 481 states and 1217 transitions. [2025-04-13 21:52:51,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:51,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:51,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:51,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 21:52:51,002 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:51,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:51,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1690095975, now seen corresponding path program 2 times [2025-04-13 21:52:51,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:51,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943697780] [2025-04-13 21:52:51,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:52:51,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:51,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:51,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:51,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:52:51,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:52,229 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:52:52,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:52,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943697780] [2025-04-13 21:52:52,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943697780] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:52,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:52,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:52:52,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115415636] [2025-04-13 21:52:52,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:52,229 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:52:52,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:52,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:52:52,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:52:52,230 INFO L87 Difference]: Start difference. First operand 481 states and 1217 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:53,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:53,519 INFO L93 Difference]: Finished difference Result 572 states and 1392 transitions. [2025-04-13 21:52:53,519 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:52:53,519 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:53,519 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:53,521 INFO L225 Difference]: With dead ends: 572 [2025-04-13 21:52:53,521 INFO L226 Difference]: Without dead ends: 523 [2025-04-13 21:52:53,522 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:52:53,522 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:53,522 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:52:53,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-04-13 21:52:53,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 489. [2025-04-13 21:52:53,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 487 states have (on average 2.5277207392197125) internal successors, (1231), 488 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have 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:53,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1231 transitions. [2025-04-13 21:52:53,586 INFO L79 Accepts]: Start accepts. Automaton has 489 states and 1231 transitions. Word has length 19 [2025-04-13 21:52:53,586 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:53,586 INFO L485 AbstractCegarLoop]: Abstraction has 489 states and 1231 transitions. [2025-04-13 21:52:53,586 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:53,586 INFO L278 IsEmpty]: Start isEmpty. Operand 489 states and 1231 transitions. [2025-04-13 21:52:53,586 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:53,586 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:53,587 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:53,587 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 21:52:53,587 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:53,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:53,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1177526893, now seen corresponding path program 8 times [2025-04-13 21:52:53,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:53,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745163535] [2025-04-13 21:52:53,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:52:53,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:53,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:53,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:53,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:52:53,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:54,681 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:52:54,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:54,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745163535] [2025-04-13 21:52:54,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745163535] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:54,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:54,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:52:54,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420965874] [2025-04-13 21:52:54,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:54,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:52:54,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:54,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:52:54,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:52:54,682 INFO L87 Difference]: Start difference. First operand 489 states and 1231 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:56,022 INFO L93 Difference]: Finished difference Result 561 states and 1367 transitions. [2025-04-13 21:52:56,022 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:52:56,022 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:56,022 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:56,024 INFO L225 Difference]: With dead ends: 561 [2025-04-13 21:52:56,024 INFO L226 Difference]: Without dead ends: 537 [2025-04-13 21:52:56,025 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:52:56,025 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:56,025 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:52:56,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-04-13 21:52:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 481. [2025-04-13 21:52:56,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 479 states have (on average 2.5407098121085596) internal successors, (1217), 480 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have 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:56,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1217 transitions. [2025-04-13 21:52:56,088 INFO L79 Accepts]: Start accepts. Automaton has 481 states and 1217 transitions. Word has length 19 [2025-04-13 21:52:56,088 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:56,088 INFO L485 AbstractCegarLoop]: Abstraction has 481 states and 1217 transitions. [2025-04-13 21:52:56,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:56,089 INFO L278 IsEmpty]: Start isEmpty. Operand 481 states and 1217 transitions. [2025-04-13 21:52:56,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:56,089 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:56,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:56,089 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 21:52:56,089 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:56,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:56,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1582203757, now seen corresponding path program 10 times [2025-04-13 21:52:56,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:56,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066450604] [2025-04-13 21:52:56,090 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:52:56,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:56,111 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:52:56,135 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:56,135 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:52:56,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:57,474 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:52:57,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:57,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066450604] [2025-04-13 21:52:57,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066450604] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:57,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:57,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:52:57,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009198714] [2025-04-13 21:52:57,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:57,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:52:57,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:57,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:52:57,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:52:57,475 INFO L87 Difference]: Start difference. First operand 481 states and 1217 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:59,212 INFO L93 Difference]: Finished difference Result 677 states and 1665 transitions. [2025-04-13 21:52:59,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:52:59,212 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:52:59,212 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:59,215 INFO L225 Difference]: With dead ends: 677 [2025-04-13 21:52:59,215 INFO L226 Difference]: Without dead ends: 657 [2025-04-13 21:52:59,215 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2025-04-13 21:52:59,216 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 126 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:59,216 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 0 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 21:52:59,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-04-13 21:52:59,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 491. [2025-04-13 21:52:59,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 489 states have (on average 2.5603271983640083) internal successors, (1252), 490 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have 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:59,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 1252 transitions. [2025-04-13 21:52:59,289 INFO L79 Accepts]: Start accepts. Automaton has 491 states and 1252 transitions. Word has length 19 [2025-04-13 21:52:59,289 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:59,289 INFO L485 AbstractCegarLoop]: Abstraction has 491 states and 1252 transitions. [2025-04-13 21:52:59,290 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:59,290 INFO L278 IsEmpty]: Start isEmpty. Operand 491 states and 1252 transitions. [2025-04-13 21:52:59,290 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:52:59,290 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:59,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:59,290 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 21:52:59,290 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:52:59,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:59,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1328907033, now seen corresponding path program 11 times [2025-04-13 21:52:59,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:59,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605562378] [2025-04-13 21:52:59,291 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:52:59,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:59,312 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:52:59,330 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:52:59,330 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:52:59,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:00,679 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:53:00,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:00,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605562378] [2025-04-13 21:53:00,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605562378] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:00,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:00,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:53:00,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969359341] [2025-04-13 21:53:00,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:00,679 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:53:00,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:00,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:53:00,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:53:00,680 INFO L87 Difference]: Start difference. First operand 491 states and 1252 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:02,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:02,205 INFO L93 Difference]: Finished difference Result 575 states and 1436 transitions. [2025-04-13 21:53:02,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:53:02,205 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:53:02,205 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:02,207 INFO L225 Difference]: With dead ends: 575 [2025-04-13 21:53:02,207 INFO L226 Difference]: Without dead ends: 555 [2025-04-13 21:53:02,208 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:53:02,208 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:02,208 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 21:53:02,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-04-13 21:53:02,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 467. [2025-04-13 21:53:02,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 2.529032258064516) internal successors, (1176), 466 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have 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,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 1176 transitions. [2025-04-13 21:53:02,268 INFO L79 Accepts]: Start accepts. Automaton has 467 states and 1176 transitions. Word has length 19 [2025-04-13 21:53:02,268 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:02,268 INFO L485 AbstractCegarLoop]: Abstraction has 467 states and 1176 transitions. [2025-04-13 21:53:02,268 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:02,268 INFO L278 IsEmpty]: Start isEmpty. Operand 467 states and 1176 transitions. [2025-04-13 21:53:02,269 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:53:02,269 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:02,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:02,269 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 21:53:02,269 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:53:02,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:02,269 INFO L85 PathProgramCache]: Analyzing trace with hash 591107687, now seen corresponding path program 3 times [2025-04-13 21:53:02,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:02,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869380572] [2025-04-13 21:53:02,269 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:53:02,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:02,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:53:02,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:53:02,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:53:02,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:02,977 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:53:02,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:02,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869380572] [2025-04-13 21:53:02,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869380572] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:02,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:02,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 21:53:02,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270935873] [2025-04-13 21:53:02,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:02,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 21:53:02,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:02,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 21:53:02,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 21:53:02,978 INFO L87 Difference]: Start difference. First operand 467 states and 1176 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:03,794 INFO L93 Difference]: Finished difference Result 680 states and 1634 transitions. [2025-04-13 21:53:03,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:53:03,794 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:53:03,795 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:03,797 INFO L225 Difference]: With dead ends: 680 [2025-04-13 21:53:03,797 INFO L226 Difference]: Without dead ends: 643 [2025-04-13 21:53:03,797 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:53:03,798 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 98 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:03,798 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 0 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 21:53:03,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-04-13 21:53:03,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 473. [2025-04-13 21:53:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 471 states have (on average 2.5116772823779194) internal successors, (1183), 472 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have 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,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1183 transitions. [2025-04-13 21:53:03,858 INFO L79 Accepts]: Start accepts. Automaton has 473 states and 1183 transitions. Word has length 19 [2025-04-13 21:53:03,858 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:03,858 INFO L485 AbstractCegarLoop]: Abstraction has 473 states and 1183 transitions. [2025-04-13 21:53:03,858 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:03,858 INFO L278 IsEmpty]: Start isEmpty. Operand 473 states and 1183 transitions. [2025-04-13 21:53:03,859 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:53:03,859 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:03,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:03,859 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 21:53:03,859 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:53:03,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:03,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1088307089, now seen corresponding path program 12 times [2025-04-13 21:53:03,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:03,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731979094] [2025-04-13 21:53:03,860 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:53:03,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:03,881 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:53:03,901 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:53:03,902 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:53:03,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:05,295 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:53:05,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:05,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731979094] [2025-04-13 21:53:05,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731979094] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:05,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:05,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:53:05,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550791333] [2025-04-13 21:53:05,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:05,296 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:53:05,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:05,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:53:05,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:53:05,297 INFO L87 Difference]: Start difference. First operand 473 states and 1183 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:06,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:06,751 INFO L93 Difference]: Finished difference Result 582 states and 1409 transitions. [2025-04-13 21:53:06,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:53:06,751 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:53:06,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:06,753 INFO L225 Difference]: With dead ends: 582 [2025-04-13 21:53:06,753 INFO L226 Difference]: Without dead ends: 533 [2025-04-13 21:53:06,754 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:53:06,754 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:06,754 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 0 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 21:53:06,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-04-13 21:53:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 485. [2025-04-13 21:53:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 483 states have (on average 2.5196687370600412) internal successors, (1217), 484 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have 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:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1217 transitions. [2025-04-13 21:53:06,817 INFO L79 Accepts]: Start accepts. Automaton has 485 states and 1217 transitions. Word has length 19 [2025-04-13 21:53:06,817 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:06,817 INFO L485 AbstractCegarLoop]: Abstraction has 485 states and 1217 transitions. [2025-04-13 21:53:06,817 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:06,818 INFO L278 IsEmpty]: Start isEmpty. Operand 485 states and 1217 transitions. [2025-04-13 21:53:06,818 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:53:06,818 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:06,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:06,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 21:53:06,819 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:53:06,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:06,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1232347711, now seen corresponding path program 3 times [2025-04-13 21:53:06,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:06,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181845715] [2025-04-13 21:53:06,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:53:06,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:06,856 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:53:06,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:53:06,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:53:06,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:09,008 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:53:09,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:09,008 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181845715] [2025-04-13 21:53:09,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181845715] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:09,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:09,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:53:09,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743005127] [2025-04-13 21:53:09,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:09,009 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:53:09,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:09,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:53:09,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:53:09,009 INFO L87 Difference]: Start difference. First operand 485 states and 1217 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:10,822 INFO L93 Difference]: Finished difference Result 612 states and 1482 transitions. [2025-04-13 21:53:10,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:53:10,822 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:53:10,822 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:10,824 INFO L225 Difference]: With dead ends: 612 [2025-04-13 21:53:10,824 INFO L226 Difference]: Without dead ends: 563 [2025-04-13 21:53:10,824 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:53:10,825 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:10,825 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 21:53:10,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-04-13 21:53:10,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 505. [2025-04-13 21:53:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 503 states have (on average 2.5268389662027833) internal successors, (1271), 504 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have 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:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1271 transitions. [2025-04-13 21:53:10,898 INFO L79 Accepts]: Start accepts. Automaton has 505 states and 1271 transitions. Word has length 19 [2025-04-13 21:53:10,898 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:10,898 INFO L485 AbstractCegarLoop]: Abstraction has 505 states and 1271 transitions. [2025-04-13 21:53:10,898 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:10,898 INFO L278 IsEmpty]: Start isEmpty. Operand 505 states and 1271 transitions. [2025-04-13 21:53:10,899 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:53:10,899 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:10,899 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:10,899 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 21:53:10,899 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:53:10,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:10,899 INFO L85 PathProgramCache]: Analyzing trace with hash 684773067, now seen corresponding path program 4 times [2025-04-13 21:53:10,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:10,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945922828] [2025-04-13 21:53:10,899 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:53:10,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:10,921 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:53:10,946 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:53:10,946 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:53:10,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:12,347 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:53:12,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:12,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945922828] [2025-04-13 21:53:12,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945922828] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:12,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:12,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:53:12,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369725768] [2025-04-13 21:53:12,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:12,348 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:53:12,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:12,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:53:12,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:53:12,348 INFO L87 Difference]: Start difference. First operand 505 states and 1271 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:14,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:14,310 INFO L93 Difference]: Finished difference Result 792 states and 1992 transitions. [2025-04-13 21:53:14,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 21:53:14,310 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:53:14,310 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:14,312 INFO L225 Difference]: With dead ends: 792 [2025-04-13 21:53:14,312 INFO L226 Difference]: Without dead ends: 741 [2025-04-13 21:53:14,313 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2025-04-13 21:53:14,313 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 160 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:14,313 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 0 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 21:53:14,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-04-13 21:53:14,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 515. [2025-04-13 21:53:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 513 states have (on average 2.5536062378167643) internal successors, (1310), 514 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have 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:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1310 transitions. [2025-04-13 21:53:14,377 INFO L79 Accepts]: Start accepts. Automaton has 515 states and 1310 transitions. Word has length 19 [2025-04-13 21:53:14,377 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:14,378 INFO L485 AbstractCegarLoop]: Abstraction has 515 states and 1310 transitions. [2025-04-13 21:53:14,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:14,378 INFO L278 IsEmpty]: Start isEmpty. Operand 515 states and 1310 transitions. [2025-04-13 21:53:14,378 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:53:14,378 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:14,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:14,378 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-13 21:53:14,378 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:53:14,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:14,379 INFO L85 PathProgramCache]: Analyzing trace with hash -719778629, now seen corresponding path program 9 times [2025-04-13 21:53:14,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:14,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887554040] [2025-04-13 21:53:14,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:53:14,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:14,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:53:14,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:53:14,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:53:14,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:15,436 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:53:15,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:15,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887554040] [2025-04-13 21:53:15,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887554040] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:15,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:15,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:53:15,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798731782] [2025-04-13 21:53:15,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:15,437 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:53:15,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:15,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:53:15,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:53:15,438 INFO L87 Difference]: Start difference. First operand 515 states and 1310 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:16,761 INFO L93 Difference]: Finished difference Result 638 states and 1563 transitions. [2025-04-13 21:53:16,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:53:16,762 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:53:16,762 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:16,763 INFO L225 Difference]: With dead ends: 638 [2025-04-13 21:53:16,763 INFO L226 Difference]: Without dead ends: 569 [2025-04-13 21:53:16,764 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:53:16,764 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 129 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:16,764 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 0 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:53:16,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-04-13 21:53:16,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 489. [2025-04-13 21:53:16,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 487 states have (on average 2.5277207392197125) internal successors, (1231), 488 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have 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,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1231 transitions. [2025-04-13 21:53:16,829 INFO L79 Accepts]: Start accepts. Automaton has 489 states and 1231 transitions. Word has length 19 [2025-04-13 21:53:16,829 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:16,829 INFO L485 AbstractCegarLoop]: Abstraction has 489 states and 1231 transitions. [2025-04-13 21:53:16,829 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:16,829 INFO L278 IsEmpty]: Start isEmpty. Operand 489 states and 1231 transitions. [2025-04-13 21:53:16,829 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:53:16,829 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:16,829 INFO L218 NwaCegarLoop]: trace histogram [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,830 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 21:53:16,830 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:53:16,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:16,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1599937723, now seen corresponding path program 10 times [2025-04-13 21:53:16,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:16,830 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487104707] [2025-04-13 21:53:16,830 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:53:16,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:16,852 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:53:16,887 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:53:16,887 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:53:16,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:17,878 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:53:17,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:17,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487104707] [2025-04-13 21:53:17,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487104707] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:17,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:17,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 21:53:17,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985494181] [2025-04-13 21:53:17,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:17,879 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:53:17,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:17,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:53:17,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:53:17,880 INFO L87 Difference]: Start difference. First operand 489 states and 1231 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:18,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:18,618 INFO L93 Difference]: Finished difference Result 698 states and 1727 transitions. [2025-04-13 21:53:18,619 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:53:18,619 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:53:18,619 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:18,621 INFO L225 Difference]: With dead ends: 698 [2025-04-13 21:53:18,621 INFO L226 Difference]: Without dead ends: 649 [2025-04-13 21:53:18,621 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:53:18,622 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:18,622 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 21:53:18,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-04-13 21:53:18,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 499. [2025-04-13 21:53:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 497 states have (on average 2.5553319919517103) internal successors, (1270), 498 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have 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:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1270 transitions. [2025-04-13 21:53:18,691 INFO L79 Accepts]: Start accepts. Automaton has 499 states and 1270 transitions. Word has length 19 [2025-04-13 21:53:18,691 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:18,691 INFO L485 AbstractCegarLoop]: Abstraction has 499 states and 1270 transitions. [2025-04-13 21:53:18,691 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:18,691 INFO L278 IsEmpty]: Start isEmpty. Operand 499 states and 1270 transitions. [2025-04-13 21:53:18,692 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:53:18,692 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:18,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:18,692 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 21:53:18,692 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:53:18,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:18,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1817233099, now seen corresponding path program 5 times [2025-04-13 21:53:18,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:18,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977032706] [2025-04-13 21:53:18,693 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:53:18,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:18,715 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:53:18,733 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:53:18,733 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:53:18,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:20,189 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:53:20,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:20,189 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977032706] [2025-04-13 21:53:20,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977032706] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:20,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:20,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:53:20,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108144143] [2025-04-13 21:53:20,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:20,190 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:53:20,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:20,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:53:20,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:53:20,190 INFO L87 Difference]: Start difference. First operand 499 states and 1270 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:21,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:21,854 INFO L93 Difference]: Finished difference Result 678 states and 1689 transitions. [2025-04-13 21:53:21,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 21:53:21,854 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:53:21,854 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:21,856 INFO L225 Difference]: With dead ends: 678 [2025-04-13 21:53:21,856 INFO L226 Difference]: Without dead ends: 651 [2025-04-13 21:53:21,856 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:53:21,857 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:21,857 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:53:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-04-13 21:53:21,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 499. [2025-04-13 21:53:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 497 states have (on average 2.5593561368209254) internal successors, (1272), 498 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have 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:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1272 transitions. [2025-04-13 21:53:21,929 INFO L79 Accepts]: Start accepts. Automaton has 499 states and 1272 transitions. Word has length 19 [2025-04-13 21:53:21,929 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:21,929 INFO L485 AbstractCegarLoop]: Abstraction has 499 states and 1272 transitions. [2025-04-13 21:53:21,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:21,929 INFO L278 IsEmpty]: Start isEmpty. Operand 499 states and 1272 transitions. [2025-04-13 21:53:21,930 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:53:21,930 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:21,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:21,930 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-13 21:53:21,930 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:53:21,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:21,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1587857441, now seen corresponding path program 4 times [2025-04-13 21:53:21,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:21,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397395725] [2025-04-13 21:53:21,931 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:53:21,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:21,952 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:53:21,982 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:53:21,982 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:53:21,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:23,293 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:53:23,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:23,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397395725] [2025-04-13 21:53:23,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397395725] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:23,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:23,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:53:23,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518468938] [2025-04-13 21:53:23,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:23,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:53:23,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:23,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:53:23,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:53:23,295 INFO L87 Difference]: Start difference. First operand 499 states and 1272 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:24,409 INFO L93 Difference]: Finished difference Result 718 states and 1741 transitions. [2025-04-13 21:53:24,410 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:53:24,410 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:53:24,410 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:24,412 INFO L225 Difference]: With dead ends: 718 [2025-04-13 21:53:24,412 INFO L226 Difference]: Without dead ends: 669 [2025-04-13 21:53:24,412 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:53:24,412 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 128 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:24,413 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 0 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:53:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-04-13 21:53:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 501. [2025-04-13 21:53:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 499 states have (on average 2.567134268537074) internal successors, (1281), 500 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have 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:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1281 transitions. [2025-04-13 21:53:24,484 INFO L79 Accepts]: Start accepts. Automaton has 501 states and 1281 transitions. Word has length 19 [2025-04-13 21:53:24,484 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:24,484 INFO L485 AbstractCegarLoop]: Abstraction has 501 states and 1281 transitions. [2025-04-13 21:53:24,484 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:24,484 INFO L278 IsEmpty]: Start isEmpty. Operand 501 states and 1281 transitions. [2025-04-13 21:53:24,485 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:53:24,485 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:24,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:24,485 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-13 21:53:24,485 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:53:24,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:24,485 INFO L85 PathProgramCache]: Analyzing trace with hash 195415755, now seen corresponding path program 6 times [2025-04-13 21:53:24,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:24,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169611142] [2025-04-13 21:53:24,485 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:53:24,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:24,507 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:53:24,529 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:53:24,529 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:53:24,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:26,186 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:53:26,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:26,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169611142] [2025-04-13 21:53:26,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169611142] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:26,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:26,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:53:26,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615872167] [2025-04-13 21:53:26,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:26,187 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:53:26,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:26,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:53:26,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:53:26,187 INFO L87 Difference]: Start difference. First operand 501 states and 1281 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:27,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:27,727 INFO L93 Difference]: Finished difference Result 640 states and 1594 transitions. [2025-04-13 21:53:27,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:53:27,727 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:53:27,727 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:27,729 INFO L225 Difference]: With dead ends: 640 [2025-04-13 21:53:27,729 INFO L226 Difference]: Without dead ends: 591 [2025-04-13 21:53:27,729 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2025-04-13 21:53:27,730 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:27,730 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 21:53:27,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-04-13 21:53:27,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 519. [2025-04-13 21:53:27,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 517 states have (on average 2.588007736943907) internal successors, (1338), 518 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have 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:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1338 transitions. [2025-04-13 21:53:27,803 INFO L79 Accepts]: Start accepts. Automaton has 519 states and 1338 transitions. Word has length 19 [2025-04-13 21:53:27,803 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:27,803 INFO L485 AbstractCegarLoop]: Abstraction has 519 states and 1338 transitions. [2025-04-13 21:53:27,803 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:27,804 INFO L278 IsEmpty]: Start isEmpty. Operand 519 states and 1338 transitions. [2025-04-13 21:53:27,804 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:53:27,804 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:27,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:27,804 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 21:53:27,804 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:53:27,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:27,805 INFO L85 PathProgramCache]: Analyzing trace with hash -936582485, now seen corresponding path program 13 times [2025-04-13 21:53:27,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:27,805 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290480081] [2025-04-13 21:53:27,805 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:53:27,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:27,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:53:27,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:53:27,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:53:27,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:29,147 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:53:29,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:29,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290480081] [2025-04-13 21:53:29,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290480081] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:29,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:29,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:53:29,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199511009] [2025-04-13 21:53:29,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:29,148 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:53:29,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:29,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:53:29,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:53:29,148 INFO L87 Difference]: Start difference. First operand 519 states and 1338 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:30,629 INFO L93 Difference]: Finished difference Result 650 states and 1635 transitions. [2025-04-13 21:53:30,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:53:30,630 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:53:30,630 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:30,632 INFO L225 Difference]: With dead ends: 650 [2025-04-13 21:53:30,632 INFO L226 Difference]: Without dead ends: 601 [2025-04-13 21:53:30,632 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:53:30,632 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:30,632 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 21:53:30,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-04-13 21:53:30,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 509. [2025-04-13 21:53:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 507 states have (on average 2.57396449704142) internal successors, (1305), 508 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have 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:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1305 transitions. [2025-04-13 21:53:30,708 INFO L79 Accepts]: Start accepts. Automaton has 509 states and 1305 transitions. Word has length 19 [2025-04-13 21:53:30,708 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:30,708 INFO L485 AbstractCegarLoop]: Abstraction has 509 states and 1305 transitions. [2025-04-13 21:53:30,708 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:30,708 INFO L278 IsEmpty]: Start isEmpty. Operand 509 states and 1305 transitions. [2025-04-13 21:53:30,709 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:53:30,709 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:30,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:30,709 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-04-13 21:53:30,709 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:53:30,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:30,709 INFO L85 PathProgramCache]: Analyzing trace with hash 212858417, now seen corresponding path program 14 times [2025-04-13 21:53:30,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:30,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537509219] [2025-04-13 21:53:30,709 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:53:30,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:30,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:53:30,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:53:30,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:53:30,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:32,620 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:53:32,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:32,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537509219] [2025-04-13 21:53:32,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537509219] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:32,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:32,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 21:53:32,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15472149] [2025-04-13 21:53:32,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:32,621 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:53:32,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:32,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:53:32,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:53:32,621 INFO L87 Difference]: Start difference. First operand 509 states and 1305 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:33,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:33,951 INFO L93 Difference]: Finished difference Result 587 states and 1462 transitions. [2025-04-13 21:53:33,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:53:33,951 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:53:33,951 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:33,953 INFO L225 Difference]: With dead ends: 587 [2025-04-13 21:53:33,953 INFO L226 Difference]: Without dead ends: 567 [2025-04-13 21:53:33,953 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:53:33,954 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:33,954 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 21:53:33,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-04-13 21:53:34,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 497. [2025-04-13 21:53:34,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 495 states have (on average 2.5595959595959594) internal successors, (1267), 496 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have 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:34,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1267 transitions. [2025-04-13 21:53:34,035 INFO L79 Accepts]: Start accepts. Automaton has 497 states and 1267 transitions. Word has length 19 [2025-04-13 21:53:34,035 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:34,035 INFO L485 AbstractCegarLoop]: Abstraction has 497 states and 1267 transitions. [2025-04-13 21:53:34,035 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:34,035 INFO L278 IsEmpty]: Start isEmpty. Operand 497 states and 1267 transitions. [2025-04-13 21:53:34,036 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:53:34,036 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:34,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:34,036 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-13 21:53:34,036 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:53:34,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:34,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1725367653, now seen corresponding path program 11 times [2025-04-13 21:53:34,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:34,036 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313408476] [2025-04-13 21:53:34,036 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:53:34,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:34,059 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:53:34,082 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:53:34,082 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:53:34,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:35,594 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:53:35,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:35,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313408476] [2025-04-13 21:53:35,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313408476] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:35,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:35,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:53:35,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979204154] [2025-04-13 21:53:35,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:35,595 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:53:35,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:35,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:53:35,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:53:35,595 INFO L87 Difference]: Start difference. First operand 497 states and 1267 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:37,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:37,355 INFO L93 Difference]: Finished difference Result 672 states and 1658 transitions. [2025-04-13 21:53:37,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:53:37,355 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:53:37,355 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:37,357 INFO L225 Difference]: With dead ends: 672 [2025-04-13 21:53:37,357 INFO L226 Difference]: Without dead ends: 623 [2025-04-13 21:53:37,358 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:53:37,358 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:37,358 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 21:53:37,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-04-13 21:53:37,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 491. [2025-04-13 21:53:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 489 states have (on average 2.5480572597137012) internal successors, (1246), 490 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have 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,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 1246 transitions. [2025-04-13 21:53:37,435 INFO L79 Accepts]: Start accepts. Automaton has 491 states and 1246 transitions. Word has length 19 [2025-04-13 21:53:37,435 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:37,435 INFO L485 AbstractCegarLoop]: Abstraction has 491 states and 1246 transitions. [2025-04-13 21:53:37,435 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:37,435 INFO L278 IsEmpty]: Start isEmpty. Operand 491 states and 1246 transitions. [2025-04-13 21:53:37,436 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:53:37,436 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:37,436 INFO L218 NwaCegarLoop]: trace histogram [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,436 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-04-13 21:53:37,436 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:53:37,436 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:37,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1731398471, now seen corresponding path program 7 times [2025-04-13 21:53:37,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:37,436 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167147003] [2025-04-13 21:53:37,436 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:53:37,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:37,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:53:37,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:53:37,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:53:37,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:38,607 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:53:38,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:38,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167147003] [2025-04-13 21:53:38,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167147003] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:38,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:38,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:53:38,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461547009] [2025-04-13 21:53:38,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:38,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:53:38,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:38,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:53:38,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:53:38,608 INFO L87 Difference]: Start difference. First operand 491 states and 1246 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:39,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:39,805 INFO L93 Difference]: Finished difference Result 616 states and 1526 transitions. [2025-04-13 21:53:39,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:53:39,806 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:53:39,806 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:39,808 INFO L225 Difference]: With dead ends: 616 [2025-04-13 21:53:39,808 INFO L226 Difference]: Without dead ends: 567 [2025-04-13 21:53:39,808 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:53:39,808 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:39,808 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 21:53:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-04-13 21:53:39,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 503. [2025-04-13 21:53:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 501 states have (on average 2.5588822355289422) internal successors, (1282), 502 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have 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:39,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 1282 transitions. [2025-04-13 21:53:39,889 INFO L79 Accepts]: Start accepts. Automaton has 503 states and 1282 transitions. Word has length 19 [2025-04-13 21:53:39,889 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:39,889 INFO L485 AbstractCegarLoop]: Abstraction has 503 states and 1282 transitions. [2025-04-13 21:53:39,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:39,889 INFO L278 IsEmpty]: Start isEmpty. Operand 503 states and 1282 transitions. [2025-04-13 21:53:39,890 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:53:39,890 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:39,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:39,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-13 21:53:39,890 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:53:39,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:39,890 INFO L85 PathProgramCache]: Analyzing trace with hash 576098055, now seen corresponding path program 8 times [2025-04-13 21:53:39,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:39,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678209737] [2025-04-13 21:53:39,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:53:39,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:39,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:53:39,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:53:39,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:53:39,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:41,347 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:53:41,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:41,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678209737] [2025-04-13 21:53:41,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678209737] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:41,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:41,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:53:41,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252062753] [2025-04-13 21:53:41,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:41,348 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:53:41,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:41,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:53:41,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:53:41,348 INFO L87 Difference]: Start difference. First operand 503 states and 1282 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:43,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:43,551 INFO L93 Difference]: Finished difference Result 624 states and 1538 transitions. [2025-04-13 21:53:43,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:53:43,551 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:53:43,551 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:43,553 INFO L225 Difference]: With dead ends: 624 [2025-04-13 21:53:43,553 INFO L226 Difference]: Without dead ends: 597 [2025-04-13 21:53:43,553 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2025-04-13 21:53:43,554 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 105 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:43,554 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 0 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 21:53:43,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-04-13 21:53:43,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 499. [2025-04-13 21:53:43,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 497 states have (on average 2.563380281690141) internal successors, (1274), 498 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have 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,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1274 transitions. [2025-04-13 21:53:43,646 INFO L79 Accepts]: Start accepts. Automaton has 499 states and 1274 transitions. Word has length 19 [2025-04-13 21:53:43,646 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:43,646 INFO L485 AbstractCegarLoop]: Abstraction has 499 states and 1274 transitions. [2025-04-13 21:53:43,646 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:43,646 INFO L278 IsEmpty]: Start isEmpty. Operand 499 states and 1274 transitions. [2025-04-13 21:53:43,647 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:53:43,647 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:43,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:43,647 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-04-13 21:53:43,647 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:53:43,647 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:43,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1748841133, now seen corresponding path program 15 times [2025-04-13 21:53:43,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:43,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706252800] [2025-04-13 21:53:43,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:53:43,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:43,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:53:43,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:53:43,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:53:43,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:44,724 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:53:44,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:44,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706252800] [2025-04-13 21:53:44,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706252800] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:44,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:44,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:53:44,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590409674] [2025-04-13 21:53:44,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:44,725 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:53:44,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:44,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:53:44,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:53:44,726 INFO L87 Difference]: Start difference. First operand 499 states and 1274 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:45,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:45,858 INFO L93 Difference]: Finished difference Result 589 states and 1467 transitions. [2025-04-13 21:53:45,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:53:45,858 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:53:45,858 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:45,860 INFO L225 Difference]: With dead ends: 589 [2025-04-13 21:53:45,860 INFO L226 Difference]: Without dead ends: 569 [2025-04-13 21:53:45,861 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:53:45,861 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:45,861 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 0 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 21:53:45,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-04-13 21:53:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 483. [2025-04-13 21:53:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 481 states have (on average 2.553014553014553) internal successors, (1228), 482 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have 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:45,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 1228 transitions. [2025-04-13 21:53:45,937 INFO L79 Accepts]: Start accepts. Automaton has 483 states and 1228 transitions. Word has length 19 [2025-04-13 21:53:45,937 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:45,937 INFO L485 AbstractCegarLoop]: Abstraction has 483 states and 1228 transitions. [2025-04-13 21:53:45,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:45,937 INFO L278 IsEmpty]: Start isEmpty. Operand 483 states and 1228 transitions. [2025-04-13 21:53:45,938 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:53:45,938 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:45,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:45,938 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-13 21:53:45,938 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:53:45,938 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:45,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1491262711, now seen corresponding path program 12 times [2025-04-13 21:53:45,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:45,938 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940344756] [2025-04-13 21:53:45,939 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:53:45,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:45,961 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:53:45,986 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:53:45,986 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:53:45,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:48,006 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:53:48,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:48,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940344756] [2025-04-13 21:53:48,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940344756] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:48,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:48,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:53:48,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764409271] [2025-04-13 21:53:48,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:48,006 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:53:48,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:48,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:53:48,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:53:48,007 INFO L87 Difference]: Start difference. First operand 483 states and 1228 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:49,989 INFO L93 Difference]: Finished difference Result 646 states and 1597 transitions. [2025-04-13 21:53:49,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:53:49,990 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:53:49,990 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:49,992 INFO L225 Difference]: With dead ends: 646 [2025-04-13 21:53:49,992 INFO L226 Difference]: Without dead ends: 597 [2025-04-13 21:53:49,992 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2025-04-13 21:53:49,992 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:49,993 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 21:53:49,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-04-13 21:53:50,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 487. [2025-04-13 21:53:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 485 states have (on average 2.5649484536082476) internal successors, (1244), 486 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have 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,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1244 transitions. [2025-04-13 21:53:50,078 INFO L79 Accepts]: Start accepts. Automaton has 487 states and 1244 transitions. Word has length 19 [2025-04-13 21:53:50,078 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:50,078 INFO L485 AbstractCegarLoop]: Abstraction has 487 states and 1244 transitions. [2025-04-13 21:53:50,078 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:50,078 INFO L278 IsEmpty]: Start isEmpty. Operand 487 states and 1244 transitions. [2025-04-13 21:53:50,079 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:53:50,079 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:50,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:50,079 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-04-13 21:53:50,079 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:53:50,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:50,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1823268479, now seen corresponding path program 5 times [2025-04-13 21:53:50,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:50,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604496561] [2025-04-13 21:53:50,079 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:53:50,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:50,103 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:53:50,141 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:53:50,141 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:53:50,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:51,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:53:51,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:51,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604496561] [2025-04-13 21:53:51,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604496561] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:51,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:51,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:53:51,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841750661] [2025-04-13 21:53:51,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:51,776 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:53:51,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:51,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:53:51,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:53:51,776 INFO L87 Difference]: Start difference. First operand 487 states and 1244 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:53,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:53,623 INFO L93 Difference]: Finished difference Result 648 states and 1590 transitions. [2025-04-13 21:53:53,623 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:53:53,623 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:53:53,623 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:53,625 INFO L225 Difference]: With dead ends: 648 [2025-04-13 21:53:53,625 INFO L226 Difference]: Without dead ends: 595 [2025-04-13 21:53:53,625 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2025-04-13 21:53:53,626 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:53,626 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 21:53:53,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-04-13 21:53:53,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 485. [2025-04-13 21:53:53,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 483 states have (on average 2.5527950310559007) internal successors, (1233), 484 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have 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:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1233 transitions. [2025-04-13 21:53:53,710 INFO L79 Accepts]: Start accepts. Automaton has 485 states and 1233 transitions. Word has length 19 [2025-04-13 21:53:53,710 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:53,711 INFO L485 AbstractCegarLoop]: Abstraction has 485 states and 1233 transitions. [2025-04-13 21:53:53,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:53,711 INFO L278 IsEmpty]: Start isEmpty. Operand 485 states and 1233 transitions. [2025-04-13 21:53:53,711 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:53:53,711 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:53,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:53,711 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-13 21:53:53,712 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:53:53,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:53,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1893095853, now seen corresponding path program 13 times [2025-04-13 21:53:53,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:53,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687548096] [2025-04-13 21:53:53,712 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:53:53,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:53,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:53:53,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:53:53,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:53:53,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:54,811 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:53:54,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:54,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687548096] [2025-04-13 21:53:54,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687548096] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:54,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:54,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:53:54,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838859716] [2025-04-13 21:53:54,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:54,812 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:53:54,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:54,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:53:54,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:53:54,812 INFO L87 Difference]: Start difference. First operand 485 states and 1233 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:56,021 INFO L93 Difference]: Finished difference Result 630 states and 1557 transitions. [2025-04-13 21:53:56,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:53:56,021 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:53:56,021 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:56,023 INFO L225 Difference]: With dead ends: 630 [2025-04-13 21:53:56,023 INFO L226 Difference]: Without dead ends: 585 [2025-04-13 21:53:56,023 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:53:56,023 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:56,023 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:53:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-04-13 21:53:56,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 479. [2025-04-13 21:53:56,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 477 states have (on average 2.540880503144654) internal successors, (1212), 478 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have 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:56,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1212 transitions. [2025-04-13 21:53:56,102 INFO L79 Accepts]: Start accepts. Automaton has 479 states and 1212 transitions. Word has length 19 [2025-04-13 21:53:56,102 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:56,102 INFO L485 AbstractCegarLoop]: Abstraction has 479 states and 1212 transitions. [2025-04-13 21:53:56,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:56,103 INFO L278 IsEmpty]: Start isEmpty. Operand 479 states and 1212 transitions. [2025-04-13 21:53:56,103 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:53:56,103 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:56,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:53:56,103 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-04-13 21:53:56,103 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:53:56,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:56,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2089403735, now seen corresponding path program 6 times [2025-04-13 21:53:56,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:56,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612454923] [2025-04-13 21:53:56,104 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:53:56,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:56,127 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:53:56,149 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:53:56,149 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:53:56,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:53:57,163 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:53:57,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:53:57,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612454923] [2025-04-13 21:53:57,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612454923] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:53:57,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:53:57,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:53:57,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337871552] [2025-04-13 21:53:57,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:53:57,163 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:53:57,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:53:57,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:53:57,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:53:57,164 INFO L87 Difference]: Start difference. First operand 479 states and 1212 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:58,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:53:58,285 INFO L93 Difference]: Finished difference Result 600 states and 1488 transitions. [2025-04-13 21:53:58,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:53:58,285 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:53:58,285 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:53:58,287 INFO L225 Difference]: With dead ends: 600 [2025-04-13 21:53:58,287 INFO L226 Difference]: Without dead ends: 551 [2025-04-13 21:53:58,287 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:53:58,288 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 81 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:53:58,288 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 9 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:53:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-04-13 21:53:58,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 491. [2025-04-13 21:53:58,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 489 states have (on average 2.556237218813906) internal successors, (1250), 490 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have 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,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 1250 transitions. [2025-04-13 21:53:58,384 INFO L79 Accepts]: Start accepts. Automaton has 491 states and 1250 transitions. Word has length 19 [2025-04-13 21:53:58,384 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:53:58,384 INFO L485 AbstractCegarLoop]: Abstraction has 491 states and 1250 transitions. [2025-04-13 21:53:58,384 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:53:58,384 INFO L278 IsEmpty]: Start isEmpty. Operand 491 states and 1250 transitions. [2025-04-13 21:53:58,385 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:53:58,385 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:53:58,385 INFO L218 NwaCegarLoop]: trace histogram [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,385 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-04-13 21:53:58,385 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:53:58,385 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:53:58,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2077785245, now seen corresponding path program 7 times [2025-04-13 21:53:58,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:53:58,385 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309293390] [2025-04-13 21:53:58,385 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:53:58,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:53:58,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:53:58,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:53:58,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:53:58,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:00,060 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:54:00,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:00,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309293390] [2025-04-13 21:54:00,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309293390] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:00,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:00,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:54:00,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874139756] [2025-04-13 21:54:00,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:00,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:54:00,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:00,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:54:00,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:54:00,061 INFO L87 Difference]: Start difference. First operand 491 states and 1250 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:01,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:01,629 INFO L93 Difference]: Finished difference Result 598 states and 1471 transitions. [2025-04-13 21:54:01,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:54:01,630 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:01,630 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:01,632 INFO L225 Difference]: With dead ends: 598 [2025-04-13 21:54:01,632 INFO L226 Difference]: Without dead ends: 549 [2025-04-13 21:54:01,632 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:54:01,632 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 99 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:01,632 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 0 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 21:54:01,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-04-13 21:54:01,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 483. [2025-04-13 21:54:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 481 states have (on average 2.544698544698545) internal successors, (1224), 482 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have 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:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 1224 transitions. [2025-04-13 21:54:01,718 INFO L79 Accepts]: Start accepts. Automaton has 483 states and 1224 transitions. Word has length 19 [2025-04-13 21:54:01,718 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:01,718 INFO L485 AbstractCegarLoop]: Abstraction has 483 states and 1224 transitions. [2025-04-13 21:54:01,718 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:01,718 INFO L278 IsEmpty]: Start isEmpty. Operand 483 states and 1224 transitions. [2025-04-13 21:54:01,719 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:01,719 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:01,719 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:01,719 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-04-13 21:54:01,720 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:01,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:01,720 INFO L85 PathProgramCache]: Analyzing trace with hash -156745763, now seen corresponding path program 8 times [2025-04-13 21:54:01,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:01,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836935304] [2025-04-13 21:54:01,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:54:01,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:01,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:54:01,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:01,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:54:01,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:03,213 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:54:03,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:03,213 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836935304] [2025-04-13 21:54:03,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836935304] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:03,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:03,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:54:03,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631250634] [2025-04-13 21:54:03,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:03,213 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:54:03,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:03,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:54:03,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:54:03,214 INFO L87 Difference]: Start difference. First operand 483 states and 1224 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:04,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:04,859 INFO L93 Difference]: Finished difference Result 578 states and 1409 transitions. [2025-04-13 21:54:04,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:54:04,860 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:04,860 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:04,862 INFO L225 Difference]: With dead ends: 578 [2025-04-13 21:54:04,862 INFO L226 Difference]: Without dead ends: 529 [2025-04-13 21:54:04,862 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:54:04,862 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:04,862 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:54:04,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-04-13 21:54:04,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 485. [2025-04-13 21:54:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 483 states have (on average 2.5445134575569357) internal successors, (1229), 484 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have 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,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1229 transitions. [2025-04-13 21:54:04,945 INFO L79 Accepts]: Start accepts. Automaton has 485 states and 1229 transitions. Word has length 19 [2025-04-13 21:54:04,945 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:04,945 INFO L485 AbstractCegarLoop]: Abstraction has 485 states and 1229 transitions. [2025-04-13 21:54:04,945 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:04,945 INFO L278 IsEmpty]: Start isEmpty. Operand 485 states and 1229 transitions. [2025-04-13 21:54:04,946 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:04,946 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:04,946 INFO L218 NwaCegarLoop]: trace histogram [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,946 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-04-13 21:54:04,946 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:04,947 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:04,947 INFO L85 PathProgramCache]: Analyzing trace with hash 355823319, now seen corresponding path program 14 times [2025-04-13 21:54:04,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:04,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728086630] [2025-04-13 21:54:04,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:54:04,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:04,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:54:04,987 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:04,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:54:04,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:06,365 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:54:06,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:06,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728086630] [2025-04-13 21:54:06,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728086630] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:06,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:06,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:54:06,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204122988] [2025-04-13 21:54:06,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:06,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:54:06,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:06,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:54:06,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:54:06,366 INFO L87 Difference]: Start difference. First operand 485 states and 1229 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:07,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:07,400 INFO L93 Difference]: Finished difference Result 581 states and 1423 transitions. [2025-04-13 21:54:07,400 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:54:07,400 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:07,400 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:07,402 INFO L225 Difference]: With dead ends: 581 [2025-04-13 21:54:07,402 INFO L226 Difference]: Without dead ends: 557 [2025-04-13 21:54:07,402 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:54:07,402 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:07,402 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:54:07,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-04-13 21:54:07,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 485. [2025-04-13 21:54:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 483 states have (on average 2.5445134575569357) internal successors, (1229), 484 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have 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:07,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1229 transitions. [2025-04-13 21:54:07,491 INFO L79 Accepts]: Start accepts. Automaton has 485 states and 1229 transitions. Word has length 19 [2025-04-13 21:54:07,491 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:07,491 INFO L485 AbstractCegarLoop]: Abstraction has 485 states and 1229 transitions. [2025-04-13 21:54:07,491 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:07,491 INFO L278 IsEmpty]: Start isEmpty. Operand 485 states and 1229 transitions. [2025-04-13 21:54:07,492 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:07,492 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:07,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:07,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-04-13 21:54:07,492 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:07,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:07,492 INFO L85 PathProgramCache]: Analyzing trace with hash -66296207, now seen corresponding path program 9 times [2025-04-13 21:54:07,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:07,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048999254] [2025-04-13 21:54:07,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:54:07,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:07,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:54:07,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:07,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:54:07,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:08,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:54:08,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:08,618 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048999254] [2025-04-13 21:54:08,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048999254] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:08,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:08,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:54:08,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566915740] [2025-04-13 21:54:08,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:08,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:54:08,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:08,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:54:08,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:54:08,619 INFO L87 Difference]: Start difference. First operand 485 states and 1229 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:09,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:09,668 INFO L93 Difference]: Finished difference Result 634 states and 1599 transitions. [2025-04-13 21:54:09,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:54:09,669 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:09,669 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:09,671 INFO L225 Difference]: With dead ends: 634 [2025-04-13 21:54:09,671 INFO L226 Difference]: Without dead ends: 585 [2025-04-13 21:54:09,671 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:54:09,671 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 99 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:09,671 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 0 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:54:09,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-04-13 21:54:09,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 501. [2025-04-13 21:54:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 499 states have (on average 2.559118236472946) internal successors, (1277), 500 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have 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:09,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1277 transitions. [2025-04-13 21:54:09,771 INFO L79 Accepts]: Start accepts. Automaton has 501 states and 1277 transitions. Word has length 19 [2025-04-13 21:54:09,771 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:09,772 INFO L485 AbstractCegarLoop]: Abstraction has 501 states and 1277 transitions. [2025-04-13 21:54:09,772 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:09,772 INFO L278 IsEmpty]: Start isEmpty. Operand 501 states and 1277 transitions. [2025-04-13 21:54:09,772 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:09,772 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:09,772 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:09,772 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-04-13 21:54:09,773 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:09,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:09,773 INFO L85 PathProgramCache]: Analyzing trace with hash -48853545, now seen corresponding path program 16 times [2025-04-13 21:54:09,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:09,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487066682] [2025-04-13 21:54:09,773 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:54:09,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:09,795 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:54:09,822 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:09,822 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:54:09,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:11,127 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:54:11,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:11,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487066682] [2025-04-13 21:54:11,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487066682] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:11,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:11,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:54:11,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97515944] [2025-04-13 21:54:11,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:11,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:54:11,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:11,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:54:11,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:54:11,128 INFO L87 Difference]: Start difference. First operand 501 states and 1277 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:12,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:12,289 INFO L93 Difference]: Finished difference Result 665 states and 1671 transitions. [2025-04-13 21:54:12,289 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:54:12,289 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:12,289 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:12,291 INFO L225 Difference]: With dead ends: 665 [2025-04-13 21:54:12,291 INFO L226 Difference]: Without dead ends: 645 [2025-04-13 21:54:12,291 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:54:12,292 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:12,292 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:54:12,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-04-13 21:54:12,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 469. [2025-04-13 21:54:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 467 states have (on average 2.5289079229122056) internal successors, (1181), 468 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have 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:12,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1181 transitions. [2025-04-13 21:54:12,373 INFO L79 Accepts]: Start accepts. Automaton has 469 states and 1181 transitions. Word has length 19 [2025-04-13 21:54:12,373 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:12,373 INFO L485 AbstractCegarLoop]: Abstraction has 469 states and 1181 transitions. [2025-04-13 21:54:12,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:12,373 INFO L278 IsEmpty]: Start isEmpty. Operand 469 states and 1181 transitions. [2025-04-13 21:54:12,374 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:12,374 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:12,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:12,374 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-04-13 21:54:12,375 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:12,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:12,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1488314617, now seen corresponding path program 10 times [2025-04-13 21:54:12,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:12,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985529594] [2025-04-13 21:54:12,375 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:54:12,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:12,403 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:54:12,425 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:12,425 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:54:12,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:54:13,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:13,618 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985529594] [2025-04-13 21:54:13,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985529594] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:13,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:13,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:54:13,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694923707] [2025-04-13 21:54:13,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:13,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:54:13,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:13,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:54:13,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:54:13,619 INFO L87 Difference]: Start difference. First operand 469 states and 1181 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:14,691 INFO L93 Difference]: Finished difference Result 612 states and 1478 transitions. [2025-04-13 21:54:14,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:54:14,691 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:14,691 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:14,693 INFO L225 Difference]: With dead ends: 612 [2025-04-13 21:54:14,693 INFO L226 Difference]: Without dead ends: 563 [2025-04-13 21:54:14,694 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:54:14,694 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:14,694 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:54:14,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-04-13 21:54:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 471. [2025-04-13 21:54:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 469 states have (on average 2.5287846481876333) internal successors, (1186), 470 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have 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:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1186 transitions. [2025-04-13 21:54:14,775 INFO L79 Accepts]: Start accepts. Automaton has 471 states and 1186 transitions. Word has length 19 [2025-04-13 21:54:14,775 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:14,775 INFO L485 AbstractCegarLoop]: Abstraction has 471 states and 1186 transitions. [2025-04-13 21:54:14,775 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:14,775 INFO L278 IsEmpty]: Start isEmpty. Operand 471 states and 1186 transitions. [2025-04-13 21:54:14,776 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:14,776 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:14,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:14,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-04-13 21:54:14,776 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:14,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:14,778 INFO L85 PathProgramCache]: Analyzing trace with hash 344041815, now seen corresponding path program 9 times [2025-04-13 21:54:14,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:14,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643293176] [2025-04-13 21:54:14,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:54:14,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:14,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:54:14,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:14,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:54:14,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:16,481 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:54:16,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:16,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643293176] [2025-04-13 21:54:16,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643293176] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:16,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:16,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:54:16,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584173407] [2025-04-13 21:54:16,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:16,482 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:54:16,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:16,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:54:16,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:54:16,482 INFO L87 Difference]: Start difference. First operand 471 states and 1186 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:17,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:17,501 INFO L93 Difference]: Finished difference Result 730 states and 1741 transitions. [2025-04-13 21:54:17,501 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:54:17,501 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:17,501 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:17,503 INFO L225 Difference]: With dead ends: 730 [2025-04-13 21:54:17,503 INFO L226 Difference]: Without dead ends: 681 [2025-04-13 21:54:17,503 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:54:17,504 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:17,504 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:54:17,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-04-13 21:54:17,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 469. [2025-04-13 21:54:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 467 states have (on average 2.5289079229122056) internal successors, (1181), 468 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have 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,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1181 transitions. [2025-04-13 21:54:17,580 INFO L79 Accepts]: Start accepts. Automaton has 469 states and 1181 transitions. Word has length 19 [2025-04-13 21:54:17,580 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:17,581 INFO L485 AbstractCegarLoop]: Abstraction has 469 states and 1181 transitions. [2025-04-13 21:54:17,581 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:17,581 INFO L278 IsEmpty]: Start isEmpty. Operand 469 states and 1181 transitions. [2025-04-13 21:54:17,581 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:17,581 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:17,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:17,581 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-04-13 21:54:17,581 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:17,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:17,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1891386847, now seen corresponding path program 11 times [2025-04-13 21:54:17,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:17,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988262662] [2025-04-13 21:54:17,582 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:54:17,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:17,604 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:54:17,622 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:17,622 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:54:17,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:18,945 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:54:18,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:18,946 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988262662] [2025-04-13 21:54:18,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988262662] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:18,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:18,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 21:54:18,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056929809] [2025-04-13 21:54:18,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:18,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:54:18,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:18,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:54:18,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:54:18,946 INFO L87 Difference]: Start difference. First operand 469 states and 1181 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:20,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:20,786 INFO L93 Difference]: Finished difference Result 700 states and 1704 transitions. [2025-04-13 21:54:20,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 21:54:20,786 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:20,786 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:20,788 INFO L225 Difference]: With dead ends: 700 [2025-04-13 21:54:20,788 INFO L226 Difference]: Without dead ends: 649 [2025-04-13 21:54:20,789 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2025-04-13 21:54:20,789 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 132 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:20,789 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 0 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 21:54:20,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-04-13 21:54:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 461. [2025-04-13 21:54:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 459 states have (on average 2.5119825708061003) internal successors, (1153), 460 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have 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:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1153 transitions. [2025-04-13 21:54:20,876 INFO L79 Accepts]: Start accepts. Automaton has 461 states and 1153 transitions. Word has length 19 [2025-04-13 21:54:20,876 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:20,876 INFO L485 AbstractCegarLoop]: Abstraction has 461 states and 1153 transitions. [2025-04-13 21:54:20,876 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:20,876 INFO L278 IsEmpty]: Start isEmpty. Operand 461 states and 1153 transitions. [2025-04-13 21:54:20,876 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:20,877 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:20,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:20,877 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-04-13 21:54:20,877 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:20,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:20,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2114569185, now seen corresponding path program 17 times [2025-04-13 21:54:20,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:20,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841237734] [2025-04-13 21:54:20,877 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:54:20,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:20,901 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:54:20,927 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:20,928 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:54:20,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:22,320 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:54:22,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:22,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841237734] [2025-04-13 21:54:22,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841237734] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:22,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:22,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:54:22,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764005099] [2025-04-13 21:54:22,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:22,321 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:54:22,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:22,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:54:22,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:54:22,322 INFO L87 Difference]: Start difference. First operand 461 states and 1153 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:23,493 INFO L93 Difference]: Finished difference Result 646 states and 1557 transitions. [2025-04-13 21:54:23,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:54:23,494 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:23,494 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:23,496 INFO L225 Difference]: With dead ends: 646 [2025-04-13 21:54:23,496 INFO L226 Difference]: Without dead ends: 597 [2025-04-13 21:54:23,496 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:54:23,497 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:23,497 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:54:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-04-13 21:54:23,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 487. [2025-04-13 21:54:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 485 states have (on average 2.54020618556701) internal successors, (1232), 486 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have 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,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1232 transitions. [2025-04-13 21:54:23,600 INFO L79 Accepts]: Start accepts. Automaton has 487 states and 1232 transitions. Word has length 19 [2025-04-13 21:54:23,601 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:23,601 INFO L485 AbstractCegarLoop]: Abstraction has 487 states and 1232 transitions. [2025-04-13 21:54:23,601 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:23,601 INFO L278 IsEmpty]: Start isEmpty. Operand 487 states and 1232 transitions. [2025-04-13 21:54:23,601 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:23,601 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:23,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:23,601 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-04-13 21:54:23,601 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:23,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:23,602 INFO L85 PathProgramCache]: Analyzing trace with hash 799205767, now seen corresponding path program 18 times [2025-04-13 21:54:23,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:23,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128981260] [2025-04-13 21:54:23,602 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:54:23,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:23,624 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:54:23,641 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:23,641 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:54:23,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:24,957 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:54:24,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:24,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128981260] [2025-04-13 21:54:24,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128981260] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:24,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:24,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:54:24,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088525828] [2025-04-13 21:54:24,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:24,958 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:54:24,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:24,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:54:24,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:54:24,958 INFO L87 Difference]: Start difference. First operand 487 states and 1232 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:26,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:26,481 INFO L93 Difference]: Finished difference Result 683 states and 1653 transitions. [2025-04-13 21:54:26,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 21:54:26,481 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:26,481 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:26,483 INFO L225 Difference]: With dead ends: 683 [2025-04-13 21:54:26,483 INFO L226 Difference]: Without dead ends: 634 [2025-04-13 21:54:26,484 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:54:26,484 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:26,484 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 21:54:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-04-13 21:54:26,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 457. [2025-04-13 21:54:26,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 455 states have (on average 2.498901098901099) internal successors, (1137), 456 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have 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:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1137 transitions. [2025-04-13 21:54:26,563 INFO L79 Accepts]: Start accepts. Automaton has 457 states and 1137 transitions. Word has length 19 [2025-04-13 21:54:26,563 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:26,563 INFO L485 AbstractCegarLoop]: Abstraction has 457 states and 1137 transitions. [2025-04-13 21:54:26,563 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:26,563 INFO L278 IsEmpty]: Start isEmpty. Operand 457 states and 1137 transitions. [2025-04-13 21:54:26,564 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:26,564 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:26,564 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:26,564 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-04-13 21:54:26,564 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:26,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:26,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1757809189, now seen corresponding path program 19 times [2025-04-13 21:54:26,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:26,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93078887] [2025-04-13 21:54:26,565 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:54:26,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:26,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:54:26,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:26,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:54:26,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:27,850 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:54:27,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:27,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93078887] [2025-04-13 21:54:27,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93078887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:27,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:27,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:54:27,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827906712] [2025-04-13 21:54:27,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:27,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:54:27,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:27,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:54:27,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:54:27,851 INFO L87 Difference]: Start difference. First operand 457 states and 1137 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:29,258 INFO L93 Difference]: Finished difference Result 661 states and 1579 transitions. [2025-04-13 21:54:29,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 21:54:29,258 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:29,259 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:29,260 INFO L225 Difference]: With dead ends: 661 [2025-04-13 21:54:29,260 INFO L226 Difference]: Without dead ends: 641 [2025-04-13 21:54:29,261 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:54:29,261 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 169 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:29,261 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 0 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:54:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2025-04-13 21:54:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 449. [2025-04-13 21:54:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 447 states have (on average 2.498881431767338) internal successors, (1117), 448 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have 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:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1117 transitions. [2025-04-13 21:54:29,341 INFO L79 Accepts]: Start accepts. Automaton has 449 states and 1117 transitions. Word has length 19 [2025-04-13 21:54:29,341 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:29,341 INFO L485 AbstractCegarLoop]: Abstraction has 449 states and 1117 transitions. [2025-04-13 21:54:29,341 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:29,341 INFO L278 IsEmpty]: Start isEmpty. Operand 449 states and 1117 transitions. [2025-04-13 21:54:29,341 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:29,342 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:29,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:29,342 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-04-13 21:54:29,342 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:29,342 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:29,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2077148269, now seen corresponding path program 10 times [2025-04-13 21:54:29,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:29,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724595584] [2025-04-13 21:54:29,342 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:54:29,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:29,365 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:54:29,385 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:29,385 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:54:29,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:30,231 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:54:30,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:30,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724595584] [2025-04-13 21:54:30,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724595584] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:30,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:30,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 21:54:30,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752325420] [2025-04-13 21:54:30,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:30,232 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:54:30,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:30,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:54:30,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:54:30,232 INFO L87 Difference]: Start difference. First operand 449 states and 1117 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:31,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:31,258 INFO L93 Difference]: Finished difference Result 636 states and 1568 transitions. [2025-04-13 21:54:31,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:54:31,258 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:31,259 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:31,260 INFO L225 Difference]: With dead ends: 636 [2025-04-13 21:54:31,260 INFO L226 Difference]: Without dead ends: 587 [2025-04-13 21:54:31,261 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:54:31,261 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:31,261 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 21:54:31,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-04-13 21:54:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 455. [2025-04-13 21:54:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 453 states have (on average 2.512141280353201) internal successors, (1138), 454 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have 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:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1138 transitions. [2025-04-13 21:54:31,353 INFO L79 Accepts]: Start accepts. Automaton has 455 states and 1138 transitions. Word has length 19 [2025-04-13 21:54:31,353 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:31,353 INFO L485 AbstractCegarLoop]: Abstraction has 455 states and 1138 transitions. [2025-04-13 21:54:31,353 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:31,353 INFO L278 IsEmpty]: Start isEmpty. Operand 455 states and 1138 transitions. [2025-04-13 21:54:31,354 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:31,354 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:31,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:31,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-04-13 21:54:31,354 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:31,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:31,354 INFO L85 PathProgramCache]: Analyzing trace with hash 235366803, now seen corresponding path program 11 times [2025-04-13 21:54:31,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:31,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006617821] [2025-04-13 21:54:31,355 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:54:31,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:31,377 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:54:31,404 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:31,404 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:54:31,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:33,071 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:54:33,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:33,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006617821] [2025-04-13 21:54:33,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006617821] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:33,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:33,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:54:33,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949923413] [2025-04-13 21:54:33,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:33,071 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:54:33,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:33,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:54:33,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:54:33,072 INFO L87 Difference]: Start difference. First operand 455 states and 1138 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:34,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:34,489 INFO L93 Difference]: Finished difference Result 642 states and 1557 transitions. [2025-04-13 21:54:34,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:54:34,489 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:34,489 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:34,490 INFO L225 Difference]: With dead ends: 642 [2025-04-13 21:54:34,490 INFO L226 Difference]: Without dead ends: 593 [2025-04-13 21:54:34,491 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:54:34,491 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:34,491 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:54:34,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-04-13 21:54:34,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 439. [2025-04-13 21:54:34,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 437 states have (on average 2.480549199084668) internal successors, (1084), 438 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have 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:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1084 transitions. [2025-04-13 21:54:34,573 INFO L79 Accepts]: Start accepts. Automaton has 439 states and 1084 transitions. Word has length 19 [2025-04-13 21:54:34,573 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:34,573 INFO L485 AbstractCegarLoop]: Abstraction has 439 states and 1084 transitions. [2025-04-13 21:54:34,573 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:34,573 INFO L278 IsEmpty]: Start isEmpty. Operand 439 states and 1084 transitions. [2025-04-13 21:54:34,573 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:34,573 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:34,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:34,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-04-13 21:54:34,574 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:34,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:34,574 INFO L85 PathProgramCache]: Analyzing trace with hash 942170669, now seen corresponding path program 15 times [2025-04-13 21:54:34,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:34,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512754389] [2025-04-13 21:54:34,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:54:34,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:34,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:54:34,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:34,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:54:34,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:35,421 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:54:35,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:35,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512754389] [2025-04-13 21:54:35,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512754389] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:35,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:35,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:54:35,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202292090] [2025-04-13 21:54:35,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:35,421 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:54:35,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:35,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:54:35,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:54:35,422 INFO L87 Difference]: Start difference. First operand 439 states and 1084 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:36,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:36,415 INFO L93 Difference]: Finished difference Result 586 states and 1393 transitions. [2025-04-13 21:54:36,415 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:54:36,415 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:36,415 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:36,417 INFO L225 Difference]: With dead ends: 586 [2025-04-13 21:54:36,417 INFO L226 Difference]: Without dead ends: 562 [2025-04-13 21:54:36,417 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:54:36,418 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:36,418 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:54:36,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-04-13 21:54:36,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 425. [2025-04-13 21:54:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 423 states have (on average 2.4893617021276597) internal successors, (1053), 424 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have 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:36,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1053 transitions. [2025-04-13 21:54:36,501 INFO L79 Accepts]: Start accepts. Automaton has 425 states and 1053 transitions. Word has length 19 [2025-04-13 21:54:36,501 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:36,501 INFO L485 AbstractCegarLoop]: Abstraction has 425 states and 1053 transitions. [2025-04-13 21:54:36,501 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:36,501 INFO L278 IsEmpty]: Start isEmpty. Operand 425 states and 1053 transitions. [2025-04-13 21:54:36,502 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:36,502 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:36,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:36,502 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-04-13 21:54:36,502 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:36,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:36,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1348581155, now seen corresponding path program 20 times [2025-04-13 21:54:36,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:36,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121536672] [2025-04-13 21:54:36,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:54:36,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:36,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:54:36,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:36,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:54:36,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:38,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:54:38,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:38,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121536672] [2025-04-13 21:54:38,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121536672] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:38,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:38,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:54:38,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817243470] [2025-04-13 21:54:38,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:38,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:54:38,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:38,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:54:38,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:54:38,115 INFO L87 Difference]: Start difference. First operand 425 states and 1053 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:39,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:39,281 INFO L93 Difference]: Finished difference Result 548 states and 1302 transitions. [2025-04-13 21:54:39,281 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:54:39,281 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:39,281 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:39,283 INFO L225 Difference]: With dead ends: 548 [2025-04-13 21:54:39,283 INFO L226 Difference]: Without dead ends: 499 [2025-04-13 21:54:39,283 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:54:39,283 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:39,284 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:54:39,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-04-13 21:54:39,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 427. [2025-04-13 21:54:39,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 425 states have (on average 2.489411764705882) internal successors, (1058), 426 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have 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,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1058 transitions. [2025-04-13 21:54:39,368 INFO L79 Accepts]: Start accepts. Automaton has 427 states and 1058 transitions. Word has length 19 [2025-04-13 21:54:39,368 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:39,368 INFO L485 AbstractCegarLoop]: Abstraction has 427 states and 1058 transitions. [2025-04-13 21:54:39,369 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:39,369 INFO L278 IsEmpty]: Start isEmpty. Operand 427 states and 1058 transitions. [2025-04-13 21:54:39,369 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:39,369 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:39,369 INFO L218 NwaCegarLoop]: trace histogram [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,369 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-04-13 21:54:39,369 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:39,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:39,370 INFO L85 PathProgramCache]: Analyzing trace with hash 945047133, now seen corresponding path program 12 times [2025-04-13 21:54:39,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:39,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33613802] [2025-04-13 21:54:39,370 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:54:39,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:39,393 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:54:39,413 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:39,413 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:54:39,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:40,876 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:54:40,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:40,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33613802] [2025-04-13 21:54:40,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33613802] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:40,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:40,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:54:40,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613151884] [2025-04-13 21:54:40,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:40,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:54:40,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:40,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:54:40,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:54:40,877 INFO L87 Difference]: Start difference. First operand 427 states and 1058 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:42,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:42,037 INFO L93 Difference]: Finished difference Result 508 states and 1218 transitions. [2025-04-13 21:54:42,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:54:42,038 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:42,038 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:42,039 INFO L225 Difference]: With dead ends: 508 [2025-04-13 21:54:42,039 INFO L226 Difference]: Without dead ends: 481 [2025-04-13 21:54:42,040 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:54:42,040 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:42,040 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:54:42,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-04-13 21:54:42,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 421. [2025-04-13 21:54:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 419 states have (on average 2.4988066825775657) internal successors, (1047), 420 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have 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:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1047 transitions. [2025-04-13 21:54:42,124 INFO L79 Accepts]: Start accepts. Automaton has 421 states and 1047 transitions. Word has length 19 [2025-04-13 21:54:42,124 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:42,124 INFO L485 AbstractCegarLoop]: Abstraction has 421 states and 1047 transitions. [2025-04-13 21:54:42,124 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:42,124 INFO L278 IsEmpty]: Start isEmpty. Operand 421 states and 1047 transitions. [2025-04-13 21:54:42,124 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:42,124 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:42,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:42,125 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-04-13 21:54:42,125 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:42,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:42,125 INFO L85 PathProgramCache]: Analyzing trace with hash -851968617, now seen corresponding path program 16 times [2025-04-13 21:54:42,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:42,125 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79487580] [2025-04-13 21:54:42,125 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:54:42,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:42,149 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:54:42,169 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:42,170 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:54:42,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:42,930 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:54:42,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:42,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79487580] [2025-04-13 21:54:42,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79487580] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:42,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:42,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:54:42,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504729268] [2025-04-13 21:54:42,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:42,931 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:54:42,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:42,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:54:42,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:54:42,931 INFO L87 Difference]: Start difference. First operand 421 states and 1047 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:43,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:43,923 INFO L93 Difference]: Finished difference Result 568 states and 1394 transitions. [2025-04-13 21:54:43,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:54:43,923 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:43,924 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:43,925 INFO L225 Difference]: With dead ends: 568 [2025-04-13 21:54:43,925 INFO L226 Difference]: Without dead ends: 519 [2025-04-13 21:54:43,925 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:54:43,925 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:43,926 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 21:54:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-04-13 21:54:44,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 431. [2025-04-13 21:54:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 429 states have (on average 2.5174825174825175) internal successors, (1080), 430 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have 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:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1080 transitions. [2025-04-13 21:54:44,018 INFO L79 Accepts]: Start accepts. Automaton has 431 states and 1080 transitions. Word has length 19 [2025-04-13 21:54:44,019 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:44,019 INFO L485 AbstractCegarLoop]: Abstraction has 431 states and 1080 transitions. [2025-04-13 21:54:44,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:44,019 INFO L278 IsEmpty]: Start isEmpty. Operand 431 states and 1080 transitions. [2025-04-13 21:54:44,020 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:44,020 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:44,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:44,020 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-04-13 21:54:44,020 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:44,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:44,020 INFO L85 PathProgramCache]: Analyzing trace with hash -864048899, now seen corresponding path program 12 times [2025-04-13 21:54:44,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:44,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131639585] [2025-04-13 21:54:44,020 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:54:44,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:44,043 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:54:44,074 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:44,074 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:54:44,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:44,990 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:54:44,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:44,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131639585] [2025-04-13 21:54:44,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131639585] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:44,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:44,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:54:44,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102279747] [2025-04-13 21:54:44,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:44,990 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:54:44,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:44,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:54:44,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:54:44,991 INFO L87 Difference]: Start difference. First operand 431 states and 1080 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:45,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:45,979 INFO L93 Difference]: Finished difference Result 550 states and 1325 transitions. [2025-04-13 21:54:45,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:54:45,980 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:45,980 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:45,982 INFO L225 Difference]: With dead ends: 550 [2025-04-13 21:54:45,982 INFO L226 Difference]: Without dead ends: 501 [2025-04-13 21:54:45,982 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:54:45,982 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:45,982 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:54:45,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-04-13 21:54:46,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 413. [2025-04-13 21:54:46,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 411 states have (on average 2.489051094890511) internal successors, (1023), 412 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have 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:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1023 transitions. [2025-04-13 21:54:46,064 INFO L79 Accepts]: Start accepts. Automaton has 413 states and 1023 transitions. Word has length 19 [2025-04-13 21:54:46,064 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:46,064 INFO L485 AbstractCegarLoop]: Abstraction has 413 states and 1023 transitions. [2025-04-13 21:54:46,064 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:46,064 INFO L278 IsEmpty]: Start isEmpty. Operand 413 states and 1023 transitions. [2025-04-13 21:54:46,065 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:46,065 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:46,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:46,065 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-04-13 21:54:46,065 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:46,065 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:46,065 INFO L85 PathProgramCache]: Analyzing trace with hash 264159477, now seen corresponding path program 21 times [2025-04-13 21:54:46,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:46,065 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512270785] [2025-04-13 21:54:46,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:54:46,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:46,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:54:46,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:46,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:54:46,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:47,600 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:54:47,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:47,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512270785] [2025-04-13 21:54:47,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512270785] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:47,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:47,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:54:47,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78676847] [2025-04-13 21:54:47,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:47,601 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:54:47,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:47,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:54:47,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:54:47,602 INFO L87 Difference]: Start difference. First operand 413 states and 1023 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:48,582 INFO L93 Difference]: Finished difference Result 589 states and 1418 transitions. [2025-04-13 21:54:48,582 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 21:54:48,582 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:48,582 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:48,584 INFO L225 Difference]: With dead ends: 589 [2025-04-13 21:54:48,584 INFO L226 Difference]: Without dead ends: 540 [2025-04-13 21:54:48,584 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:54:48,584 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:48,584 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:54:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-04-13 21:54:48,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 425. [2025-04-13 21:54:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 423 states have (on average 2.508274231678487) internal successors, (1061), 424 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have 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,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1061 transitions. [2025-04-13 21:54:48,665 INFO L79 Accepts]: Start accepts. Automaton has 425 states and 1061 transitions. Word has length 19 [2025-04-13 21:54:48,665 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:48,665 INFO L485 AbstractCegarLoop]: Abstraction has 425 states and 1061 transitions. [2025-04-13 21:54:48,665 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:48,665 INFO L278 IsEmpty]: Start isEmpty. Operand 425 states and 1061 transitions. [2025-04-13 21:54:48,666 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:48,666 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:48,666 INFO L218 NwaCegarLoop]: trace histogram [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,666 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-04-13 21:54:48,666 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:48,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:48,666 INFO L85 PathProgramCache]: Analyzing trace with hash -226332347, now seen corresponding path program 13 times [2025-04-13 21:54:48,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:48,666 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615141780] [2025-04-13 21:54:48,666 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:54:48,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:48,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:54:48,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:48,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:54:48,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:50,199 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:54:50,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:50,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615141780] [2025-04-13 21:54:50,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615141780] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:50,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:50,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:54:50,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974782157] [2025-04-13 21:54:50,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:50,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:54:50,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:50,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:54:50,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:54:50,200 INFO L87 Difference]: Start difference. First operand 425 states and 1061 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:52,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:52,027 INFO L93 Difference]: Finished difference Result 607 states and 1483 transitions. [2025-04-13 21:54:52,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 21:54:52,028 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:52,028 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:52,029 INFO L225 Difference]: With dead ends: 607 [2025-04-13 21:54:52,029 INFO L226 Difference]: Without dead ends: 558 [2025-04-13 21:54:52,030 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2025-04-13 21:54:52,030 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 140 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:52,030 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 0 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 21:54:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-04-13 21:54:52,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 433. [2025-04-13 21:54:52,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 431 states have (on average 2.503480278422274) internal successors, (1079), 432 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have 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:52,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1079 transitions. [2025-04-13 21:54:52,112 INFO L79 Accepts]: Start accepts. Automaton has 433 states and 1079 transitions. Word has length 19 [2025-04-13 21:54:52,112 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:52,112 INFO L485 AbstractCegarLoop]: Abstraction has 433 states and 1079 transitions. [2025-04-13 21:54:52,112 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:52,112 INFO L278 IsEmpty]: Start isEmpty. Operand 433 states and 1079 transitions. [2025-04-13 21:54:52,112 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:52,112 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:52,112 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:52,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-04-13 21:54:52,113 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:52,113 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:52,113 INFO L85 PathProgramCache]: Analyzing trace with hash -139374545, now seen corresponding path program 13 times [2025-04-13 21:54:52,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:52,113 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817259623] [2025-04-13 21:54:52,113 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:54:52,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:52,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:54:52,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:52,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:54:52,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:53,651 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:54:53,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:53,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817259623] [2025-04-13 21:54:53,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817259623] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:53,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:53,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:54:53,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593175643] [2025-04-13 21:54:53,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:53,651 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:54:53,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:53,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:54:53,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:54:53,652 INFO L87 Difference]: Start difference. First operand 433 states and 1079 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:54,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:54,971 INFO L93 Difference]: Finished difference Result 639 states and 1525 transitions. [2025-04-13 21:54:54,972 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:54:54,972 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:54,972 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:54,973 INFO L225 Difference]: With dead ends: 639 [2025-04-13 21:54:54,973 INFO L226 Difference]: Without dead ends: 614 [2025-04-13 21:54:54,974 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2025-04-13 21:54:54,974 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:54,974 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:54:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-04-13 21:54:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 443. [2025-04-13 21:54:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 441 states have (on average 2.512471655328798) internal successors, (1108), 442 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have 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,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1108 transitions. [2025-04-13 21:54:55,058 INFO L79 Accepts]: Start accepts. Automaton has 443 states and 1108 transitions. Word has length 19 [2025-04-13 21:54:55,058 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:55,058 INFO L485 AbstractCegarLoop]: Abstraction has 443 states and 1108 transitions. [2025-04-13 21:54:55,058 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:55,058 INFO L278 IsEmpty]: Start isEmpty. Operand 443 states and 1108 transitions. [2025-04-13 21:54:55,059 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:55,059 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:55,059 INFO L218 NwaCegarLoop]: trace histogram [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,059 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-04-13 21:54:55,059 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:55,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:55,059 INFO L85 PathProgramCache]: Analyzing trace with hash 286236735, now seen corresponding path program 17 times [2025-04-13 21:54:55,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:55,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785804879] [2025-04-13 21:54:55,059 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:54:55,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:55,082 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:54:55,099 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:55,099 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:54:55,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:55,925 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:54:55,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:55,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785804879] [2025-04-13 21:54:55,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785804879] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:55,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:55,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 21:54:55,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727241658] [2025-04-13 21:54:55,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:55,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 21:54:55,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:55,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 21:54:55,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 21:54:55,926 INFO L87 Difference]: Start difference. First operand 443 states and 1108 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:57,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:57,057 INFO L93 Difference]: Finished difference Result 611 states and 1491 transitions. [2025-04-13 21:54:57,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 21:54:57,058 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:57,058 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:57,059 INFO L225 Difference]: With dead ends: 611 [2025-04-13 21:54:57,059 INFO L226 Difference]: Without dead ends: 585 [2025-04-13 21:54:57,060 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:54:57,060 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 97 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:57,060 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 7 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 21:54:57,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-04-13 21:54:57,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 439. [2025-04-13 21:54:57,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 437 states have (on average 2.5125858123569795) internal successors, (1098), 438 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have 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:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1098 transitions. [2025-04-13 21:54:57,145 INFO L79 Accepts]: Start accepts. Automaton has 439 states and 1098 transitions. Word has length 19 [2025-04-13 21:54:57,145 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:57,145 INFO L485 AbstractCegarLoop]: Abstraction has 439 states and 1098 transitions. [2025-04-13 21:54:57,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:57,145 INFO L278 IsEmpty]: Start isEmpty. Operand 439 states and 1098 transitions. [2025-04-13 21:54:57,145 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:57,145 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:57,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:57,145 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-04-13 21:54:57,146 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:57,146 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:57,146 INFO L85 PathProgramCache]: Analyzing trace with hash 775790111, now seen corresponding path program 18 times [2025-04-13 21:54:57,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:57,146 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323900009] [2025-04-13 21:54:57,146 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:54:57,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:57,169 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:54:57,191 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:57,192 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:54:57,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:54:58,609 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:54:58,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:54:58,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323900009] [2025-04-13 21:54:58,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323900009] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:54:58,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:54:58,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:54:58,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343532152] [2025-04-13 21:54:58,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:54:58,609 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:54:58,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:54:58,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:54:58,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:54:58,610 INFO L87 Difference]: Start difference. First operand 439 states and 1098 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:59,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:54:59,635 INFO L93 Difference]: Finished difference Result 550 states and 1339 transitions. [2025-04-13 21:54:59,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:54:59,635 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:54:59,635 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:54:59,637 INFO L225 Difference]: With dead ends: 550 [2025-04-13 21:54:59,637 INFO L226 Difference]: Without dead ends: 501 [2025-04-13 21:54:59,637 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:54:59,637 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:54:59,637 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:54:59,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-04-13 21:54:59,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 447. [2025-04-13 21:54:59,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 445 states have (on average 2.5213483146067417) internal successors, (1122), 446 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have 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:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1122 transitions. [2025-04-13 21:54:59,736 INFO L79 Accepts]: Start accepts. Automaton has 447 states and 1122 transitions. Word has length 19 [2025-04-13 21:54:59,736 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:54:59,736 INFO L485 AbstractCegarLoop]: Abstraction has 447 states and 1122 transitions. [2025-04-13 21:54:59,736 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:54:59,736 INFO L278 IsEmpty]: Start isEmpty. Operand 447 states and 1122 transitions. [2025-04-13 21:54:59,736 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:54:59,736 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:54:59,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:54:59,736 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-04-13 21:54:59,736 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:54:59,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:54:59,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1201431119, now seen corresponding path program 14 times [2025-04-13 21:54:59,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:54:59,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126145944] [2025-04-13 21:54:59,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:54:59,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:54:59,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:54:59,788 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:54:59,788 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:54:59,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:01,667 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:55:01,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:01,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126145944] [2025-04-13 21:55:01,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126145944] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:01,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:01,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:55:01,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202655317] [2025-04-13 21:55:01,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:01,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:55:01,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:01,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:55:01,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:55:01,668 INFO L87 Difference]: Start difference. First operand 447 states and 1122 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:03,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:03,150 INFO L93 Difference]: Finished difference Result 703 states and 1659 transitions. [2025-04-13 21:55:03,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:55:03,151 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:55:03,151 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:03,152 INFO L225 Difference]: With dead ends: 703 [2025-04-13 21:55:03,152 INFO L226 Difference]: Without dead ends: 654 [2025-04-13 21:55:03,153 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:55:03,153 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:03,153 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 21:55:03,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-04-13 21:55:03,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 459. [2025-04-13 21:55:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 457 states have (on average 2.533916849015317) internal successors, (1158), 458 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have 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,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 1158 transitions. [2025-04-13 21:55:03,251 INFO L79 Accepts]: Start accepts. Automaton has 459 states and 1158 transitions. Word has length 19 [2025-04-13 21:55:03,251 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:03,251 INFO L485 AbstractCegarLoop]: Abstraction has 459 states and 1158 transitions. [2025-04-13 21:55:03,251 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:03,251 INFO L278 IsEmpty]: Start isEmpty. Operand 459 states and 1158 transitions. [2025-04-13 21:55:03,251 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:55:03,251 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:03,251 INFO L218 NwaCegarLoop]: trace histogram [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,252 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-04-13 21:55:03,252 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:55:03,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:03,252 INFO L85 PathProgramCache]: Analyzing trace with hash 763709829, now seen corresponding path program 14 times [2025-04-13 21:55:03,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:03,252 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014632590] [2025-04-13 21:55:03,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:55:03,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:03,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:55:03,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:55:03,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:55:03,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:04,782 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:55:04,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:04,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014632590] [2025-04-13 21:55:04,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014632590] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:04,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:04,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:55:04,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623148734] [2025-04-13 21:55:04,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:04,783 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:55:04,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:04,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:55:04,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:55:04,783 INFO L87 Difference]: Start difference. First operand 459 states and 1158 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:05,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:05,905 INFO L93 Difference]: Finished difference Result 558 states and 1363 transitions. [2025-04-13 21:55:05,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:55:05,905 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:55:05,905 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:05,907 INFO L225 Difference]: With dead ends: 558 [2025-04-13 21:55:05,907 INFO L226 Difference]: Without dead ends: 535 [2025-04-13 21:55:05,907 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:55:05,908 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 104 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:05,908 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 0 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:55:05,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-04-13 21:55:06,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 455. [2025-04-13 21:55:06,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 453 states have (on average 2.5298013245033113) internal successors, (1146), 454 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have 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:06,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1146 transitions. [2025-04-13 21:55:06,015 INFO L79 Accepts]: Start accepts. Automaton has 455 states and 1146 transitions. Word has length 19 [2025-04-13 21:55:06,015 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:06,015 INFO L485 AbstractCegarLoop]: Abstraction has 455 states and 1146 transitions. [2025-04-13 21:55:06,015 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:06,015 INFO L278 IsEmpty]: Start isEmpty. Operand 455 states and 1146 transitions. [2025-04-13 21:55:06,016 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:55:06,016 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:06,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:06,016 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-04-13 21:55:06,016 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:55:06,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:06,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1218873781, now seen corresponding path program 22 times [2025-04-13 21:55:06,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:06,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977959815] [2025-04-13 21:55:06,016 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:55:06,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:06,039 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:55:06,065 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:55:06,065 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:55:06,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:07,182 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:55:07,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:07,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977959815] [2025-04-13 21:55:07,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977959815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:07,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:07,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:55:07,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704755728] [2025-04-13 21:55:07,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:07,183 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:55:07,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:07,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:55:07,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:55:07,183 INFO L87 Difference]: Start difference. First operand 455 states and 1146 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:08,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:08,660 INFO L93 Difference]: Finished difference Result 697 states and 1720 transitions. [2025-04-13 21:55:08,660 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:55:08,660 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:55:08,660 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:08,662 INFO L225 Difference]: With dead ends: 697 [2025-04-13 21:55:08,662 INFO L226 Difference]: Without dead ends: 677 [2025-04-13 21:55:08,662 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2025-04-13 21:55:08,663 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 131 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:08,663 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 0 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 21:55:08,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-04-13 21:55:08,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 473. [2025-04-13 21:55:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 471 states have (on average 2.5796178343949046) internal successors, (1215), 472 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have 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:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1215 transitions. [2025-04-13 21:55:08,758 INFO L79 Accepts]: Start accepts. Automaton has 473 states and 1215 transitions. Word has length 19 [2025-04-13 21:55:08,758 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:08,758 INFO L485 AbstractCegarLoop]: Abstraction has 473 states and 1215 transitions. [2025-04-13 21:55:08,758 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:08,759 INFO L278 IsEmpty]: Start isEmpty. Operand 473 states and 1215 transitions. [2025-04-13 21:55:08,759 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:55:08,759 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:08,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:08,759 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-04-13 21:55:08,759 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:55:08,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:08,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1743749227, now seen corresponding path program 23 times [2025-04-13 21:55:08,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:08,760 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628617558] [2025-04-13 21:55:08,760 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:55:08,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:08,782 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:55:08,806 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:55:08,806 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:55:08,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:10,774 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:55:10,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:10,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628617558] [2025-04-13 21:55:10,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628617558] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:10,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:10,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 21:55:10,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585759650] [2025-04-13 21:55:10,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:10,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:55:10,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:10,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:55:10,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:55:10,775 INFO L87 Difference]: Start difference. First operand 473 states and 1215 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:12,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:12,327 INFO L93 Difference]: Finished difference Result 718 states and 1805 transitions. [2025-04-13 21:55:12,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:55:12,327 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:55:12,327 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:12,329 INFO L225 Difference]: With dead ends: 718 [2025-04-13 21:55:12,329 INFO L226 Difference]: Without dead ends: 698 [2025-04-13 21:55:12,329 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:55:12,329 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:12,329 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 21:55:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-04-13 21:55:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 461. [2025-04-13 21:55:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 459 states have (on average 2.5468409586056646) internal successors, (1169), 460 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have 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,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1169 transitions. [2025-04-13 21:55:12,425 INFO L79 Accepts]: Start accepts. Automaton has 461 states and 1169 transitions. Word has length 19 [2025-04-13 21:55:12,425 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:12,425 INFO L485 AbstractCegarLoop]: Abstraction has 461 states and 1169 transitions. [2025-04-13 21:55:12,425 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:12,425 INFO L278 IsEmpty]: Start isEmpty. Operand 461 states and 1169 transitions. [2025-04-13 21:55:12,426 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:55:12,426 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:12,426 INFO L218 NwaCegarLoop]: trace histogram [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,426 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2025-04-13 21:55:12,426 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:55:12,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:12,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1161990773, now seen corresponding path program 15 times [2025-04-13 21:55:12,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:12,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971955629] [2025-04-13 21:55:12,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:55:12,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:12,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:55:12,471 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:55:12,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:55:12,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:13,957 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:55:13,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:13,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971955629] [2025-04-13 21:55:13,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971955629] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:13,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:13,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:55:13,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282376146] [2025-04-13 21:55:13,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:13,958 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:55:13,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:13,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:55:13,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:55:13,958 INFO L87 Difference]: Start difference. First operand 461 states and 1169 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:15,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:15,969 INFO L93 Difference]: Finished difference Result 787 states and 1925 transitions. [2025-04-13 21:55:15,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 21:55:15,969 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:55:15,969 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:15,971 INFO L225 Difference]: With dead ends: 787 [2025-04-13 21:55:15,971 INFO L226 Difference]: Without dead ends: 762 [2025-04-13 21:55:15,971 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:55:15,971 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:15,971 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 21:55:15,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-04-13 21:55:16,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 485. [2025-04-13 21:55:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 483 states have (on average 2.548654244306418) internal successors, (1231), 484 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have 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:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1231 transitions. [2025-04-13 21:55:16,068 INFO L79 Accepts]: Start accepts. Automaton has 485 states and 1231 transitions. Word has length 19 [2025-04-13 21:55:16,068 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:16,068 INFO L485 AbstractCegarLoop]: Abstraction has 485 states and 1231 transitions. [2025-04-13 21:55:16,068 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:16,068 INFO L278 IsEmpty]: Start isEmpty. Operand 485 states and 1231 transitions. [2025-04-13 21:55:16,069 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:55:16,069 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:16,069 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:16,069 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-04-13 21:55:16,069 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:55:16,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:16,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1023453627, now seen corresponding path program 19 times [2025-04-13 21:55:16,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:16,069 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376827856] [2025-04-13 21:55:16,070 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:55:16,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:16,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:55:16,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:55:16,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:55:16,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:16,405 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:55:16,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:16,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376827856] [2025-04-13 21:55:16,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376827856] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:16,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:16,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 21:55:16,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873394869] [2025-04-13 21:55:16,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:16,405 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:55:16,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:16,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:55:16,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:55:16,406 INFO L87 Difference]: Start difference. First operand 485 states and 1231 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:17,015 INFO L93 Difference]: Finished difference Result 664 states and 1600 transitions. [2025-04-13 21:55:17,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:55:17,016 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:55:17,016 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:17,017 INFO L225 Difference]: With dead ends: 664 [2025-04-13 21:55:17,017 INFO L226 Difference]: Without dead ends: 626 [2025-04-13 21:55:17,018 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:55:17,018 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 70 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:17,018 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 10 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:55:17,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-04-13 21:55:17,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 481. [2025-04-13 21:55:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 479 states have (on average 2.5240083507306887) internal successors, (1209), 480 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have 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:17,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1209 transitions. [2025-04-13 21:55:17,120 INFO L79 Accepts]: Start accepts. Automaton has 481 states and 1209 transitions. Word has length 19 [2025-04-13 21:55:17,120 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:17,120 INFO L485 AbstractCegarLoop]: Abstraction has 481 states and 1209 transitions. [2025-04-13 21:55:17,121 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:17,121 INFO L278 IsEmpty]: Start isEmpty. Operand 481 states and 1209 transitions. [2025-04-13 21:55:17,121 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:55:17,121 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:17,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:17,121 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-04-13 21:55:17,121 INFO L403 AbstractCegarLoop]: === Iteration 83 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:55:17,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:17,122 INFO L85 PathProgramCache]: Analyzing trace with hash -848178525, now seen corresponding path program 15 times [2025-04-13 21:55:17,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:17,122 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547677741] [2025-04-13 21:55:17,122 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:55:17,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:17,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:55:17,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:55:17,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:55:17,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:18,256 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:55:18,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:18,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547677741] [2025-04-13 21:55:18,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547677741] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:18,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:18,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:55:18,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602519789] [2025-04-13 21:55:18,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:18,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:55:18,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:18,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:55:18,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:55:18,257 INFO L87 Difference]: Start difference. First operand 481 states and 1209 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:19,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:19,846 INFO L93 Difference]: Finished difference Result 736 states and 1812 transitions. [2025-04-13 21:55:19,846 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 21:55:19,846 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:55:19,846 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:19,848 INFO L225 Difference]: With dead ends: 736 [2025-04-13 21:55:19,848 INFO L226 Difference]: Without dead ends: 713 [2025-04-13 21:55:19,848 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=531, Unknown=0, NotChecked=0, Total=756 [2025-04-13 21:55:19,848 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 166 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:19,848 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 0 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 21:55:19,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-04-13 21:55:19,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 489. [2025-04-13 21:55:19,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 487 states have (on average 2.5318275154004106) internal successors, (1233), 488 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have 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,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1233 transitions. [2025-04-13 21:55:19,959 INFO L79 Accepts]: Start accepts. Automaton has 489 states and 1233 transitions. Word has length 19 [2025-04-13 21:55:19,959 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:19,959 INFO L485 AbstractCegarLoop]: Abstraction has 489 states and 1233 transitions. [2025-04-13 21:55:19,959 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:19,959 INFO L278 IsEmpty]: Start isEmpty. Operand 489 states and 1233 transitions. [2025-04-13 21:55:19,960 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:55:19,960 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:19,960 INFO L218 NwaCegarLoop]: trace histogram [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,960 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-04-13 21:55:19,960 INFO L403 AbstractCegarLoop]: === Iteration 84 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:55:19,960 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:19,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2117490093, now seen corresponding path program 24 times [2025-04-13 21:55:19,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:19,960 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387212277] [2025-04-13 21:55:19,960 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:55:19,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:19,982 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:55:20,012 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:55:20,012 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:55:20,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:20,946 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:55:20,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:20,946 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387212277] [2025-04-13 21:55:20,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387212277] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:20,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:20,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:55:20,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446928627] [2025-04-13 21:55:20,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:20,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:55:20,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:20,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:55:20,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:55:20,947 INFO L87 Difference]: Start difference. First operand 489 states and 1233 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:22,679 INFO L93 Difference]: Finished difference Result 660 states and 1608 transitions. [2025-04-13 21:55:22,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:55:22,679 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:55:22,679 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:22,681 INFO L225 Difference]: With dead ends: 660 [2025-04-13 21:55:22,681 INFO L226 Difference]: Without dead ends: 640 [2025-04-13 21:55:22,681 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 21:55:22,681 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 131 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:22,681 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 0 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:55:22,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-04-13 21:55:22,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 489. [2025-04-13 21:55:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 487 states have (on average 2.5318275154004106) internal successors, (1233), 488 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have 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:22,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1233 transitions. [2025-04-13 21:55:22,792 INFO L79 Accepts]: Start accepts. Automaton has 489 states and 1233 transitions. Word has length 19 [2025-04-13 21:55:22,792 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:22,792 INFO L485 AbstractCegarLoop]: Abstraction has 489 states and 1233 transitions. [2025-04-13 21:55:22,792 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:22,792 INFO L278 IsEmpty]: Start isEmpty. Operand 489 states and 1233 transitions. [2025-04-13 21:55:22,793 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:55:22,793 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:22,793 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:22,793 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2025-04-13 21:55:22,793 INFO L403 AbstractCegarLoop]: === Iteration 85 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:55:22,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:22,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1582113419, now seen corresponding path program 16 times [2025-04-13 21:55:22,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:22,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398963855] [2025-04-13 21:55:22,793 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:55:22,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:22,815 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:55:22,838 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:55:22,838 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:55:22,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:24,052 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:55:24,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:24,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398963855] [2025-04-13 21:55:24,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398963855] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:24,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:24,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:55:24,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220041077] [2025-04-13 21:55:24,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:24,053 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:55:24,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:24,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:55:24,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:55:24,053 INFO L87 Difference]: Start difference. First operand 489 states and 1233 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:25,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:25,363 INFO L93 Difference]: Finished difference Result 763 states and 1897 transitions. [2025-04-13 21:55:25,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:55:25,363 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:55:25,363 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:25,365 INFO L225 Difference]: With dead ends: 763 [2025-04-13 21:55:25,365 INFO L226 Difference]: Without dead ends: 714 [2025-04-13 21:55:25,366 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:55:25,366 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:25,366 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 21:55:25,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-04-13 21:55:25,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 501. [2025-04-13 21:55:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 499 states have (on average 2.559118236472946) internal successors, (1277), 500 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have 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,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1277 transitions. [2025-04-13 21:55:25,480 INFO L79 Accepts]: Start accepts. Automaton has 501 states and 1277 transitions. Word has length 19 [2025-04-13 21:55:25,480 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:25,480 INFO L485 AbstractCegarLoop]: Abstraction has 501 states and 1277 transitions. [2025-04-13 21:55:25,480 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:25,480 INFO L278 IsEmpty]: Start isEmpty. Operand 501 states and 1277 transitions. [2025-04-13 21:55:25,480 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:55:25,480 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:25,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:25,481 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2025-04-13 21:55:25,481 INFO L403 AbstractCegarLoop]: === Iteration 86 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:55:25,481 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:25,481 INFO L85 PathProgramCache]: Analyzing trace with hash -830970315, now seen corresponding path program 17 times [2025-04-13 21:55:25,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:25,481 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973963816] [2025-04-13 21:55:25,481 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:55:25,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:25,503 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:55:25,520 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:55:25,520 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:55:25,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:55:26,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:26,340 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973963816] [2025-04-13 21:55:26,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973963816] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:26,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:26,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:55:26,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767753344] [2025-04-13 21:55:26,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:26,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:55:26,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:26,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:55:26,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:55:26,341 INFO L87 Difference]: Start difference. First operand 501 states and 1277 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:27,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:27,754 INFO L93 Difference]: Finished difference Result 779 states and 1887 transitions. [2025-04-13 21:55:27,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:55:27,754 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:55:27,754 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:27,756 INFO L225 Difference]: With dead ends: 779 [2025-04-13 21:55:27,756 INFO L226 Difference]: Without dead ends: 730 [2025-04-13 21:55:27,757 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:55:27,757 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 105 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:27,757 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 0 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:55:27,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2025-04-13 21:55:27,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 487. [2025-04-13 21:55:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 485 states have (on average 2.54020618556701) internal successors, (1232), 486 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have 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:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1232 transitions. [2025-04-13 21:55:27,865 INFO L79 Accepts]: Start accepts. Automaton has 487 states and 1232 transitions. Word has length 19 [2025-04-13 21:55:27,865 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:27,865 INFO L485 AbstractCegarLoop]: Abstraction has 487 states and 1232 transitions. [2025-04-13 21:55:27,865 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:27,865 INFO L278 IsEmpty]: Start isEmpty. Operand 487 states and 1232 transitions. [2025-04-13 21:55:27,866 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:55:27,866 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:27,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:27,866 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2025-04-13 21:55:27,866 INFO L403 AbstractCegarLoop]: === Iteration 87 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:55:27,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:27,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1798151013, now seen corresponding path program 16 times [2025-04-13 21:55:27,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:27,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549906865] [2025-04-13 21:55:27,866 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:55:27,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:27,889 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:55:27,911 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:55:27,911 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:55:27,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:28,938 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:55:28,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:28,938 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549906865] [2025-04-13 21:55:28,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549906865] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:28,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:28,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 21:55:28,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732064154] [2025-04-13 21:55:28,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:28,938 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:55:28,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:28,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:55:28,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:55:28,939 INFO L87 Difference]: Start difference. First operand 487 states and 1232 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:29,919 INFO L93 Difference]: Finished difference Result 668 states and 1676 transitions. [2025-04-13 21:55:29,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:55:29,920 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:55:29,920 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:29,922 INFO L225 Difference]: With dead ends: 668 [2025-04-13 21:55:29,922 INFO L226 Difference]: Without dead ends: 619 [2025-04-13 21:55:29,922 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:55:29,922 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:29,922 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 21:55:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-04-13 21:55:30,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 497. [2025-04-13 21:55:30,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 495 states have (on average 2.5595959595959594) internal successors, (1267), 496 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have 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:30,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1267 transitions. [2025-04-13 21:55:30,042 INFO L79 Accepts]: Start accepts. Automaton has 497 states and 1267 transitions. Word has length 19 [2025-04-13 21:55:30,043 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:30,043 INFO L485 AbstractCegarLoop]: Abstraction has 497 states and 1267 transitions. [2025-04-13 21:55:30,043 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:30,043 INFO L278 IsEmpty]: Start isEmpty. Operand 497 states and 1267 transitions. [2025-04-13 21:55:30,043 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:55:30,043 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:30,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:30,043 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-04-13 21:55:30,044 INFO L403 AbstractCegarLoop]: === Iteration 88 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:55:30,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:30,044 INFO L85 PathProgramCache]: Analyzing trace with hash 655034817, now seen corresponding path program 17 times [2025-04-13 21:55:30,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:30,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844526634] [2025-04-13 21:55:30,044 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:55:30,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:30,067 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:55:30,094 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:55:30,095 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:55:30,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:31,995 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:55:31,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:31,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844526634] [2025-04-13 21:55:31,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844526634] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:31,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:31,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 21:55:31,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866063927] [2025-04-13 21:55:31,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:31,995 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:55:31,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:31,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:55:31,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:55:31,996 INFO L87 Difference]: Start difference. First operand 497 states and 1267 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:33,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:33,957 INFO L93 Difference]: Finished difference Result 728 states and 1838 transitions. [2025-04-13 21:55:33,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 21:55:33,957 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:55:33,958 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:33,959 INFO L225 Difference]: With dead ends: 728 [2025-04-13 21:55:33,959 INFO L226 Difference]: Without dead ends: 679 [2025-04-13 21:55:33,960 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2025-04-13 21:55:33,960 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:33,960 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 21:55:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-04-13 21:55:34,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 505. [2025-04-13 21:55:34,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 503 states have (on average 2.570576540755467) internal successors, (1293), 504 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have 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,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1293 transitions. [2025-04-13 21:55:34,080 INFO L79 Accepts]: Start accepts. Automaton has 505 states and 1293 transitions. Word has length 19 [2025-04-13 21:55:34,080 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:34,080 INFO L485 AbstractCegarLoop]: Abstraction has 505 states and 1293 transitions. [2025-04-13 21:55:34,080 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:34,080 INFO L278 IsEmpty]: Start isEmpty. Operand 505 states and 1293 transitions. [2025-04-13 21:55:34,081 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:55:34,081 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:34,081 INFO L218 NwaCegarLoop]: trace histogram [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,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2025-04-13 21:55:34,081 INFO L403 AbstractCegarLoop]: === Iteration 89 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:55:34,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:34,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1745227519, now seen corresponding path program 18 times [2025-04-13 21:55:34,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:34,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783061163] [2025-04-13 21:55:34,082 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:55:34,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:34,104 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:55:34,126 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:55:34,127 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:55:34,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:35,652 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:55:35,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:35,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783061163] [2025-04-13 21:55:35,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783061163] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:35,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:35,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:55:35,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924574153] [2025-04-13 21:55:35,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:35,653 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:55:35,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:35,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:55:35,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:55:35,653 INFO L87 Difference]: Start difference. First operand 505 states and 1293 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:36,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:36,990 INFO L93 Difference]: Finished difference Result 672 states and 1688 transitions. [2025-04-13 21:55:36,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:55:36,991 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:55:36,991 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:36,993 INFO L225 Difference]: With dead ends: 672 [2025-04-13 21:55:36,993 INFO L226 Difference]: Without dead ends: 623 [2025-04-13 21:55:36,993 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:55:36,993 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:36,993 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 0 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:55:36,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-04-13 21:55:37,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 521. [2025-04-13 21:55:37,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 519 states have (on average 2.58766859344894) internal successors, (1343), 520 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have 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:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 1343 transitions. [2025-04-13 21:55:37,134 INFO L79 Accepts]: Start accepts. Automaton has 521 states and 1343 transitions. Word has length 19 [2025-04-13 21:55:37,134 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:37,134 INFO L485 AbstractCegarLoop]: Abstraction has 521 states and 1343 transitions. [2025-04-13 21:55:37,134 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:37,134 INFO L278 IsEmpty]: Start isEmpty. Operand 521 states and 1343 transitions. [2025-04-13 21:55:37,135 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:55:37,135 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:37,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:37,135 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2025-04-13 21:55:37,135 INFO L403 AbstractCegarLoop]: === Iteration 90 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:55:37,135 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:37,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1565643549, now seen corresponding path program 19 times [2025-04-13 21:55:37,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:37,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544334247] [2025-04-13 21:55:37,136 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:55:37,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:37,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:55:37,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:55:37,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:55:37,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:39,017 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:55:39,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:39,017 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544334247] [2025-04-13 21:55:39,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544334247] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:39,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:39,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:55:39,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989264227] [2025-04-13 21:55:39,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:39,017 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:55:39,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:39,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:55:39,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:55:39,018 INFO L87 Difference]: Start difference. First operand 521 states and 1343 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:40,450 INFO L93 Difference]: Finished difference Result 674 states and 1697 transitions. [2025-04-13 21:55:40,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:55:40,450 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:55:40,450 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:40,452 INFO L225 Difference]: With dead ends: 674 [2025-04-13 21:55:40,452 INFO L226 Difference]: Without dead ends: 625 [2025-04-13 21:55:40,452 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-04-13 21:55:40,452 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:40,452 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:55:40,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-04-13 21:55:40,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 491. [2025-04-13 21:55:40,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 489 states have (on average 2.5521472392638036) internal successors, (1248), 490 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have 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,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 1248 transitions. [2025-04-13 21:55:40,575 INFO L79 Accepts]: Start accepts. Automaton has 491 states and 1248 transitions. Word has length 19 [2025-04-13 21:55:40,575 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:40,575 INFO L485 AbstractCegarLoop]: Abstraction has 491 states and 1248 transitions. [2025-04-13 21:55:40,575 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:40,575 INFO L278 IsEmpty]: Start isEmpty. Operand 491 states and 1248 transitions. [2025-04-13 21:55:40,576 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:55:40,576 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:40,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:40,576 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2025-04-13 21:55:40,576 INFO L403 AbstractCegarLoop]: === Iteration 91 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:55:40,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:40,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1515638133, now seen corresponding path program 25 times [2025-04-13 21:55:40,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:40,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540745723] [2025-04-13 21:55:40,576 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:55:40,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:40,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:55:40,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:55:40,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:55:40,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:42,075 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:55:42,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:42,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540745723] [2025-04-13 21:55:42,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540745723] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:42,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:42,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 21:55:42,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030336827] [2025-04-13 21:55:42,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:42,075 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:55:42,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:42,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:55:42,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:55:42,076 INFO L87 Difference]: Start difference. First operand 491 states and 1248 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:43,554 INFO L93 Difference]: Finished difference Result 710 states and 1783 transitions. [2025-04-13 21:55:43,554 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:55:43,554 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:55:43,554 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:43,557 INFO L225 Difference]: With dead ends: 710 [2025-04-13 21:55:43,557 INFO L226 Difference]: Without dead ends: 690 [2025-04-13 21:55:43,557 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-04-13 21:55:43,557 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:43,557 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 21:55:43,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-04-13 21:55:43,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 489. [2025-04-13 21:55:43,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 487 states have (on average 2.5523613963039016) internal successors, (1243), 488 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have 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:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1243 transitions. [2025-04-13 21:55:43,677 INFO L79 Accepts]: Start accepts. Automaton has 489 states and 1243 transitions. Word has length 19 [2025-04-13 21:55:43,677 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:43,677 INFO L485 AbstractCegarLoop]: Abstraction has 489 states and 1243 transitions. [2025-04-13 21:55:43,677 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:43,677 INFO L278 IsEmpty]: Start isEmpty. Operand 489 states and 1243 transitions. [2025-04-13 21:55:43,678 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:55:43,678 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:43,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:43,678 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-04-13 21:55:43,678 INFO L403 AbstractCegarLoop]: === Iteration 92 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:55:43,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:43,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1504698183, now seen corresponding path program 20 times [2025-04-13 21:55:43,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:43,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143541919] [2025-04-13 21:55:43,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:55:43,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:43,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:55:43,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:55:43,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:55:43,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:45,178 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:55:45,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:45,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143541919] [2025-04-13 21:55:45,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143541919] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:45,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:45,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:55:45,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833811228] [2025-04-13 21:55:45,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:45,179 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:55:45,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:45,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:55:45,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:55:45,179 INFO L87 Difference]: Start difference. First operand 489 states and 1243 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:46,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:46,704 INFO L93 Difference]: Finished difference Result 678 states and 1703 transitions. [2025-04-13 21:55:46,704 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:55:46,705 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:55:46,705 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:46,706 INFO L225 Difference]: With dead ends: 678 [2025-04-13 21:55:46,706 INFO L226 Difference]: Without dead ends: 629 [2025-04-13 21:55:46,707 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:55:46,707 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:46,707 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:55:46,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-04-13 21:55:46,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 497. [2025-04-13 21:55:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 495 states have (on average 2.5636363636363635) internal successors, (1269), 496 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have 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,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1269 transitions. [2025-04-13 21:55:46,844 INFO L79 Accepts]: Start accepts. Automaton has 497 states and 1269 transitions. Word has length 19 [2025-04-13 21:55:46,844 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:46,844 INFO L485 AbstractCegarLoop]: Abstraction has 497 states and 1269 transitions. [2025-04-13 21:55:46,844 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:46,844 INFO L278 IsEmpty]: Start isEmpty. Operand 497 states and 1269 transitions. [2025-04-13 21:55:46,845 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:55:46,845 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:46,845 INFO L218 NwaCegarLoop]: trace histogram [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,845 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2025-04-13 21:55:46,845 INFO L403 AbstractCegarLoop]: === Iteration 93 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:55:46,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:46,845 INFO L85 PathProgramCache]: Analyzing trace with hash 794149301, now seen corresponding path program 26 times [2025-04-13 21:55:46,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:46,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218222742] [2025-04-13 21:55:46,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:55:46,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:46,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:55:46,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:55:46,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:55:46,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:47,952 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:55:47,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:47,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218222742] [2025-04-13 21:55:47,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218222742] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:47,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:47,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:55:47,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804529833] [2025-04-13 21:55:47,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:47,953 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:55:47,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:47,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:55:47,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:55:47,953 INFO L87 Difference]: Start difference. First operand 497 states and 1269 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:49,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:49,334 INFO L93 Difference]: Finished difference Result 687 states and 1683 transitions. [2025-04-13 21:55:49,335 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:55:49,335 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:55:49,335 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:49,337 INFO L225 Difference]: With dead ends: 687 [2025-04-13 21:55:49,337 INFO L226 Difference]: Without dead ends: 638 [2025-04-13 21:55:49,337 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:55:49,337 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:49,337 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 21:55:49,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-04-13 21:55:49,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 469. [2025-04-13 21:55:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 467 states have (on average 2.5331905781584583) internal successors, (1183), 468 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have 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:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1183 transitions. [2025-04-13 21:55:49,470 INFO L79 Accepts]: Start accepts. Automaton has 469 states and 1183 transitions. Word has length 19 [2025-04-13 21:55:49,470 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:49,470 INFO L485 AbstractCegarLoop]: Abstraction has 469 states and 1183 transitions. [2025-04-13 21:55:49,470 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:49,470 INFO L278 IsEmpty]: Start isEmpty. Operand 469 states and 1183 transitions. [2025-04-13 21:55:49,471 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:55:49,471 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:49,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:49,471 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2025-04-13 21:55:49,471 INFO L403 AbstractCegarLoop]: === Iteration 94 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:55:49,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:49,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1518104133, now seen corresponding path program 21 times [2025-04-13 21:55:49,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:49,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616788945] [2025-04-13 21:55:49,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:55:49,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:49,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:55:49,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:55:49,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:55:49,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:50,818 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:55:50,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:50,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616788945] [2025-04-13 21:55:50,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616788945] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:50,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:50,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:55:50,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3711073] [2025-04-13 21:55:50,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:50,819 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:55:50,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:50,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:55:50,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:55:50,820 INFO L87 Difference]: Start difference. First operand 469 states and 1183 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:52,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:52,246 INFO L93 Difference]: Finished difference Result 627 states and 1574 transitions. [2025-04-13 21:55:52,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:55:52,247 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:55:52,247 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:52,249 INFO L225 Difference]: With dead ends: 627 [2025-04-13 21:55:52,249 INFO L226 Difference]: Without dead ends: 603 [2025-04-13 21:55:52,249 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:55:52,249 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:52,249 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:55:52,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-04-13 21:55:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 455. [2025-04-13 21:55:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 453 states have (on average 2.5033112582781456) internal successors, (1134), 454 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have 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:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1134 transitions. [2025-04-13 21:55:52,356 INFO L79 Accepts]: Start accepts. Automaton has 455 states and 1134 transitions. Word has length 19 [2025-04-13 21:55:52,356 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:52,356 INFO L485 AbstractCegarLoop]: Abstraction has 455 states and 1134 transitions. [2025-04-13 21:55:52,356 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:52,356 INFO L278 IsEmpty]: Start isEmpty. Operand 455 states and 1134 transitions. [2025-04-13 21:55:52,356 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:55:52,357 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:52,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:52,357 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-04-13 21:55:52,357 INFO L403 AbstractCegarLoop]: === Iteration 95 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:55:52,357 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:52,357 INFO L85 PathProgramCache]: Analyzing trace with hash 849269601, now seen corresponding path program 20 times [2025-04-13 21:55:52,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:52,357 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881610244] [2025-04-13 21:55:52,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:55:52,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:52,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:55:52,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:55:52,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:55:52,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:53,594 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:55:53,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:53,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881610244] [2025-04-13 21:55:53,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881610244] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:53,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:53,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:55:53,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011388790] [2025-04-13 21:55:53,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:53,594 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:55:53,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:53,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:55:53,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:55:53,595 INFO L87 Difference]: Start difference. First operand 455 states and 1134 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:55,161 INFO L93 Difference]: Finished difference Result 609 states and 1466 transitions. [2025-04-13 21:55:55,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:55:55,161 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:55:55,161 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:55,163 INFO L225 Difference]: With dead ends: 609 [2025-04-13 21:55:55,163 INFO L226 Difference]: Without dead ends: 560 [2025-04-13 21:55:55,163 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:55:55,164 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:55,164 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 21:55:55,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-04-13 21:55:55,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 455. [2025-04-13 21:55:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 453 states have (on average 2.498896247240618) internal successors, (1132), 454 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have 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:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1132 transitions. [2025-04-13 21:55:55,278 INFO L79 Accepts]: Start accepts. Automaton has 455 states and 1132 transitions. Word has length 19 [2025-04-13 21:55:55,278 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:55,278 INFO L485 AbstractCegarLoop]: Abstraction has 455 states and 1132 transitions. [2025-04-13 21:55:55,278 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:55,278 INFO L278 IsEmpty]: Start isEmpty. Operand 455 states and 1132 transitions. [2025-04-13 21:55:55,279 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:55:55,279 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:55,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:55,279 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2025-04-13 21:55:55,279 INFO L403 AbstractCegarLoop]: === Iteration 96 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:55:55,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:55,279 INFO L85 PathProgramCache]: Analyzing trace with hash -432300603, now seen corresponding path program 22 times [2025-04-13 21:55:55,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:55,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001451465] [2025-04-13 21:55:55,279 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:55:55,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:55,302 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:55:55,332 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:55:55,332 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:55:55,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:56,439 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:55:56,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:56,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001451465] [2025-04-13 21:55:56,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001451465] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:56,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:56,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:55:56,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365303564] [2025-04-13 21:55:56,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:56,440 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:55:56,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:56,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:55:56,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:55:56,440 INFO L87 Difference]: Start difference. First operand 455 states and 1132 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:58,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:58,227 INFO L93 Difference]: Finished difference Result 634 states and 1583 transitions. [2025-04-13 21:55:58,227 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:55:58,227 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:55:58,227 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:58,229 INFO L225 Difference]: With dead ends: 634 [2025-04-13 21:55:58,229 INFO L226 Difference]: Without dead ends: 585 [2025-04-13 21:55:58,229 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2025-04-13 21:55:58,229 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:58,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 21:55:58,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-04-13 21:55:58,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 467. [2025-04-13 21:55:58,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 2.50752688172043) internal successors, (1166), 466 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have 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:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 1166 transitions. [2025-04-13 21:55:58,344 INFO L79 Accepts]: Start accepts. Automaton has 467 states and 1166 transitions. Word has length 19 [2025-04-13 21:55:58,344 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:58,344 INFO L485 AbstractCegarLoop]: Abstraction has 467 states and 1166 transitions. [2025-04-13 21:55:58,344 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:55:58,344 INFO L278 IsEmpty]: Start isEmpty. Operand 467 states and 1166 transitions. [2025-04-13 21:55:58,345 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:55:58,345 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:58,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:58,345 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2025-04-13 21:55:58,345 INFO L403 AbstractCegarLoop]: === Iteration 97 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:55:58,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:58,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1361838683, now seen corresponding path program 23 times [2025-04-13 21:55:58,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:58,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907817205] [2025-04-13 21:55:58,345 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:55:58,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:58,368 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:55:58,385 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:55:58,385 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:55:58,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:59,484 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:55:59,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:59,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907817205] [2025-04-13 21:55:59,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907817205] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:59,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:59,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:55:59,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142612546] [2025-04-13 21:55:59,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:59,485 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:55:59,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:59,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:55:59,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:55:59,486 INFO L87 Difference]: Start difference. First operand 467 states and 1166 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:00,840 INFO L93 Difference]: Finished difference Result 598 states and 1451 transitions. [2025-04-13 21:56:00,840 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:56:00,840 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:00,840 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:00,842 INFO L225 Difference]: With dead ends: 598 [2025-04-13 21:56:00,842 INFO L226 Difference]: Without dead ends: 574 [2025-04-13 21:56:00,842 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:56:00,843 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:00,843 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:56:00,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-04-13 21:56:00,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 459. [2025-04-13 21:56:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 457 states have (on average 2.5207877461706785) internal successors, (1152), 458 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have 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,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 1152 transitions. [2025-04-13 21:56:00,970 INFO L79 Accepts]: Start accepts. Automaton has 459 states and 1152 transitions. Word has length 19 [2025-04-13 21:56:00,970 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:00,970 INFO L485 AbstractCegarLoop]: Abstraction has 459 states and 1152 transitions. [2025-04-13 21:56:00,970 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:00,970 INFO L278 IsEmpty]: Start isEmpty. Operand 459 states and 1152 transitions. [2025-04-13 21:56:00,971 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:00,971 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:00,971 INFO L218 NwaCegarLoop]: trace histogram [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,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2025-04-13 21:56:00,971 INFO L403 AbstractCegarLoop]: === Iteration 98 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:00,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:00,971 INFO L85 PathProgramCache]: Analyzing trace with hash -444380885, now seen corresponding path program 21 times [2025-04-13 21:56:00,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:00,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761424632] [2025-04-13 21:56:00,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:56:00,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:00,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:56:01,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:01,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:56:01,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:02,243 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:56:02,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:02,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761424632] [2025-04-13 21:56:02,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761424632] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:02,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:02,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:56:02,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671495961] [2025-04-13 21:56:02,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:02,244 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:56:02,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:02,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:56:02,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:56:02,244 INFO L87 Difference]: Start difference. First operand 459 states and 1152 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:03,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:03,521 INFO L93 Difference]: Finished difference Result 604 states and 1482 transitions. [2025-04-13 21:56:03,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:56:03,522 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:03,522 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:03,524 INFO L225 Difference]: With dead ends: 604 [2025-04-13 21:56:03,524 INFO L226 Difference]: Without dead ends: 555 [2025-04-13 21:56:03,524 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:56:03,524 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:03,524 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:56:03,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-04-13 21:56:03,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 441. [2025-04-13 21:56:03,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 439 states have (on average 2.5125284738041) internal successors, (1103), 440 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have 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:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1103 transitions. [2025-04-13 21:56:03,637 INFO L79 Accepts]: Start accepts. Automaton has 441 states and 1103 transitions. Word has length 19 [2025-04-13 21:56:03,637 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:03,637 INFO L485 AbstractCegarLoop]: Abstraction has 441 states and 1103 transitions. [2025-04-13 21:56:03,638 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:03,638 INFO L278 IsEmpty]: Start isEmpty. Operand 441 states and 1103 transitions. [2025-04-13 21:56:03,638 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:03,638 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:03,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:03,638 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2025-04-13 21:56:03,638 INFO L403 AbstractCegarLoop]: === Iteration 99 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:03,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:03,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1527868385, now seen corresponding path program 22 times [2025-04-13 21:56:03,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:03,639 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403738962] [2025-04-13 21:56:03,639 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:56:03,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:03,662 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:56:03,683 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:03,683 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:56:03,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:04,687 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:56:04,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:04,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403738962] [2025-04-13 21:56:04,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403738962] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:04,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:04,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:56:04,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800314906] [2025-04-13 21:56:04,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:04,688 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:56:04,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:04,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:56:04,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:56:04,688 INFO L87 Difference]: Start difference. First operand 441 states and 1103 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:06,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:06,204 INFO L93 Difference]: Finished difference Result 566 states and 1373 transitions. [2025-04-13 21:56:06,206 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:56:06,206 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:06,206 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:06,208 INFO L225 Difference]: With dead ends: 566 [2025-04-13 21:56:06,208 INFO L226 Difference]: Without dead ends: 517 [2025-04-13 21:56:06,208 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:56:06,208 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:06,208 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 21:56:06,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-04-13 21:56:06,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 443. [2025-04-13 21:56:06,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 441 states have (on average 2.507936507936508) internal successors, (1106), 442 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have 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:06,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1106 transitions. [2025-04-13 21:56:06,336 INFO L79 Accepts]: Start accepts. Automaton has 443 states and 1106 transitions. Word has length 19 [2025-04-13 21:56:06,336 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:06,336 INFO L485 AbstractCegarLoop]: Abstraction has 443 states and 1106 transitions. [2025-04-13 21:56:06,336 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:06,336 INFO L278 IsEmpty]: Start isEmpty. Operand 443 states and 1106 transitions. [2025-04-13 21:56:06,337 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:06,337 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:06,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:06,337 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2025-04-13 21:56:06,337 INFO L403 AbstractCegarLoop]: === Iteration 100 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:06,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:06,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1541736127, now seen corresponding path program 24 times [2025-04-13 21:56:06,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:06,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204497114] [2025-04-13 21:56:06,338 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:56:06,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:06,362 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:56:06,382 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:06,382 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:56:06,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:07,667 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:56:07,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:07,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204497114] [2025-04-13 21:56:07,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204497114] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:07,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:07,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:56:07,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665954521] [2025-04-13 21:56:07,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:07,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:56:07,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:07,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:56:07,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:56:07,668 INFO L87 Difference]: Start difference. First operand 443 states and 1106 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:08,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:08,851 INFO L93 Difference]: Finished difference Result 537 states and 1309 transitions. [2025-04-13 21:56:08,851 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:56:08,851 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:08,851 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:08,853 INFO L225 Difference]: With dead ends: 537 [2025-04-13 21:56:08,853 INFO L226 Difference]: Without dead ends: 511 [2025-04-13 21:56:08,853 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:56:08,853 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:08,853 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:56:08,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-04-13 21:56:08,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 433. [2025-04-13 21:56:08,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 431 states have (on average 2.4895591647331785) internal successors, (1073), 432 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have 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:08,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1073 transitions. [2025-04-13 21:56:08,963 INFO L79 Accepts]: Start accepts. Automaton has 433 states and 1073 transitions. Word has length 19 [2025-04-13 21:56:08,963 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:08,963 INFO L485 AbstractCegarLoop]: Abstraction has 433 states and 1073 transitions. [2025-04-13 21:56:08,963 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:08,963 INFO L278 IsEmpty]: Start isEmpty. Operand 433 states and 1073 transitions. [2025-04-13 21:56:08,964 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:08,964 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:08,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:08,964 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2025-04-13 21:56:08,964 INFO L403 AbstractCegarLoop]: === Iteration 101 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:08,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:08,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1992960847, now seen corresponding path program 18 times [2025-04-13 21:56:08,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:08,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512669663] [2025-04-13 21:56:08,964 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:56:08,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:08,988 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:56:09,006 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:09,007 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:56:09,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:09,495 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:56:09,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:09,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512669663] [2025-04-13 21:56:09,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512669663] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:09,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:09,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 21:56:09,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621030217] [2025-04-13 21:56:09,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:09,495 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 21:56:09,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:09,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 21:56:09,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:56:09,496 INFO L87 Difference]: Start difference. First operand 433 states and 1073 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:10,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:10,208 INFO L93 Difference]: Finished difference Result 667 states and 1539 transitions. [2025-04-13 21:56:10,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 21:56:10,208 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:10,208 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:10,210 INFO L225 Difference]: With dead ends: 667 [2025-04-13 21:56:10,210 INFO L226 Difference]: Without dead ends: 630 [2025-04-13 21:56:10,210 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:56:10,211 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:10,211 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 21:56:10,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-04-13 21:56:10,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 429. [2025-04-13 21:56:10,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 427 states have (on average 2.4847775175644027) internal successors, (1061), 428 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have 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,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1061 transitions. [2025-04-13 21:56:10,310 INFO L79 Accepts]: Start accepts. Automaton has 429 states and 1061 transitions. Word has length 19 [2025-04-13 21:56:10,310 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:10,310 INFO L485 AbstractCegarLoop]: Abstraction has 429 states and 1061 transitions. [2025-04-13 21:56:10,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:10,310 INFO L278 IsEmpty]: Start isEmpty. Operand 429 states and 1061 transitions. [2025-04-13 21:56:10,311 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:10,311 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:10,311 INFO L218 NwaCegarLoop]: trace histogram [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,311 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2025-04-13 21:56:10,311 INFO L403 AbstractCegarLoop]: === Iteration 102 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:10,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:10,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1572838201, now seen corresponding path program 19 times [2025-04-13 21:56:10,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:10,312 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466366111] [2025-04-13 21:56:10,312 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:56:10,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:10,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:56:10,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:10,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:56:10,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:12,182 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:56:12,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:12,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466366111] [2025-04-13 21:56:12,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466366111] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:12,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:12,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:56:12,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803580196] [2025-04-13 21:56:12,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:12,183 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:56:12,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:12,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:56:12,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:56:12,183 INFO L87 Difference]: Start difference. First operand 429 states and 1061 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:14,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:14,208 INFO L93 Difference]: Finished difference Result 616 states and 1502 transitions. [2025-04-13 21:56:14,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:56:14,208 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:14,208 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:14,210 INFO L225 Difference]: With dead ends: 616 [2025-04-13 21:56:14,210 INFO L226 Difference]: Without dead ends: 591 [2025-04-13 21:56:14,210 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:56:14,211 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:14,211 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 21:56:14,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-04-13 21:56:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 433. [2025-04-13 21:56:14,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 431 states have (on average 2.4895591647331785) internal successors, (1073), 432 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have 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:14,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1073 transitions. [2025-04-13 21:56:14,311 INFO L79 Accepts]: Start accepts. Automaton has 433 states and 1073 transitions. Word has length 19 [2025-04-13 21:56:14,311 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:14,311 INFO L485 AbstractCegarLoop]: Abstraction has 433 states and 1073 transitions. [2025-04-13 21:56:14,311 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:14,311 INFO L278 IsEmpty]: Start isEmpty. Operand 433 states and 1073 transitions. [2025-04-13 21:56:14,312 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:14,312 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:14,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:14,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2025-04-13 21:56:14,312 INFO L403 AbstractCegarLoop]: === Iteration 103 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:14,312 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:14,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1686233291, now seen corresponding path program 20 times [2025-04-13 21:56:14,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:14,312 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500768107] [2025-04-13 21:56:14,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:56:14,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:14,336 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:56:14,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:14,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:56:14,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:15,993 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:56:15,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:15,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500768107] [2025-04-13 21:56:15,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500768107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:15,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:15,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:56:15,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300105344] [2025-04-13 21:56:15,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:15,993 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:56:15,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:15,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:56:15,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:56:15,994 INFO L87 Difference]: Start difference. First operand 433 states and 1073 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:17,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:17,600 INFO L93 Difference]: Finished difference Result 580 states and 1398 transitions. [2025-04-13 21:56:17,600 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:56:17,600 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:17,600 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:17,602 INFO L225 Difference]: With dead ends: 580 [2025-04-13 21:56:17,602 INFO L226 Difference]: Without dead ends: 555 [2025-04-13 21:56:17,603 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:56:17,603 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:17,603 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 0 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 21:56:17,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-04-13 21:56:17,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 417. [2025-04-13 21:56:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 415 states have (on average 2.4650602409638553) internal successors, (1023), 416 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have 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,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1023 transitions. [2025-04-13 21:56:17,705 INFO L79 Accepts]: Start accepts. Automaton has 417 states and 1023 transitions. Word has length 19 [2025-04-13 21:56:17,705 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:17,705 INFO L485 AbstractCegarLoop]: Abstraction has 417 states and 1023 transitions. [2025-04-13 21:56:17,705 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:17,705 INFO L278 IsEmpty]: Start isEmpty. Operand 417 states and 1023 transitions. [2025-04-13 21:56:17,706 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:17,706 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:17,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:17,706 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2025-04-13 21:56:17,706 INFO L403 AbstractCegarLoop]: === Iteration 104 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:17,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:17,706 INFO L85 PathProgramCache]: Analyzing trace with hash -664188655, now seen corresponding path program 27 times [2025-04-13 21:56:17,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:17,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045957346] [2025-04-13 21:56:17,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:56:17,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:17,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:56:17,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:17,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:56:17,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:19,238 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:56:19,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:19,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045957346] [2025-04-13 21:56:19,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045957346] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:19,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:19,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:56:19,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413647374] [2025-04-13 21:56:19,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:19,239 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:56:19,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:19,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:56:19,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:56:19,239 INFO L87 Difference]: Start difference. First operand 417 states and 1023 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:20,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:20,546 INFO L93 Difference]: Finished difference Result 646 states and 1575 transitions. [2025-04-13 21:56:20,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:56:20,546 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:20,546 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:20,548 INFO L225 Difference]: With dead ends: 646 [2025-04-13 21:56:20,548 INFO L226 Difference]: Without dead ends: 597 [2025-04-13 21:56:20,549 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:56:20,549 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:20,549 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 21:56:20,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-04-13 21:56:20,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 421. [2025-04-13 21:56:20,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 419 states have (on average 2.4701670644391407) internal successors, (1035), 420 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have 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:20,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1035 transitions. [2025-04-13 21:56:20,655 INFO L79 Accepts]: Start accepts. Automaton has 421 states and 1035 transitions. Word has length 19 [2025-04-13 21:56:20,655 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:20,655 INFO L485 AbstractCegarLoop]: Abstraction has 421 states and 1035 transitions. [2025-04-13 21:56:20,656 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:20,656 INFO L278 IsEmpty]: Start isEmpty. Operand 421 states and 1035 transitions. [2025-04-13 21:56:20,656 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:20,656 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:20,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:20,656 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2025-04-13 21:56:20,656 INFO L403 AbstractCegarLoop]: === Iteration 105 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:20,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:20,656 INFO L85 PathProgramCache]: Analyzing trace with hash 442998733, now seen corresponding path program 21 times [2025-04-13 21:56:20,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:20,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430828227] [2025-04-13 21:56:20,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:56:20,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:20,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:56:20,699 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:20,699 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:56:20,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:21,901 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:56:21,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:21,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430828227] [2025-04-13 21:56:21,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430828227] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:21,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:21,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:56:21,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671057252] [2025-04-13 21:56:21,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:21,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:56:21,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:21,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:56:21,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:56:21,902 INFO L87 Difference]: Start difference. First operand 421 states and 1035 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:23,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:23,028 INFO L93 Difference]: Finished difference Result 580 states and 1402 transitions. [2025-04-13 21:56:23,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:56:23,029 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:23,029 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:23,030 INFO L225 Difference]: With dead ends: 580 [2025-04-13 21:56:23,030 INFO L226 Difference]: Without dead ends: 531 [2025-04-13 21:56:23,031 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:56:23,031 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 78 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:23,031 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 0 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:56:23,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-04-13 21:56:23,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 429. [2025-04-13 21:56:23,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 427 states have (on average 2.470725995316159) internal successors, (1055), 428 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have 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,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1055 transitions. [2025-04-13 21:56:23,132 INFO L79 Accepts]: Start accepts. Automaton has 429 states and 1055 transitions. Word has length 19 [2025-04-13 21:56:23,132 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:23,132 INFO L485 AbstractCegarLoop]: Abstraction has 429 states and 1055 transitions. [2025-04-13 21:56:23,132 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:23,132 INFO L278 IsEmpty]: Start isEmpty. Operand 429 states and 1055 transitions. [2025-04-13 21:56:23,133 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:23,133 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:23,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:23,133 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2025-04-13 21:56:23,133 INFO L403 AbstractCegarLoop]: === Iteration 106 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:23,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:23,133 INFO L85 PathProgramCache]: Analyzing trace with hash 39926503, now seen corresponding path program 22 times [2025-04-13 21:56:23,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:23,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527835648] [2025-04-13 21:56:23,133 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:56:23,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:23,156 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:56:23,176 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:23,176 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:56:23,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:24,058 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:56:24,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:24,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527835648] [2025-04-13 21:56:24,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527835648] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:24,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:24,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:56:24,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936577352] [2025-04-13 21:56:24,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:24,059 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:56:24,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:24,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:56:24,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:56:24,059 INFO L87 Difference]: Start difference. First operand 429 states and 1055 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:25,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:25,053 INFO L93 Difference]: Finished difference Result 623 states and 1457 transitions. [2025-04-13 21:56:25,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:56:25,053 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:25,053 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:25,055 INFO L225 Difference]: With dead ends: 623 [2025-04-13 21:56:25,055 INFO L226 Difference]: Without dead ends: 574 [2025-04-13 21:56:25,055 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:56:25,056 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 78 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:25,056 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 0 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 21:56:25,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-04-13 21:56:25,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 413. [2025-04-13 21:56:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 411 states have (on average 2.464720194647202) internal successors, (1013), 412 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have 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:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1013 transitions. [2025-04-13 21:56:25,166 INFO L79 Accepts]: Start accepts. Automaton has 413 states and 1013 transitions. Word has length 19 [2025-04-13 21:56:25,166 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:25,166 INFO L485 AbstractCegarLoop]: Abstraction has 413 states and 1013 transitions. [2025-04-13 21:56:25,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:25,166 INFO L278 IsEmpty]: Start isEmpty. Operand 413 states and 1013 transitions. [2025-04-13 21:56:25,166 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:25,167 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:25,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:25,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2025-04-13 21:56:25,167 INFO L403 AbstractCegarLoop]: === Iteration 107 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:25,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:25,167 INFO L85 PathProgramCache]: Analyzing trace with hash 532696695, now seen corresponding path program 23 times [2025-04-13 21:56:25,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:25,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374819445] [2025-04-13 21:56:25,167 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:56:25,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:25,190 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:56:25,211 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:25,211 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:56:25,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:26,182 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:56:26,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:26,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374819445] [2025-04-13 21:56:26,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374819445] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:26,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:26,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:56:26,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062175042] [2025-04-13 21:56:26,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:26,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:56:26,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:26,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:56:26,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:56:26,183 INFO L87 Difference]: Start difference. First operand 413 states and 1013 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:27,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:27,012 INFO L93 Difference]: Finished difference Result 578 states and 1389 transitions. [2025-04-13 21:56:27,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:56:27,012 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:27,012 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:27,014 INFO L225 Difference]: With dead ends: 578 [2025-04-13 21:56:27,014 INFO L226 Difference]: Without dead ends: 529 [2025-04-13 21:56:27,014 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:56:27,014 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 54 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:27,014 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 11 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 21:56:27,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-04-13 21:56:27,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 413. [2025-04-13 21:56:27,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 411 states have (on average 2.45985401459854) internal successors, (1011), 412 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have 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:27,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1011 transitions. [2025-04-13 21:56:27,116 INFO L79 Accepts]: Start accepts. Automaton has 413 states and 1011 transitions. Word has length 19 [2025-04-13 21:56:27,116 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:27,116 INFO L485 AbstractCegarLoop]: Abstraction has 413 states and 1011 transitions. [2025-04-13 21:56:27,116 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:27,116 INFO L278 IsEmpty]: Start isEmpty. Operand 413 states and 1011 transitions. [2025-04-13 21:56:27,116 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:27,116 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:27,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:27,116 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2025-04-13 21:56:27,117 INFO L403 AbstractCegarLoop]: === Iteration 108 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:27,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:27,117 INFO L85 PathProgramCache]: Analyzing trace with hash 129624465, now seen corresponding path program 24 times [2025-04-13 21:56:27,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:27,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034964259] [2025-04-13 21:56:27,117 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:56:27,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:27,140 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:56:27,158 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:27,158 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:56:27,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:28,650 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:56:28,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:28,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034964259] [2025-04-13 21:56:28,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034964259] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:28,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:28,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:56:28,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106561779] [2025-04-13 21:56:28,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:28,650 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:56:28,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:28,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:56:28,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:56:28,651 INFO L87 Difference]: Start difference. First operand 413 states and 1011 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:29,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:29,838 INFO L93 Difference]: Finished difference Result 570 states and 1367 transitions. [2025-04-13 21:56:29,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:56:29,838 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:29,839 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:29,840 INFO L225 Difference]: With dead ends: 570 [2025-04-13 21:56:29,840 INFO L226 Difference]: Without dead ends: 545 [2025-04-13 21:56:29,840 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:56:29,841 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:29,841 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:56:29,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-04-13 21:56:29,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 399. [2025-04-13 21:56:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 397 states have (on average 2.433249370277078) internal successors, (966), 398 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have 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:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 966 transitions. [2025-04-13 21:56:29,941 INFO L79 Accepts]: Start accepts. Automaton has 399 states and 966 transitions. Word has length 19 [2025-04-13 21:56:29,941 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:29,941 INFO L485 AbstractCegarLoop]: Abstraction has 399 states and 966 transitions. [2025-04-13 21:56:29,941 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:29,941 INFO L278 IsEmpty]: Start isEmpty. Operand 399 states and 966 transitions. [2025-04-13 21:56:29,941 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:29,941 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:29,941 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:29,941 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2025-04-13 21:56:29,941 INFO L403 AbstractCegarLoop]: === Iteration 109 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:29,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:29,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1663472573, now seen corresponding path program 23 times [2025-04-13 21:56:29,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:29,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092953713] [2025-04-13 21:56:29,942 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:56:29,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:29,964 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:56:29,983 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:29,983 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:56:29,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:31,192 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:56:31,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:31,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092953713] [2025-04-13 21:56:31,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092953713] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:31,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:31,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:56:31,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285009786] [2025-04-13 21:56:31,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:31,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:56:31,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:31,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:56:31,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:56:31,193 INFO L87 Difference]: Start difference. First operand 399 states and 966 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:32,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:32,468 INFO L93 Difference]: Finished difference Result 518 states and 1229 transitions. [2025-04-13 21:56:32,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:56:32,468 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:32,468 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:32,470 INFO L225 Difference]: With dead ends: 518 [2025-04-13 21:56:32,470 INFO L226 Difference]: Without dead ends: 469 [2025-04-13 21:56:32,470 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:56:32,470 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:32,470 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:56:32,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-04-13 21:56:32,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 399. [2025-04-13 21:56:32,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 397 states have (on average 2.4282115869017633) internal successors, (964), 398 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have 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,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 964 transitions. [2025-04-13 21:56:32,582 INFO L79 Accepts]: Start accepts. Automaton has 399 states and 964 transitions. Word has length 19 [2025-04-13 21:56:32,582 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:32,582 INFO L485 AbstractCegarLoop]: Abstraction has 399 states and 964 transitions. [2025-04-13 21:56:32,582 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:32,582 INFO L278 IsEmpty]: Start isEmpty. Operand 399 states and 964 transitions. [2025-04-13 21:56:32,583 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:32,583 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:32,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:32,583 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2025-04-13 21:56:32,583 INFO L403 AbstractCegarLoop]: === Iteration 110 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:32,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:32,583 INFO L85 PathProgramCache]: Analyzing trace with hash 821620109, now seen corresponding path program 28 times [2025-04-13 21:56:32,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:32,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497018810] [2025-04-13 21:56:32,583 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:56:32,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:32,606 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:56:32,625 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:32,625 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:56:32,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:33,255 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:56:33,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:33,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497018810] [2025-04-13 21:56:33,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497018810] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:33,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:33,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 21:56:33,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22806410] [2025-04-13 21:56:33,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:33,256 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:56:33,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:33,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:56:33,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:56:33,256 INFO L87 Difference]: Start difference. First operand 399 states and 964 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:34,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:34,240 INFO L93 Difference]: Finished difference Result 533 states and 1222 transitions. [2025-04-13 21:56:34,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:56:34,240 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:34,240 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:34,242 INFO L225 Difference]: With dead ends: 533 [2025-04-13 21:56:34,242 INFO L226 Difference]: Without dead ends: 484 [2025-04-13 21:56:34,242 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:56:34,242 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:34,243 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:56:34,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-04-13 21:56:34,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 401. [2025-04-13 21:56:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 399 states have (on average 2.4285714285714284) internal successors, (969), 400 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have 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:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 969 transitions. [2025-04-13 21:56:34,348 INFO L79 Accepts]: Start accepts. Automaton has 401 states and 969 transitions. Word has length 19 [2025-04-13 21:56:34,348 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:34,348 INFO L485 AbstractCegarLoop]: Abstraction has 401 states and 969 transitions. [2025-04-13 21:56:34,348 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:34,348 INFO L278 IsEmpty]: Start isEmpty. Operand 401 states and 969 transitions. [2025-04-13 21:56:34,348 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:34,348 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:34,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:34,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2025-04-13 21:56:34,348 INFO L403 AbstractCegarLoop]: === Iteration 111 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:34,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:34,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2118925641, now seen corresponding path program 25 times [2025-04-13 21:56:34,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:34,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013394356] [2025-04-13 21:56:34,349 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:56:34,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:34,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:56:34,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:34,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:56:34,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:35,241 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:56:35,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:35,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013394356] [2025-04-13 21:56:35,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013394356] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:35,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:35,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 21:56:35,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219338135] [2025-04-13 21:56:35,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:35,241 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 21:56:35,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:35,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 21:56:35,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 21:56:35,242 INFO L87 Difference]: Start difference. First operand 401 states and 969 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:36,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:36,228 INFO L93 Difference]: Finished difference Result 548 states and 1316 transitions. [2025-04-13 21:56:36,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:56:36,228 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:36,228 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:36,230 INFO L225 Difference]: With dead ends: 548 [2025-04-13 21:56:36,230 INFO L226 Difference]: Without dead ends: 526 [2025-04-13 21:56:36,230 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:56:36,230 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 78 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:36,231 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 9 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 21:56:36,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-04-13 21:56:36,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 397. [2025-04-13 21:56:36,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 395 states have (on average 2.427848101265823) internal successors, (959), 396 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have 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:36,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 959 transitions. [2025-04-13 21:56:36,344 INFO L79 Accepts]: Start accepts. Automaton has 397 states and 959 transitions. Word has length 19 [2025-04-13 21:56:36,344 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:36,344 INFO L485 AbstractCegarLoop]: Abstraction has 397 states and 959 transitions. [2025-04-13 21:56:36,344 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:36,344 INFO L278 IsEmpty]: Start isEmpty. Operand 397 states and 959 transitions. [2025-04-13 21:56:36,345 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:36,345 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:36,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:36,345 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2025-04-13 21:56:36,345 INFO L403 AbstractCegarLoop]: === Iteration 112 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:36,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:36,345 INFO L85 PathProgramCache]: Analyzing trace with hash 418086087, now seen corresponding path program 25 times [2025-04-13 21:56:36,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:36,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456867700] [2025-04-13 21:56:36,346 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:56:36,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:36,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:56:36,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:36,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:56:36,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:37,770 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:56:37,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:37,770 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456867700] [2025-04-13 21:56:37,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456867700] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:37,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:37,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:56:37,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752717251] [2025-04-13 21:56:37,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:37,771 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:56:37,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:37,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:56:37,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:56:37,771 INFO L87 Difference]: Start difference. First operand 397 states and 959 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:39,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:39,137 INFO L93 Difference]: Finished difference Result 518 states and 1207 transitions. [2025-04-13 21:56:39,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:56:39,138 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:39,138 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:39,139 INFO L225 Difference]: With dead ends: 518 [2025-04-13 21:56:39,139 INFO L226 Difference]: Without dead ends: 467 [2025-04-13 21:56:39,140 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:56:39,140 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:39,140 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 21:56:39,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-04-13 21:56:39,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 395. [2025-04-13 21:56:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 393 states have (on average 2.427480916030534) internal successors, (954), 394 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have 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,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 954 transitions. [2025-04-13 21:56:39,249 INFO L79 Accepts]: Start accepts. Automaton has 395 states and 954 transitions. Word has length 19 [2025-04-13 21:56:39,249 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:39,249 INFO L485 AbstractCegarLoop]: Abstraction has 395 states and 954 transitions. [2025-04-13 21:56:39,249 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:39,249 INFO L278 IsEmpty]: Start isEmpty. Operand 395 states and 954 transitions. [2025-04-13 21:56:39,250 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:39,250 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:39,250 INFO L218 NwaCegarLoop]: trace histogram [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,250 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2025-04-13 21:56:39,250 INFO L403 AbstractCegarLoop]: === Iteration 113 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:39,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:39,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1203731257, now seen corresponding path program 26 times [2025-04-13 21:56:39,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:39,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756024707] [2025-04-13 21:56:39,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:56:39,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:39,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:56:39,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:39,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:56:39,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:40,996 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:56:40,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:40,997 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756024707] [2025-04-13 21:56:40,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756024707] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:40,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:40,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:56:40,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432659855] [2025-04-13 21:56:40,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:40,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:56:40,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:40,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:56:40,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:56:40,997 INFO L87 Difference]: Start difference. First operand 395 states and 954 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:42,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:42,795 INFO L93 Difference]: Finished difference Result 516 states and 1216 transitions. [2025-04-13 21:56:42,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:56:42,795 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:42,795 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:42,797 INFO L225 Difference]: With dead ends: 516 [2025-04-13 21:56:42,797 INFO L226 Difference]: Without dead ends: 467 [2025-04-13 21:56:42,797 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:56:42,797 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 98 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:42,797 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 0 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 21:56:42,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-04-13 21:56:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 395. [2025-04-13 21:56:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 393 states have (on average 2.4173027989821882) internal successors, (950), 394 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have 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:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 950 transitions. [2025-04-13 21:56:42,915 INFO L79 Accepts]: Start accepts. Automaton has 395 states and 950 transitions. Word has length 19 [2025-04-13 21:56:42,915 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:42,915 INFO L485 AbstractCegarLoop]: Abstraction has 395 states and 950 transitions. [2025-04-13 21:56:42,915 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:42,915 INFO L278 IsEmpty]: Start isEmpty. Operand 395 states and 950 transitions. [2025-04-13 21:56:42,916 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:42,916 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:42,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:42,916 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2025-04-13 21:56:42,916 INFO L403 AbstractCegarLoop]: === Iteration 114 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:42,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:42,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1333250743, now seen corresponding path program 26 times [2025-04-13 21:56:42,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:42,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623030695] [2025-04-13 21:56:42,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:56:42,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:42,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:56:42,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:42,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:56:42,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:46,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:56:46,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:46,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623030695] [2025-04-13 21:56:46,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623030695] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:46,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:46,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:56:46,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844487322] [2025-04-13 21:56:46,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:46,173 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:56:46,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:46,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:56:46,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:56:46,174 INFO L87 Difference]: Start difference. First operand 395 states and 950 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:48,482 INFO L93 Difference]: Finished difference Result 550 states and 1307 transitions. [2025-04-13 21:56:48,482 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:56:48,482 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:48,482 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:48,484 INFO L225 Difference]: With dead ends: 550 [2025-04-13 21:56:48,484 INFO L226 Difference]: Without dead ends: 501 [2025-04-13 21:56:48,484 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:56:48,485 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 99 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:48,485 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 0 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 21:56:48,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-04-13 21:56:48,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 399. [2025-04-13 21:56:48,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 397 states have (on average 2.4231738035264483) internal successors, (962), 398 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have 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:48,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 962 transitions. [2025-04-13 21:56:48,597 INFO L79 Accepts]: Start accepts. Automaton has 399 states and 962 transitions. Word has length 19 [2025-04-13 21:56:48,598 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:48,598 INFO L485 AbstractCegarLoop]: Abstraction has 399 states and 962 transitions. [2025-04-13 21:56:48,598 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:48,598 INFO L278 IsEmpty]: Start isEmpty. Operand 399 states and 962 transitions. [2025-04-13 21:56:48,598 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:48,598 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:48,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:48,598 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2025-04-13 21:56:48,598 INFO L403 AbstractCegarLoop]: === Iteration 115 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:48,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:48,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1186288595, now seen corresponding path program 29 times [2025-04-13 21:56:48,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:48,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609355691] [2025-04-13 21:56:48,599 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:56:48,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:48,622 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:56:48,649 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:48,649 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:56:48,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:50,136 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:56:50,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:50,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609355691] [2025-04-13 21:56:50,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609355691] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:50,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:50,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 21:56:50,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254164796] [2025-04-13 21:56:50,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:50,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:56:50,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:50,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:56:50,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:56:50,137 INFO L87 Difference]: Start difference. First operand 399 states and 962 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 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 516 states and 1216 transitions. [2025-04-13 21:56:51,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:56:51,513 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:51,513 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:51,515 INFO L225 Difference]: With dead ends: 516 [2025-04-13 21:56:51,515 INFO L226 Difference]: Without dead ends: 496 [2025-04-13 21:56:51,515 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2025-04-13 21:56:51,515 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:51,515 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:56:51,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-04-13 21:56:51,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 393. [2025-04-13 21:56:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 391 states have (on average 2.4066496163682864) internal successors, (941), 392 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have 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,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 941 transitions. [2025-04-13 21:56:51,628 INFO L79 Accepts]: Start accepts. Automaton has 393 states and 941 transitions. Word has length 19 [2025-04-13 21:56:51,628 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:51,628 INFO L485 AbstractCegarLoop]: Abstraction has 393 states and 941 transitions. [2025-04-13 21:56:51,628 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:51,628 INFO L278 IsEmpty]: Start isEmpty. Operand 393 states and 941 transitions. [2025-04-13 21:56:51,629 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:51,629 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:51,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:51,629 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2025-04-13 21:56:51,629 INFO L403 AbstractCegarLoop]: === Iteration 116 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:51,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:51,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1041626395, now seen corresponding path program 24 times [2025-04-13 21:56:51,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:51,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929388667] [2025-04-13 21:56:51,629 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:56:51,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:51,653 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:56:51,693 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:51,693 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:56:51,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:54,078 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:56:54,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:54,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929388667] [2025-04-13 21:56:54,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929388667] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:54,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:54,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 21:56:54,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665325343] [2025-04-13 21:56:54,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:54,079 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:56:54,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:54,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:56:54,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:56:54,079 INFO L87 Difference]: Start difference. First operand 393 states and 941 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:55,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:55,723 INFO L93 Difference]: Finished difference Result 562 states and 1351 transitions. [2025-04-13 21:56:55,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:56:55,724 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:55,724 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:55,726 INFO L225 Difference]: With dead ends: 562 [2025-04-13 21:56:55,726 INFO L226 Difference]: Without dead ends: 539 [2025-04-13 21:56:55,726 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:56:55,726 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 167 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:55,726 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 0 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 21:56:55,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-04-13 21:56:55,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 399. [2025-04-13 21:56:55,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 397 states have (on average 2.4130982367758187) internal successors, (958), 398 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have 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:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 958 transitions. [2025-04-13 21:56:55,845 INFO L79 Accepts]: Start accepts. Automaton has 399 states and 958 transitions. Word has length 19 [2025-04-13 21:56:55,845 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:55,845 INFO L485 AbstractCegarLoop]: Abstraction has 399 states and 958 transitions. [2025-04-13 21:56:55,845 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:55,845 INFO L278 IsEmpty]: Start isEmpty. Operand 399 states and 958 transitions. [2025-04-13 21:56:55,845 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:55,845 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:55,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:55,846 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2025-04-13 21:56:55,846 INFO L403 AbstractCegarLoop]: === Iteration 117 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:55,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:55,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1931391767, now seen corresponding path program 25 times [2025-04-13 21:56:55,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:55,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341782341] [2025-04-13 21:56:55,846 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:56:55,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:55,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:56:55,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:55,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:56:55,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:57,056 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:56:57,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:57,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341782341] [2025-04-13 21:56:57,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341782341] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:57,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:57,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:56:57,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056888857] [2025-04-13 21:56:57,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:57,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:56:57,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:57,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:56:57,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:56:57,057 INFO L87 Difference]: Start difference. First operand 399 states and 958 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:58,603 INFO L93 Difference]: Finished difference Result 538 states and 1285 transitions. [2025-04-13 21:56:58,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:56:58,603 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:56:58,603 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:58,605 INFO L225 Difference]: With dead ends: 538 [2025-04-13 21:56:58,605 INFO L226 Difference]: Without dead ends: 489 [2025-04-13 21:56:58,605 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:56:58,605 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:58,605 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 21:56:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-04-13 21:56:58,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 397. [2025-04-13 21:56:58,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 395 states have (on average 2.4075949367088607) internal successors, (951), 396 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have 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:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 951 transitions. [2025-04-13 21:56:58,730 INFO L79 Accepts]: Start accepts. Automaton has 397 states and 951 transitions. Word has length 19 [2025-04-13 21:56:58,730 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:58,730 INFO L485 AbstractCegarLoop]: Abstraction has 397 states and 951 transitions. [2025-04-13 21:56:58,730 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:56:58,730 INFO L278 IsEmpty]: Start isEmpty. Operand 397 states and 951 transitions. [2025-04-13 21:56:58,730 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:56:58,730 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:58,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:58,730 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2025-04-13 21:56:58,730 INFO L403 AbstractCegarLoop]: === Iteration 118 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:56:58,731 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:58,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1929269289, now seen corresponding path program 30 times [2025-04-13 21:56:58,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:58,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088428887] [2025-04-13 21:56:58,731 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:56:58,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:58,754 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:56:58,776 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:56:58,776 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:56:58,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:00,444 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:57:00,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:00,444 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088428887] [2025-04-13 21:57:00,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088428887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:00,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:00,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:57:00,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196976264] [2025-04-13 21:57:00,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:00,445 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:57:00,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:00,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:57:00,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:57:00,445 INFO L87 Difference]: Start difference. First operand 397 states and 951 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:01,556 INFO L93 Difference]: Finished difference Result 538 states and 1265 transitions. [2025-04-13 21:57:01,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 21:57:01,556 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:57:01,556 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:01,558 INFO L225 Difference]: With dead ends: 538 [2025-04-13 21:57:01,558 INFO L226 Difference]: Without dead ends: 489 [2025-04-13 21:57:01,558 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:57:01,558 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:01,558 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 0 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:57:01,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-04-13 21:57:01,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 399. [2025-04-13 21:57:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 397 states have (on average 2.4080604534005037) internal successors, (956), 398 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have 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:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 956 transitions. [2025-04-13 21:57:01,678 INFO L79 Accepts]: Start accepts. Automaton has 399 states and 956 transitions. Word has length 19 [2025-04-13 21:57:01,678 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:01,678 INFO L485 AbstractCegarLoop]: Abstraction has 399 states and 956 transitions. [2025-04-13 21:57:01,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:01,678 INFO L278 IsEmpty]: Start isEmpty. Operand 399 states and 956 transitions. [2025-04-13 21:57:01,679 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:57:01,679 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:01,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:01,679 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2025-04-13 21:57:01,679 INFO L403 AbstractCegarLoop]: === Iteration 119 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:57:01,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:01,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1525735267, now seen corresponding path program 27 times [2025-04-13 21:57:01,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:01,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231663879] [2025-04-13 21:57:01,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:57:01,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:01,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:57:01,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:57:01,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:57:01,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:03,866 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:57:03,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:03,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231663879] [2025-04-13 21:57:03,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231663879] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:03,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:03,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:57:03,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523267482] [2025-04-13 21:57:03,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:03,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:57:03,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:03,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:57:03,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:57:03,867 INFO L87 Difference]: Start difference. First operand 399 states and 956 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:05,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:05,850 INFO L93 Difference]: Finished difference Result 538 states and 1259 transitions. [2025-04-13 21:57:05,851 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:57:05,851 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:57:05,851 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:05,853 INFO L225 Difference]: With dead ends: 538 [2025-04-13 21:57:05,853 INFO L226 Difference]: Without dead ends: 511 [2025-04-13 21:57:05,853 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:57:05,853 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:05,854 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 21:57:05,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-04-13 21:57:05,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 391. [2025-04-13 21:57:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 389 states have (on average 2.4215938303341904) internal successors, (942), 390 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have 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:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 942 transitions. [2025-04-13 21:57:05,983 INFO L79 Accepts]: Start accepts. Automaton has 391 states and 942 transitions. Word has length 19 [2025-04-13 21:57:05,983 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:05,983 INFO L485 AbstractCegarLoop]: Abstraction has 391 states and 942 transitions. [2025-04-13 21:57:05,983 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:05,983 INFO L278 IsEmpty]: Start isEmpty. Operand 391 states and 942 transitions. [2025-04-13 21:57:05,983 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:57:05,983 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:05,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:05,983 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2025-04-13 21:57:05,983 INFO L403 AbstractCegarLoop]: === Iteration 120 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:57:05,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:05,984 INFO L85 PathProgramCache]: Analyzing trace with hash -271280483, now seen corresponding path program 27 times [2025-04-13 21:57:05,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:05,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446197711] [2025-04-13 21:57:05,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:57:05,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:06,007 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:57:06,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:57:06,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:57:06,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:07,209 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:57:07,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:07,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446197711] [2025-04-13 21:57:07,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446197711] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:07,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:07,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:57:07,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495552324] [2025-04-13 21:57:07,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:07,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:57:07,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:07,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:57:07,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:57:07,210 INFO L87 Difference]: Start difference. First operand 391 states and 942 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:09,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:09,379 INFO L93 Difference]: Finished difference Result 546 states and 1335 transitions. [2025-04-13 21:57:09,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 21:57:09,379 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:57:09,379 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:09,381 INFO L225 Difference]: With dead ends: 546 [2025-04-13 21:57:09,381 INFO L226 Difference]: Without dead ends: 497 [2025-04-13 21:57:09,381 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:57:09,382 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:09,382 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 21:57:09,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-04-13 21:57:09,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 389. [2025-04-13 21:57:09,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 387 states have (on average 2.4211886304909562) internal successors, (937), 388 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have 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:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 937 transitions. [2025-04-13 21:57:09,518 INFO L79 Accepts]: Start accepts. Automaton has 389 states and 937 transitions. Word has length 19 [2025-04-13 21:57:09,518 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:09,518 INFO L485 AbstractCegarLoop]: Abstraction has 389 states and 937 transitions. [2025-04-13 21:57:09,518 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:09,518 INFO L278 IsEmpty]: Start isEmpty. Operand 389 states and 937 transitions. [2025-04-13 21:57:09,518 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:57:09,518 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:09,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:09,519 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2025-04-13 21:57:09,519 INFO L403 AbstractCegarLoop]: === Iteration 121 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:57:09,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:09,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1390910413, now seen corresponding path program 26 times [2025-04-13 21:57:09,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:09,519 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639644144] [2025-04-13 21:57:09,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:57:09,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:09,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:57:09,570 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:57:09,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:57:09,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:11,041 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:57:11,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:11,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639644144] [2025-04-13 21:57:11,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639644144] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:11,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:11,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:57:11,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263896285] [2025-04-13 21:57:11,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:11,041 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:57:11,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:11,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:57:11,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:57:11,042 INFO L87 Difference]: Start difference. First operand 389 states and 937 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:12,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:12,707 INFO L93 Difference]: Finished difference Result 578 states and 1417 transitions. [2025-04-13 21:57:12,707 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:57:12,707 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:57:12,707 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:12,709 INFO L225 Difference]: With dead ends: 578 [2025-04-13 21:57:12,709 INFO L226 Difference]: Without dead ends: 529 [2025-04-13 21:57:12,709 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:57:12,710 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:12,710 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 21:57:12,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-04-13 21:57:12,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 399. [2025-04-13 21:57:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 397 states have (on average 2.438287153652393) internal successors, (968), 398 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have 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:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 968 transitions. [2025-04-13 21:57:12,845 INFO L79 Accepts]: Start accepts. Automaton has 399 states and 968 transitions. Word has length 19 [2025-04-13 21:57:12,845 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:12,845 INFO L485 AbstractCegarLoop]: Abstraction has 399 states and 968 transitions. [2025-04-13 21:57:12,845 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:12,845 INFO L278 IsEmpty]: Start isEmpty. Operand 399 states and 968 transitions. [2025-04-13 21:57:12,845 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:57:12,845 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:12,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:12,845 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2025-04-13 21:57:12,845 INFO L403 AbstractCegarLoop]: === Iteration 122 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:57:12,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:12,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1379291923, now seen corresponding path program 27 times [2025-04-13 21:57:12,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:12,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677456667] [2025-04-13 21:57:12,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:57:12,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:12,869 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:57:12,892 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:57:12,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:57:12,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:14,292 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:57:14,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:14,292 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677456667] [2025-04-13 21:57:14,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677456667] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:14,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:14,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:57:14,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986144102] [2025-04-13 21:57:14,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:14,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:57:14,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:14,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:57:14,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:57:14,293 INFO L87 Difference]: Start difference. First operand 399 states and 968 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:16,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:16,018 INFO L93 Difference]: Finished difference Result 598 states and 1453 transitions. [2025-04-13 21:57:16,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:57:16,018 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:57:16,019 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:16,020 INFO L225 Difference]: With dead ends: 598 [2025-04-13 21:57:16,020 INFO L226 Difference]: Without dead ends: 549 [2025-04-13 21:57:16,021 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:57:16,021 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:16,021 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:57:16,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-04-13 21:57:16,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 387. [2025-04-13 21:57:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 385 states have (on average 2.431168831168831) internal successors, (936), 386 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have 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,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 936 transitions. [2025-04-13 21:57:16,151 INFO L79 Accepts]: Start accepts. Automaton has 387 states and 936 transitions. Word has length 19 [2025-04-13 21:57:16,151 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:16,151 INFO L485 AbstractCegarLoop]: Abstraction has 387 states and 936 transitions. [2025-04-13 21:57:16,151 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:16,151 INFO L278 IsEmpty]: Start isEmpty. Operand 387 states and 936 transitions. [2025-04-13 21:57:16,151 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:57:16,151 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:16,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:16,151 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2025-04-13 21:57:16,151 INFO L403 AbstractCegarLoop]: === Iteration 123 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:57:16,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:16,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1688888505, now seen corresponding path program 28 times [2025-04-13 21:57:16,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:16,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271456477] [2025-04-13 21:57:16,152 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:57:16,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:16,175 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:57:16,195 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:57:16,195 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:57:16,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:16,891 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:57:16,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:16,892 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271456477] [2025-04-13 21:57:16,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271456477] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:16,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:16,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:57:16,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004678959] [2025-04-13 21:57:16,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:16,892 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:57:16,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:16,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:57:16,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:57:16,892 INFO L87 Difference]: Start difference. First operand 387 states and 936 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:18,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:18,088 INFO L93 Difference]: Finished difference Result 512 states and 1216 transitions. [2025-04-13 21:57:18,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:57:18,089 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:57:18,089 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:18,090 INFO L225 Difference]: With dead ends: 512 [2025-04-13 21:57:18,091 INFO L226 Difference]: Without dead ends: 463 [2025-04-13 21:57:18,091 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:57:18,091 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:18,091 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:57:18,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-04-13 21:57:18,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 377. [2025-04-13 21:57:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 375 states have (on average 2.3973333333333335) internal successors, (899), 376 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have 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,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 899 transitions. [2025-04-13 21:57:18,211 INFO L79 Accepts]: Start accepts. Automaton has 377 states and 899 transitions. Word has length 19 [2025-04-13 21:57:18,211 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:18,211 INFO L485 AbstractCegarLoop]: Abstraction has 377 states and 899 transitions. [2025-04-13 21:57:18,211 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:18,211 INFO L278 IsEmpty]: Start isEmpty. Operand 377 states and 899 transitions. [2025-04-13 21:57:18,211 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:57:18,211 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:18,211 INFO L218 NwaCegarLoop]: trace histogram [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,212 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2025-04-13 21:57:18,212 INFO L403 AbstractCegarLoop]: === Iteration 124 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:57:18,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:18,212 INFO L85 PathProgramCache]: Analyzing trace with hash 753778645, now seen corresponding path program 31 times [2025-04-13 21:57:18,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:18,212 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984420353] [2025-04-13 21:57:18,212 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:57:18,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:18,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:57:18,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:57:18,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:57:18,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:19,338 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:57:19,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:19,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984420353] [2025-04-13 21:57:19,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984420353] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:19,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:19,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:57:19,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881041189] [2025-04-13 21:57:19,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:19,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:57:19,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:19,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:57:19,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:57:19,339 INFO L87 Difference]: Start difference. First operand 377 states and 899 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:20,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:20,751 INFO L93 Difference]: Finished difference Result 452 states and 1034 transitions. [2025-04-13 21:57:20,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:57:20,751 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:57:20,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:20,753 INFO L225 Difference]: With dead ends: 452 [2025-04-13 21:57:20,753 INFO L226 Difference]: Without dead ends: 397 [2025-04-13 21:57:20,753 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:57:20,753 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:20,753 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:57:20,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-04-13 21:57:20,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 371. [2025-04-13 21:57:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 369 states have (on average 2.3902439024390243) internal successors, (882), 370 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have 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:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 882 transitions. [2025-04-13 21:57:20,878 INFO L79 Accepts]: Start accepts. Automaton has 371 states and 882 transitions. Word has length 19 [2025-04-13 21:57:20,878 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:20,878 INFO L485 AbstractCegarLoop]: Abstraction has 371 states and 882 transitions. [2025-04-13 21:57:20,878 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:20,879 INFO L278 IsEmpty]: Start isEmpty. Operand 371 states and 882 transitions. [2025-04-13 21:57:20,879 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:57:20,879 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:20,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:20,879 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2025-04-13 21:57:20,879 INFO L403 AbstractCegarLoop]: === Iteration 125 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:57:20,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:20,879 INFO L85 PathProgramCache]: Analyzing trace with hash 558165017, now seen corresponding path program 28 times [2025-04-13 21:57:20,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:20,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986978925] [2025-04-13 21:57:20,880 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:57:20,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:20,903 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:57:20,920 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:57:20,921 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:57:20,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:21,514 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:57:21,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:21,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986978925] [2025-04-13 21:57:21,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986978925] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:21,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:21,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 21:57:21,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066625638] [2025-04-13 21:57:21,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:21,515 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:57:21,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:21,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:57:21,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:57:21,515 INFO L87 Difference]: Start difference. First operand 371 states and 882 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:22,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:22,377 INFO L93 Difference]: Finished difference Result 469 states and 1058 transitions. [2025-04-13 21:57:22,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:57:22,377 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:57:22,377 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:22,379 INFO L225 Difference]: With dead ends: 469 [2025-04-13 21:57:22,379 INFO L226 Difference]: Without dead ends: 436 [2025-04-13 21:57:22,379 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:57:22,379 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:22,379 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 21:57:22,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-04-13 21:57:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 369. [2025-04-13 21:57:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 367 states have (on average 2.3896457765667574) internal successors, (877), 368 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have 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:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 877 transitions. [2025-04-13 21:57:22,506 INFO L79 Accepts]: Start accepts. Automaton has 369 states and 877 transitions. Word has length 19 [2025-04-13 21:57:22,506 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:22,506 INFO L485 AbstractCegarLoop]: Abstraction has 369 states and 877 transitions. [2025-04-13 21:57:22,506 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:22,506 INFO L278 IsEmpty]: Start isEmpty. Operand 369 states and 877 transitions. [2025-04-13 21:57:22,506 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:57:22,506 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:22,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:22,506 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2025-04-13 21:57:22,506 INFO L403 AbstractCegarLoop]: === Iteration 126 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:57:22,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:22,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2128487097, now seen corresponding path program 29 times [2025-04-13 21:57:22,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:22,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975607959] [2025-04-13 21:57:22,507 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:57:22,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:22,530 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:57:22,547 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:57:22,547 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:57:22,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:23,814 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:57:23,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:23,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975607959] [2025-04-13 21:57:23,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975607959] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:23,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:23,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:57:23,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794346465] [2025-04-13 21:57:23,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:23,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:57:23,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:23,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:57:23,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:57:23,815 INFO L87 Difference]: Start difference. First operand 369 states and 877 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:25,129 INFO L93 Difference]: Finished difference Result 453 states and 1028 transitions. [2025-04-13 21:57:25,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:57:25,129 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:57:25,129 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:25,131 INFO L225 Difference]: With dead ends: 453 [2025-04-13 21:57:25,131 INFO L226 Difference]: Without dead ends: 418 [2025-04-13 21:57:25,131 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:57:25,131 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:25,131 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 0 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 21:57:25,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-04-13 21:57:25,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 367. [2025-04-13 21:57:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 365 states have (on average 2.389041095890411) internal successors, (872), 366 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have 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,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 872 transitions. [2025-04-13 21:57:25,253 INFO L79 Accepts]: Start accepts. Automaton has 367 states and 872 transitions. Word has length 19 [2025-04-13 21:57:25,253 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:25,253 INFO L485 AbstractCegarLoop]: Abstraction has 367 states and 872 transitions. [2025-04-13 21:57:25,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:25,253 INFO L278 IsEmpty]: Start isEmpty. Operand 367 states and 872 transitions. [2025-04-13 21:57:25,253 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:57:25,253 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:25,253 INFO L218 NwaCegarLoop]: trace histogram [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,253 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2025-04-13 21:57:25,253 INFO L403 AbstractCegarLoop]: === Iteration 127 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:57:25,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:25,254 INFO L85 PathProgramCache]: Analyzing trace with hash 171585367, now seen corresponding path program 29 times [2025-04-13 21:57:25,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:25,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726495488] [2025-04-13 21:57:25,254 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:57:25,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:25,284 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:57:25,311 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:57:25,311 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:57:25,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:26,620 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:57:26,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:26,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726495488] [2025-04-13 21:57:26,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726495488] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:26,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:26,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:57:26,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727755809] [2025-04-13 21:57:26,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:26,621 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:57:26,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:26,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:57:26,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:57:26,621 INFO L87 Difference]: Start difference. First operand 367 states and 872 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:27,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:27,837 INFO L93 Difference]: Finished difference Result 438 states and 1003 transitions. [2025-04-13 21:57:27,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:57:27,837 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:57:27,837 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:27,839 INFO L225 Difference]: With dead ends: 438 [2025-04-13 21:57:27,839 INFO L226 Difference]: Without dead ends: 389 [2025-04-13 21:57:27,839 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:57:27,839 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:27,839 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:57:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-04-13 21:57:27,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 367. [2025-04-13 21:57:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 365 states have (on average 2.378082191780822) internal successors, (868), 366 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have 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:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 868 transitions. [2025-04-13 21:57:27,958 INFO L79 Accepts]: Start accepts. Automaton has 367 states and 868 transitions. Word has length 19 [2025-04-13 21:57:27,958 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:27,958 INFO L485 AbstractCegarLoop]: Abstraction has 367 states and 868 transitions. [2025-04-13 21:57:27,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:27,958 INFO L278 IsEmpty]: Start isEmpty. Operand 367 states and 868 transitions. [2025-04-13 21:57:27,959 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:57:27,959 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:27,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:27,959 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2025-04-13 21:57:27,959 INFO L403 AbstractCegarLoop]: === Iteration 128 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:57:27,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:27,959 INFO L85 PathProgramCache]: Analyzing trace with hash 159966877, now seen corresponding path program 30 times [2025-04-13 21:57:27,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:27,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116026585] [2025-04-13 21:57:27,959 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:57:27,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:27,982 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:57:28,013 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:57:28,013 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:57:28,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:29,039 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:57:29,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:29,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116026585] [2025-04-13 21:57:29,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116026585] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:29,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:29,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:57:29,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267839211] [2025-04-13 21:57:29,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:29,040 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:57:29,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:29,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:57:29,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:57:29,040 INFO L87 Difference]: Start difference. First operand 367 states and 868 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:30,347 INFO L93 Difference]: Finished difference Result 456 states and 1086 transitions. [2025-04-13 21:57:30,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:57:30,348 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:57:30,348 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:30,350 INFO L225 Difference]: With dead ends: 456 [2025-04-13 21:57:30,350 INFO L226 Difference]: Without dead ends: 433 [2025-04-13 21:57:30,350 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:57:30,350 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:30,350 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:57:30,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-04-13 21:57:30,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 381. [2025-04-13 21:57:30,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 379 states have (on average 2.4036939313984167) internal successors, (911), 380 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have 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,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 911 transitions. [2025-04-13 21:57:30,483 INFO L79 Accepts]: Start accepts. Automaton has 381 states and 911 transitions. Word has length 19 [2025-04-13 21:57:30,484 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:30,484 INFO L485 AbstractCegarLoop]: Abstraction has 381 states and 911 transitions. [2025-04-13 21:57:30,484 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:30,484 INFO L278 IsEmpty]: Start isEmpty. Operand 381 states and 911 transitions. [2025-04-13 21:57:30,484 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:57:30,484 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:30,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:30,484 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2025-04-13 21:57:30,484 INFO L403 AbstractCegarLoop]: === Iteration 129 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:57:30,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:30,485 INFO L85 PathProgramCache]: Analyzing trace with hash -172500683, now seen corresponding path program 31 times [2025-04-13 21:57:30,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:30,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782703665] [2025-04-13 21:57:30,485 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:57:30,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:30,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:57:30,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:57:30,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:57:30,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:31,763 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:57:31,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:31,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782703665] [2025-04-13 21:57:31,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782703665] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:31,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:31,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:57:31,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909215233] [2025-04-13 21:57:31,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:31,764 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:57:31,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:31,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:57:31,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:57:31,764 INFO L87 Difference]: Start difference. First operand 381 states and 911 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:37,875 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 21:57:41,883 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 21:57:42,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:42,303 INFO L93 Difference]: Finished difference Result 489 states and 1146 transitions. [2025-04-13 21:57:42,303 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 21:57:42,303 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:57:42,304 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:42,305 INFO L225 Difference]: With dead ends: 489 [2025-04-13 21:57:42,305 INFO L226 Difference]: Without dead ends: 466 [2025-04-13 21:57:42,306 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2025-04-13 21:57:42,306 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 174 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 30 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:42,306 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 0 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 946 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2025-04-13 21:57:42,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-04-13 21:57:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 369. [2025-04-13 21:57:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 367 states have (on average 2.3841961852861036) internal successors, (875), 368 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have 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:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 875 transitions. [2025-04-13 21:57:42,437 INFO L79 Accepts]: Start accepts. Automaton has 369 states and 875 transitions. Word has length 19 [2025-04-13 21:57:42,437 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:42,437 INFO L485 AbstractCegarLoop]: Abstraction has 369 states and 875 transitions. [2025-04-13 21:57:42,437 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:42,437 INFO L278 IsEmpty]: Start isEmpty. Operand 369 states and 875 transitions. [2025-04-13 21:57:42,437 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:57:42,437 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:42,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:42,438 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2025-04-13 21:57:42,438 INFO L403 AbstractCegarLoop]: === Iteration 130 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:57:42,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:42,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1235678033, now seen corresponding path program 32 times [2025-04-13 21:57:42,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:42,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517785653] [2025-04-13 21:57:42,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:57:42,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:42,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:57:42,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:57:42,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:57:42,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:43,727 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:57:43,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:43,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517785653] [2025-04-13 21:57:43,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517785653] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:43,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:43,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:57:43,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718479210] [2025-04-13 21:57:43,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:43,728 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:57:43,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:43,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:57:43,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:57:43,728 INFO L87 Difference]: Start difference. First operand 369 states and 875 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:45,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:45,299 INFO L93 Difference]: Finished difference Result 494 states and 1187 transitions. [2025-04-13 21:57:45,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:57:45,300 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:57:45,300 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:45,302 INFO L225 Difference]: With dead ends: 494 [2025-04-13 21:57:45,302 INFO L226 Difference]: Without dead ends: 471 [2025-04-13 21:57:45,302 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:57:45,302 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:45,302 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:57:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-04-13 21:57:45,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 379. [2025-04-13 21:57:45,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 377 states have (on average 2.4031830238726792) internal successors, (906), 378 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have 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:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 906 transitions. [2025-04-13 21:57:45,437 INFO L79 Accepts]: Start accepts. Automaton has 379 states and 906 transitions. Word has length 19 [2025-04-13 21:57:45,437 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:45,437 INFO L485 AbstractCegarLoop]: Abstraction has 379 states and 906 transitions. [2025-04-13 21:57:45,437 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:45,437 INFO L278 IsEmpty]: Start isEmpty. Operand 379 states and 906 transitions. [2025-04-13 21:57:45,438 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:57:45,438 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:45,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:45,438 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2025-04-13 21:57:45,438 INFO L403 AbstractCegarLoop]: === Iteration 131 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:57:45,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:45,438 INFO L85 PathProgramCache]: Analyzing trace with hash 903210473, now seen corresponding path program 33 times [2025-04-13 21:57:45,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:45,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610560394] [2025-04-13 21:57:45,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:57:45,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:45,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:57:45,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:57:45,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:57:45,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:46,627 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:57:46,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:46,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610560394] [2025-04-13 21:57:46,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610560394] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:46,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:46,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:57:46,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152439677] [2025-04-13 21:57:46,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:46,627 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:57:46,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:46,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:57:46,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:57:46,628 INFO L87 Difference]: Start difference. First operand 379 states and 906 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:49,015 INFO L93 Difference]: Finished difference Result 531 states and 1225 transitions. [2025-04-13 21:57:49,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 21:57:49,015 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:57:49,015 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:49,017 INFO L225 Difference]: With dead ends: 531 [2025-04-13 21:57:49,017 INFO L226 Difference]: Without dead ends: 508 [2025-04-13 21:57:49,017 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=206, Invalid=550, Unknown=0, NotChecked=0, Total=756 [2025-04-13 21:57:49,017 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 201 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:49,018 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 0 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 21:57:49,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-04-13 21:57:49,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 361. [2025-04-13 21:57:49,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 359 states have (on average 2.3983286908077996) internal successors, (861), 360 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have 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:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 861 transitions. [2025-04-13 21:57:49,147 INFO L79 Accepts]: Start accepts. Automaton has 361 states and 861 transitions. Word has length 19 [2025-04-13 21:57:49,147 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:49,147 INFO L485 AbstractCegarLoop]: Abstraction has 361 states and 861 transitions. [2025-04-13 21:57:49,147 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:49,147 INFO L278 IsEmpty]: Start isEmpty. Operand 361 states and 861 transitions. [2025-04-13 21:57:49,147 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:57:49,147 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:49,147 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:49,147 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2025-04-13 21:57:49,147 INFO L403 AbstractCegarLoop]: === Iteration 132 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:57:49,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:49,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1396636575, now seen corresponding path program 34 times [2025-04-13 21:57:49,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:49,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338297510] [2025-04-13 21:57:49,148 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:57:49,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:49,174 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:57:49,193 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:57:49,193 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:57:49,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:49,869 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:57:49,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:49,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338297510] [2025-04-13 21:57:49,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338297510] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:49,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:49,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 21:57:49,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183251864] [2025-04-13 21:57:49,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:49,869 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:57:49,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:49,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:57:49,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:57:49,870 INFO L87 Difference]: Start difference. First operand 361 states and 861 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:50,977 INFO L93 Difference]: Finished difference Result 462 states and 1107 transitions. [2025-04-13 21:57:50,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:57:50,977 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:57:50,977 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:50,979 INFO L225 Difference]: With dead ends: 462 [2025-04-13 21:57:50,979 INFO L226 Difference]: Without dead ends: 439 [2025-04-13 21:57:50,979 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:57:50,979 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:50,979 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 21:57:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-04-13 21:57:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 357. [2025-04-13 21:57:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 355 states have (on average 2.397183098591549) internal successors, (851), 356 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have 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:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 851 transitions. [2025-04-13 21:57:51,115 INFO L79 Accepts]: Start accepts. Automaton has 357 states and 851 transitions. Word has length 19 [2025-04-13 21:57:51,115 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:51,115 INFO L485 AbstractCegarLoop]: Abstraction has 357 states and 851 transitions. [2025-04-13 21:57:51,115 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:51,115 INFO L278 IsEmpty]: Start isEmpty. Operand 357 states and 851 transitions. [2025-04-13 21:57:51,116 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:57:51,116 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:51,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:57:51,116 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2025-04-13 21:57:51,116 INFO L403 AbstractCegarLoop]: === Iteration 133 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:57:51,116 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:51,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1431126043, now seen corresponding path program 35 times [2025-04-13 21:57:51,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:51,116 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743964824] [2025-04-13 21:57:51,116 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:57:51,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:51,139 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:57:51,164 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:57:51,164 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:57:51,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:52,648 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:57:52,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:52,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743964824] [2025-04-13 21:57:52,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743964824] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:52,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:52,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:57:52,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354908532] [2025-04-13 21:57:52,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:52,648 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:57:52,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:52,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:57:52,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:57:52,649 INFO L87 Difference]: Start difference. First operand 357 states and 851 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:54,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:54,476 INFO L93 Difference]: Finished difference Result 432 states and 1014 transitions. [2025-04-13 21:57:54,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:57:54,476 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:57:54,476 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:54,478 INFO L225 Difference]: With dead ends: 432 [2025-04-13 21:57:54,478 INFO L226 Difference]: Without dead ends: 409 [2025-04-13 21:57:54,478 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:57:54,479 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:54,479 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 21:57:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-04-13 21:57:54,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 343. [2025-04-13 21:57:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 341 states have (on average 2.3636363636363638) internal successors, (806), 342 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have 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,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 806 transitions. [2025-04-13 21:57:54,594 INFO L79 Accepts]: Start accepts. Automaton has 343 states and 806 transitions. Word has length 19 [2025-04-13 21:57:54,594 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:54,594 INFO L485 AbstractCegarLoop]: Abstraction has 343 states and 806 transitions. [2025-04-13 21:57:54,594 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:54,595 INFO L278 IsEmpty]: Start isEmpty. Operand 343 states and 806 transitions. [2025-04-13 21:57:54,595 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 21:57:54,595 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:54,595 INFO L218 NwaCegarLoop]: trace histogram [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:54,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2025-04-13 21:57:54,595 INFO L403 AbstractCegarLoop]: === Iteration 134 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:57:54,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:54,595 INFO L85 PathProgramCache]: Analyzing trace with hash 245653704, now seen corresponding path program 1 times [2025-04-13 21:57:54,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:54,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472997840] [2025-04-13 21:57:54,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:57:54,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:54,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 21:57:54,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:57:54,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:57:54,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:56,196 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:57:56,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:56,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472997840] [2025-04-13 21:57:56,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472997840] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:56,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:56,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:57:56,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506580178] [2025-04-13 21:57:56,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:56,196 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:57:56,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:56,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:57:56,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:57:56,197 INFO L87 Difference]: Start difference. First operand 343 states and 806 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:57,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:57:57,554 INFO L93 Difference]: Finished difference Result 412 states and 948 transitions. [2025-04-13 21:57:57,554 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:57:57,555 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 21:57:57,555 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:57:57,556 INFO L225 Difference]: With dead ends: 412 [2025-04-13 21:57:57,556 INFO L226 Difference]: Without dead ends: 402 [2025-04-13 21:57:57,557 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:57:57,557 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 97 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:57:57,557 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 14 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:57:57,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-04-13 21:57:57,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 353. [2025-04-13 21:57:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 351 states have (on average 2.339031339031339) internal successors, (821), 352 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have 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:57,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 821 transitions. [2025-04-13 21:57:57,683 INFO L79 Accepts]: Start accepts. Automaton has 353 states and 821 transitions. Word has length 20 [2025-04-13 21:57:57,683 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:57:57,683 INFO L485 AbstractCegarLoop]: Abstraction has 353 states and 821 transitions. [2025-04-13 21:57:57,683 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:57:57,683 INFO L278 IsEmpty]: Start isEmpty. Operand 353 states and 821 transitions. [2025-04-13 21:57:57,683 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 21:57:57,683 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:57:57,683 INFO L218 NwaCegarLoop]: trace histogram [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:57,684 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2025-04-13 21:57:57,684 INFO L403 AbstractCegarLoop]: === Iteration 135 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:57:57,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:57:57,684 INFO L85 PathProgramCache]: Analyzing trace with hash 246131724, now seen corresponding path program 2 times [2025-04-13 21:57:57,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:57:57,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270775077] [2025-04-13 21:57:57,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:57:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:57:57,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-13 21:57:57,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:57:57,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:57:57,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:57:59,155 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:57:59,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:57:59,155 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270775077] [2025-04-13 21:57:59,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270775077] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:57:59,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:57:59,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 21:57:59,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886893107] [2025-04-13 21:57:59,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:57:59,155 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:57:59,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:57:59,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:57:59,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:57:59,156 INFO L87 Difference]: Start difference. First operand 353 states and 821 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:00,699 INFO L93 Difference]: Finished difference Result 401 states and 898 transitions. [2025-04-13 21:58:00,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:58:00,699 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 21:58:00,699 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:00,701 INFO L225 Difference]: With dead ends: 401 [2025-04-13 21:58:00,701 INFO L226 Difference]: Without dead ends: 372 [2025-04-13 21:58:00,701 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:58:00,702 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 90 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:00,702 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 28 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 21:58:00,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-04-13 21:58:00,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 339. [2025-04-13 21:58:00,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 337 states have (on average 2.364985163204748) internal successors, (797), 338 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have 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:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 797 transitions. [2025-04-13 21:58:00,831 INFO L79 Accepts]: Start accepts. Automaton has 339 states and 797 transitions. Word has length 20 [2025-04-13 21:58:00,831 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:00,831 INFO L485 AbstractCegarLoop]: Abstraction has 339 states and 797 transitions. [2025-04-13 21:58:00,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:00,831 INFO L278 IsEmpty]: Start isEmpty. Operand 339 states and 797 transitions. [2025-04-13 21:58:00,831 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 21:58:00,831 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:00,831 INFO L218 NwaCegarLoop]: trace histogram [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:00,832 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2025-04-13 21:58:00,832 INFO L403 AbstractCegarLoop]: === Iteration 136 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:58:00,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:00,832 INFO L85 PathProgramCache]: Analyzing trace with hash 238602074, now seen corresponding path program 1 times [2025-04-13 21:58:00,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:00,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301503088] [2025-04-13 21:58:00,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:00,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:00,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 21:58:00,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:58:00,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:00,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:02,706 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:58:02,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:02,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301503088] [2025-04-13 21:58:02,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301503088] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:02,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:02,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:58:02,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186175696] [2025-04-13 21:58:02,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:02,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 21:58:02,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:02,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 21:58:02,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:58:02,707 INFO L87 Difference]: Start difference. First operand 339 states and 797 transitions. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:05,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:05,006 INFO L93 Difference]: Finished difference Result 445 states and 1036 transitions. [2025-04-13 21:58:05,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 21:58:05,006 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 21:58:05,006 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:05,008 INFO L225 Difference]: With dead ends: 445 [2025-04-13 21:58:05,008 INFO L226 Difference]: Without dead ends: 425 [2025-04-13 21:58:05,009 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2025-04-13 21:58:05,009 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 221 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:05,009 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 0 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 21:58:05,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-04-13 21:58:05,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 353. [2025-04-13 21:58:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 351 states have (on average 2.364672364672365) internal successors, (830), 352 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have 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:05,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 830 transitions. [2025-04-13 21:58:05,144 INFO L79 Accepts]: Start accepts. Automaton has 353 states and 830 transitions. Word has length 20 [2025-04-13 21:58:05,144 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:05,144 INFO L485 AbstractCegarLoop]: Abstraction has 353 states and 830 transitions. [2025-04-13 21:58:05,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:05,145 INFO L278 IsEmpty]: Start isEmpty. Operand 353 states and 830 transitions. [2025-04-13 21:58:05,145 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 21:58:05,145 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:05,145 INFO L218 NwaCegarLoop]: trace histogram [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:05,145 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2025-04-13 21:58:05,145 INFO L403 AbstractCegarLoop]: === Iteration 137 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:58:05,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:05,145 INFO L85 PathProgramCache]: Analyzing trace with hash 238140282, now seen corresponding path program 1 times [2025-04-13 21:58:05,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:05,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548661011] [2025-04-13 21:58:05,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:05,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:05,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 21:58:05,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:58:05,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:05,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:06,467 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:58:06,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:06,467 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548661011] [2025-04-13 21:58:06,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548661011] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:06,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:06,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 21:58:06,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425781117] [2025-04-13 21:58:06,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:06,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 21:58:06,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:06,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 21:58:06,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:58:06,468 INFO L87 Difference]: Start difference. First operand 353 states and 830 transitions. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:08,464 INFO L93 Difference]: Finished difference Result 437 states and 1017 transitions. [2025-04-13 21:58:08,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 21:58:08,464 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 21:58:08,464 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:08,466 INFO L225 Difference]: With dead ends: 437 [2025-04-13 21:58:08,466 INFO L226 Difference]: Without dead ends: 412 [2025-04-13 21:58:08,466 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=310, Invalid=1250, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 21:58:08,467 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 216 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:08,467 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 0 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 21:58:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-04-13 21:58:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 351. [2025-04-13 21:58:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 349 states have (on average 2.3638968481375358) internal successors, (825), 350 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have 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:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 825 transitions. [2025-04-13 21:58:08,601 INFO L79 Accepts]: Start accepts. Automaton has 351 states and 825 transitions. Word has length 20 [2025-04-13 21:58:08,601 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:08,601 INFO L485 AbstractCegarLoop]: Abstraction has 351 states and 825 transitions. [2025-04-13 21:58:08,601 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:08,601 INFO L278 IsEmpty]: Start isEmpty. Operand 351 states and 825 transitions. [2025-04-13 21:58:08,602 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 21:58:08,602 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:08,602 INFO L218 NwaCegarLoop]: trace histogram [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:08,602 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2025-04-13 21:58:08,602 INFO L403 AbstractCegarLoop]: === Iteration 138 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:58:08,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:08,602 INFO L85 PathProgramCache]: Analyzing trace with hash 750709364, now seen corresponding path program 2 times [2025-04-13 21:58:08,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:08,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329656273] [2025-04-13 21:58:08,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:58:08,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:08,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-13 21:58:08,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:58:08,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:58:08,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:09,897 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:58:09,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:09,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329656273] [2025-04-13 21:58:09,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329656273] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:09,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:09,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:58:09,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053523196] [2025-04-13 21:58:09,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:09,898 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 21:58:09,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:09,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 21:58:09,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:58:09,898 INFO L87 Difference]: Start difference. First operand 351 states and 825 transitions. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:12,780 INFO L93 Difference]: Finished difference Result 449 states and 1040 transitions. [2025-04-13 21:58:12,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 21:58:12,781 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 21:58:12,781 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:12,782 INFO L225 Difference]: With dead ends: 449 [2025-04-13 21:58:12,782 INFO L226 Difference]: Without dead ends: 429 [2025-04-13 21:58:12,783 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 21:58:12,783 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:12,783 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 0 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 21:58:12,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-04-13 21:58:12,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 353. [2025-04-13 21:58:12,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 351 states have (on average 2.358974358974359) internal successors, (828), 352 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have 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:12,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 828 transitions. [2025-04-13 21:58:12,925 INFO L79 Accepts]: Start accepts. Automaton has 353 states and 828 transitions. Word has length 20 [2025-04-13 21:58:12,925 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:12,925 INFO L485 AbstractCegarLoop]: Abstraction has 353 states and 828 transitions. [2025-04-13 21:58:12,925 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:12,925 INFO L278 IsEmpty]: Start isEmpty. Operand 353 states and 828 transitions. [2025-04-13 21:58:12,926 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 21:58:12,926 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:12,926 INFO L218 NwaCegarLoop]: trace histogram [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:12,926 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2025-04-13 21:58:12,926 INFO L403 AbstractCegarLoop]: === Iteration 139 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:58:12,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:12,926 INFO L85 PathProgramCache]: Analyzing trace with hash 748330780, now seen corresponding path program 3 times [2025-04-13 21:58:12,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:12,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861482748] [2025-04-13 21:58:12,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:58:12,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:12,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 1 equivalence classes. [2025-04-13 21:58:12,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:58:12,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:58:12,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:58:12,978 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:58:12,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 21:58:13,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:58:13,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:13,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:58:13,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:58:13,051 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:58:13,051 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 21:58:13,053 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 21:58:13,053 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 21:58:13,053 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-04-13 21:58:13,053 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-04-13 21:58:13,053 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 21:58:13,053 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2025-04-13 21:58:13,055 INFO L422 BasicCegarLoop]: Path program histogram: [35, 31, 29, 27, 4, 4, 3, 2, 1, 1, 1, 1] [2025-04-13 21:58:13,154 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:58:13,154 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:58:13,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:58:13 BasicIcfg [2025-04-13 21:58:13,156 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:58:13,156 INFO L158 Benchmark]: Toolchain (without parser) took 415656.02ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 87.6MB in the beginning and 627.3MB in the end (delta: -539.7MB). Peak memory consumption was 166.9MB. Max. memory is 8.0GB. [2025-04-13 21:58:13,156 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:58:13,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 4485.74ms. Allocated memory was 142.6MB in the beginning and 255.9MB in the end (delta: 113.2MB). Free memory was 87.6MB in the beginning and 157.7MB in the end (delta: -70.2MB). Peak memory consumption was 103.8MB. Max. memory is 8.0GB. [2025-04-13 21:58:13,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.81ms. Allocated memory is still 255.9MB. Free memory was 156.8MB in the beginning and 147.2MB in the end (delta: 9.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 21:58:13,159 INFO L158 Benchmark]: Boogie Preprocessor took 67.25ms. Allocated memory is still 255.9MB. Free memory was 147.2MB in the beginning and 141.0MB in the end (delta: 6.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:58:13,160 INFO L158 Benchmark]: IcfgBuilder took 1907.27ms. Allocated memory was 255.9MB in the beginning and 474.0MB in the end (delta: 218.1MB). Free memory was 141.0MB in the beginning and 335.6MB in the end (delta: -194.6MB). Peak memory consumption was 118.8MB. Max. memory is 8.0GB. [2025-04-13 21:58:13,160 INFO L158 Benchmark]: TraceAbstraction took 409071.34ms. Allocated memory was 474.0MB in the beginning and 847.2MB in the end (delta: 373.3MB). Free memory was 335.6MB in the beginning and 627.3MB in the end (delta: -291.7MB). Peak memory consumption was 83.7MB. Max. memory is 8.0GB. [2025-04-13 21:58:13,160 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.22ms. Allocated memory is still 159.4MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 4485.74ms. Allocated memory was 142.6MB in the beginning and 255.9MB in the end (delta: 113.2MB). Free memory was 87.6MB in the beginning and 157.7MB in the end (delta: -70.2MB). Peak memory consumption was 103.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 119.81ms. Allocated memory is still 255.9MB. Free memory was 156.8MB in the beginning and 147.2MB in the end (delta: 9.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 67.25ms. Allocated memory is still 255.9MB. Free memory was 147.2MB in the beginning and 141.0MB in the end (delta: 6.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 1907.27ms. Allocated memory was 255.9MB in the beginning and 474.0MB in the end (delta: 218.1MB). Free memory was 141.0MB in the beginning and 335.6MB in the end (delta: -194.6MB). Peak memory consumption was 118.8MB. Max. memory is 8.0GB. * TraceAbstraction took 409071.34ms. Allocated memory was 474.0MB in the beginning and 847.2MB in the end (delta: 373.3MB). Free memory was 335.6MB in the beginning and 627.3MB in the end (delta: -291.7MB). Peak memory consumption was 83.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 3228]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile ("" "xchg" "b %b0, %1\n" : "+q" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] - GenericResultAtLocation [Line: 3228]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile ("" "xchg" "w %w0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] - GenericResultAtLocation [Line: 3228]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile ("" "xchg" "l %0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] - GenericResultAtLocation [Line: 3228]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile ("" "xchg" "q %q0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] - GenericResultAtLocation [Line: 5817]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] * 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 - CounterExampleResult [Line: 175]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L247] 0 unsigned long jiffies; [L6522] 0 const unsigned int default_alloc_size = 4; [L6692] 0 static struct mutex nvram_mutex = { 1, 0 }; [L6692] 0 static struct mutex nvram_mutex = { 1, 0 }; [L6692] 0 static struct mutex nvram_mutex = { 1, 0 }; [L6693] 0 static ssize_t nvram_len; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6797-L6801] 0 static struct miscdevice nvram_dev = { 144, "nvram", &nvram_fops }; [L6797-L6801] 0 static struct miscdevice nvram_dev = { 144, "nvram", &nvram_fops }; [L6797-L6801] 0 static struct miscdevice nvram_dev = { 144, "nvram", &nvram_fops }; [L6797-L6801] 0 static struct miscdevice nvram_dev = { 144, "nvram", &nvram_fops }; [L6820] 0 int (* _whoop_init)(void) = nvram_init; [L6821] 0 void (* _whoop_exit)(void) = nvram_cleanup; [L6822] 0 struct inode *whoop_inode_0; [L6823] 0 struct file *whoop_file_0; [L6824] 0 struct inode *whoop_inode_1; [L6825] 0 struct file *whoop_file_1; [L6826] 0 struct inode *whoop_inode_2; [L6827] 0 struct file *whoop_file_2; [L6828] 0 struct inode *whoop_inode_3; [L6829] 0 struct file *whoop_file_3; [L6830] 0 struct inode *whoop_inode_4; [L6831] 0 struct file *whoop_file_4; [L6832] 0 struct pci_dev *whoop_pci_dev; [L6833] 0 char *whoop_buf; [L6834] 0 struct platform_device *whoop_platform_device; [L6835] 0 struct vm_area_struct *whoop_vm_area_struct; [L6836] 0 struct cx_dev *whoop_cx_dev; [L6837] 0 poll_table *whoop_poll_table; [L6838] 0 loff_t *whoop_loff_t; [L6839] 0 int whoop_int; [L6867] 0 whoop_inode_0 = (struct inode *) malloc(sizeof(struct inode)) [L6868] 0 whoop_file_0 = (struct file *) malloc(sizeof(struct file)) [L6869] 0 whoop_inode_1 = (struct inode *) malloc(sizeof(struct inode)) [L6870] 0 whoop_file_1 = (struct file *) malloc(sizeof(struct file)) [L6871] 0 whoop_inode_2 = (struct inode *) malloc(sizeof(struct inode)) [L6872] 0 whoop_file_2 = (struct file *) malloc(sizeof(struct file)) [L6873] 0 whoop_inode_3 = (struct inode *) malloc(sizeof(struct inode)) [L6874] 0 whoop_file_3 = (struct file *) malloc(sizeof(struct file)) [L6875] 0 whoop_inode_4 = (struct inode *) malloc(sizeof(struct inode)) [L6876] 0 whoop_file_4 = (struct file *) malloc(sizeof(struct file)) [L6877] 0 whoop_pci_dev = (struct pci_dev *) malloc(sizeof(struct pci_dev)) [L6878] 0 whoop_buf = (char *) malloc(sizeof(char)) [L6879] 0 whoop_platform_device = (struct platform_device *) malloc(sizeof(struct platform_device)) [L6880] 0 whoop_vm_area_struct = (struct vm_area_struct *) malloc(sizeof(struct vm_area_struct)) [L6881] 0 whoop_cx_dev = (struct cx_dev *) malloc(sizeof(struct cx_dev)) [L6882] 0 whoop_poll_table = (poll_table *) malloc(sizeof(poll_table)) [L6883] 0 whoop_loff_t = (loff_t *) malloc(sizeof(loff_t)) [L6884] 0 *whoop_loff_t = __VERIFIER_nondet_longlong() [L6885] 0 whoop_int = __VERIFIER_nondet_int() [L6886] CALL 0 assume_abort_if_not(whoop_int >= 0) [L171] COND FALSE 0 !(!cond) [L6886] RET 0 assume_abort_if_not(whoop_int >= 0) [L6887] CALL, EXPR 0 _whoop_init() [L6804] 0 int ret = 0; [L6805-L6806] CALL 0 printk("\001" "6" "Generic non-volatile memory driver v%s\n", "1.1") [L6650] 0 return __VERIFIER_nondet_int(); [L6805-L6806] RET 0 printk("\001" "6" "Generic non-volatile memory driver v%s\n", "1.1") [L6807] CALL, EXPR 0 misc_register(&nvram_dev) [L6624] 0 return __VERIFIER_nondet_int(); [L6807] RET, EXPR 0 misc_register(&nvram_dev) [L6807] 0 ret = misc_register(&nvram_dev) [L6808] COND FALSE 0 !(ret != 0) [L6810] CALL, EXPR 0 nvram_get_size() [L6632] 0 return __VERIFIER_nondet_long(); [L6810] RET, EXPR 0 nvram_get_size() [L6810] 0 nvram_len = nvram_get_size() [L6811] COND FALSE 0 !(nvram_len < 0) [L6814] 0 return ret; [L6887] RET, EXPR 0 _whoop_init() [L6887] 0 int _whoop_init_result = _whoop_init(); [L6888] 0 pthread_t pthread_t_write_nvram; [L6889] 0 pthread_t pthread_t_read_nvram; [L6890] FCALL, FORK 0 pthread_create(&pthread_t_write_nvram, ((void *)0), whoop_wrapper_write_nvram, ((void *)0)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, _whoop_init_result=0, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=2147483647, nvram_mutex={7:0}, pthread_t_write_nvram=0, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] [L6842] CALL 1 write_nvram(whoop_file_0, whoop_buf, whoop_int, whoop_loff_t) [L6744] 1 unsigned int i; [L6745] 1 const char *p = buf; [L6746] 1 char c = __VERIFIER_nondet_char(); [L6747] CALL, EXPR 1 access_ok(0, buf, count) [L6551] 1 return __VERIFIER_nondet_int(); [L6747] RET, EXPR 1 access_ok(0, buf, count) [L6747] COND FALSE 1 !(!access_ok(0, buf, count)) [L6750] EXPR 1 \read(*ppos) [L6750] 1 ssize_t lppos = *ppos; [L6752] COND FALSE 1 !(lppos >= nvram_len) VAL [\at(buf, Pre)={-9:0}, \at(count, Pre)=2, \at(file, Pre)={-10:0}, \at(ppos, Pre)={-6:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-9:0}, c=0, count=2, default_alloc_size=4, file={-10:0}, jiffies=0, lppos=2147483643, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=2147483647, nvram_mutex={7:0}, p={-9:0}, ppos={-6:0}, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] [L6755] EXPR 1 \read(*ppos) [L6755] 1 lppos = *ppos [L6757] 1 i = lppos [L6757] COND TRUE 1 count > 0 && i < nvram_len [L6758] CALL 1 __get_user(c, p) [L6535] 1 return __VERIFIER_nondet_int(); [L6758] RET 1 __get_user(c, p) [L6758] COND FALSE 1 !(__get_user(c, p)) [L6760] FCALL 1 nvram_write_byte(c, i) [L6757] 1 ++i [L6757] 1 ++p [L6757] 1 --count VAL [\at(buf, Pre)={-9:0}, \at(count, Pre)=2, \at(file, Pre)={-10:0}, \at(ppos, Pre)={-6:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-9:0}, c=0, count=1, default_alloc_size=4, file={-10:0}, i=2147483644, jiffies=0, lppos=2147483643, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=2147483647, nvram_mutex={7:0}, p={-9:1}, ppos={-6:0}, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] [L6757] COND TRUE 1 count > 0 && i < nvram_len [L6758] CALL 1 __get_user(c, p) [L6535] 1 return __VERIFIER_nondet_int(); [L6758] RET 1 __get_user(c, p) [L6758] COND FALSE 1 !(__get_user(c, p)) [L6760] FCALL 1 nvram_write_byte(c, i) [L6757] 1 ++i [L6757] 1 ++p [L6757] 1 --count [L6757] COND FALSE 1 !(count > 0 && i < nvram_len) VAL [\at(buf, Pre)={-9:0}, \at(count, Pre)=2, \at(file, Pre)={-10:0}, \at(ppos, Pre)={-6:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-9:0}, c=0, count=0, default_alloc_size=4, file={-10:0}, i=2147483645, jiffies=0, lppos=2147483643, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=2147483647, nvram_mutex={7:0}, p={-9:2}, ppos={-6:0}, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] [L6891] FCALL, FORK 0 pthread_create(&pthread_t_read_nvram, ((void *)0), whoop_wrapper_read_nvram, ((void *)0)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, _whoop_init_result=0, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=2147483647, nvram_mutex={7:0}, pthread_t_read_nvram=1, pthread_t_write_nvram=0, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] [L6847] CALL 2 read_nvram(whoop_file_1, whoop_buf, whoop_int, whoop_loff_t) [L6717] 2 unsigned int i; [L6718] 2 char *p = buf; [L6719] CALL, EXPR 2 access_ok(1, buf, count) [L6551] 2 return __VERIFIER_nondet_int(); [L6719] RET, EXPR 2 access_ok(1, buf, count) [L6719] COND FALSE 2 !(!access_ok(1, buf, count)) [L6722] EXPR 2 \read(*ppos) [L6722] 2 ssize_t lppos = *ppos; [L6724] COND FALSE 2 !(lppos >= nvram_len) VAL [\at(buf, Pre)={-9:0}, \at(count, Pre)=2, \at(file, Pre)={-13:0}, \at(ppos, Pre)={-6:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-9:0}, count=2, default_alloc_size=4, file={-13:0}, jiffies=0, lppos=2147483643, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=2147483647, nvram_mutex={7:0}, p={-9:0}, ppos={-6:0}, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] [L6763] 1 *ppos = i VAL [\at(args, Pre)={0:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, args={0:0}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=2147483647, nvram_mutex={7:0}, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] [L6727] EXPR 2 \read(*ppos) [L6727] 2 lppos = *ppos [L6729] 2 i = lppos [L6729] COND TRUE 2 count > 0 && i < nvram_len [L6730] CALL, EXPR 2 nvram_read_byte(i) [L6636] 2 return __VERIFIER_nondet_uchar(); [L6730] RET, EXPR 2 nvram_read_byte(i) [L6730] CALL 2 __put_user(nvram_read_byte(i), p) [L6543] 2 return __VERIFIER_nondet_int(); [L6730] RET 2 __put_user(nvram_read_byte(i), p) [L6730] COND FALSE 2 !(__put_user(nvram_read_byte(i), p)) [L6729] 2 ++i [L6729] 2 ++p [L6729] 2 --count VAL [\at(buf, Pre)={-9:0}, \at(count, Pre)=2, \at(file, Pre)={-13:0}, \at(ppos, Pre)={-6:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-9:0}, count=1, default_alloc_size=4, file={-13:0}, i=2147483646, jiffies=0, lppos=2147483645, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=2147483647, nvram_mutex={7:0}, p={-9:1}, ppos={-6:0}, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] [L6729] COND TRUE 2 count > 0 && i < nvram_len [L6730] CALL, EXPR 2 nvram_read_byte(i) [L6636] 2 return __VERIFIER_nondet_uchar(); [L6730] RET, EXPR 2 nvram_read_byte(i) [L6730] CALL 2 __put_user(nvram_read_byte(i), p) [L6543] 2 return __VERIFIER_nondet_int(); [L6730] RET 2 __put_user(nvram_read_byte(i), p) [L6730] COND FALSE 2 !(__put_user(nvram_read_byte(i), p)) [L6729] 2 ++i [L6729] 2 ++p [L6729] 2 --count [L6729] COND FALSE 2 !(count > 0 && i < nvram_len) VAL [\at(buf, Pre)={-9:0}, \at(count, Pre)=2, \at(file, Pre)={-13:0}, \at(ppos, Pre)={-6:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-9:0}, count=0, default_alloc_size=4, file={-13:0}, i=2147483647, jiffies=0, lppos=2147483645, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=2147483647, nvram_mutex={7:0}, p={-9:2}, ppos={-6:0}, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] [L6733] 2 *ppos = i VAL [\at(args, Pre)={0:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, args={0:0}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=2147483647, nvram_mutex={7:0}, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] [L6766] EXPR 1 \read(*ppos) [L6766] 1 lppos = *ppos [L6768] CALL 1 __VERIFIER_assert(lppos == i) [L174] COND TRUE 1 !(cond) [L175] 1 reach_error() VAL [\at(cond, Pre)=0, _whoop_exit={-1:5}, _whoop_init={-1:4}, cond=0, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=2147483647, nvram_mutex={7:0}, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] - UnprovableResult [Line: 175]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6891]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 6890]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 78 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 408.8s, OverallIterations: 139, TraceHistogramMax: 1, PathProgramHistogramMax: 35, EmptinessCheckTime: 0.1s, AutomataDifference: 201.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 15061 SdHoareTripleChecker+Valid, 114.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15061 mSDsluCounter, 280 SdHoareTripleChecker+Invalid, 104.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 209 mSDsCounter, 2813 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 90203 IncrementalHoareTripleChecker+Invalid, 93018 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2813 mSolverCounterUnsat, 71 mSDtfsCounter, 90203 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2806 GetRequests, 301 SyntacticMatches, 25 SemanticMatches, 2480 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5704 ImplicationChecksByTransitivity, 94.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=521occurred in iteration=89, InterpolantAutomatonStates: 1633, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.8s AutomataMinimizationTime, 138 MinimizatonAttempts, 16048 StatesRemovedByMinimization, 137 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 188.0s InterpolantComputationTime, 2615 NumberOfCodeBlocks, 2615 NumberOfCodeBlocksAsserted, 161 NumberOfCheckSat, 2457 ConstructedInterpolants, 0 QuantifiedInterpolants, 133373 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 138 InterpolantComputations, 138 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 21:58:13,364 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-13 21:58:13,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...