/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf -i ../../../trunk/examples/svcomp/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 11:34:16,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 11:34:16,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 11:34:16,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 11:34:16,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 11:34:16,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 11:34:16,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 11:34:16,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 11:34:16,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 11:34:16,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 11:34:16,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 11:34:16,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 11:34:16,962 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 11:34:16,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 11:34:16,962 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 11:34:16,962 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 11:34:16,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 11:34:16,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 11:34:16,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 11:34:16,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 11:34:16,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 11:34:16,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 11:34:16,962 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 11:34:16,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 11:34:16,962 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 11:34:16,962 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 11:34:16,962 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 11:34:16,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 11:34:16,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 11:34:16,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 11:34:16,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 11:34:16,963 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 11:34:16,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 11:34:16,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 11:34:16,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 11:34:16,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 11:34:16,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 11:34:16,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 11:34:16,963 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 11:34:16,963 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 11:34:16,963 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 11:34:16,963 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 11:34:16,963 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 11:34:16,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 11:34:16,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 11:34:16,965 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 11:34:16,965 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 11:34:16,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 11:34:17,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 11:34:17,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 11:34:17,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 11:34:17,185 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 11:34:17,185 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 11:34:17,187 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-14 11:34:18,512 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6d974e22/d3a35405c4fd40ab8d49d5eca2a97413/FLAGb7a8e01d9 [2025-04-14 11:34:18,910 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 11:34:18,910 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i [2025-04-14 11:34:18,946 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6d974e22/d3a35405c4fd40ab8d49d5eca2a97413/FLAGb7a8e01d9 [2025-04-14 11:34:19,653 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6d974e22/d3a35405c4fd40ab8d49d5eca2a97413 [2025-04-14 11:34:19,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 11:34:19,656 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 11:34:19,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 11:34:19,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 11:34:19,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 11:34:19,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:34:19" (1/1) ... [2025-04-14 11:34:19,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bdf5679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:34:19, skipping insertion in model container [2025-04-14 11:34:19,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:34:19" (1/1) ... [2025-04-14 11:34:19,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 11:34:20,059 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i[5520,5533] [2025-04-14 11:34:24,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 11:34:24,041 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 11:34:24,068 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-14 11:34:24,140 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-14 11:34:24,141 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-14 11:34:24,141 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-14 11:34:24,141 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-14 11:34:24,203 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] [2025-04-14 11:34:24,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 11:34:24,537 INFO L204 MainTranslator]: Completed translation [2025-04-14 11:34:24,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:34:24 WrapperNode [2025-04-14 11:34:24,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 11:34:24,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 11:34:24,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 11:34:24,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 11:34:24,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:34:24" (1/1) ... [2025-04-14 11:34:24,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:34:24" (1/1) ... [2025-04-14 11:34:24,647 INFO L138 Inliner]: procedures = 1352, calls = 1469, calls flagged for inlining = 352, calls inlined = 18, statements flattened = 394 [2025-04-14 11:34:24,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 11:34:24,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 11:34:24,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 11:34:24,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 11:34:24,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:34:24" (1/1) ... [2025-04-14 11:34:24,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:34:24" (1/1) ... [2025-04-14 11:34:24,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:34:24" (1/1) ... [2025-04-14 11:34:24,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:34:24" (1/1) ... [2025-04-14 11:34:24,685 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:34:24" (1/1) ... [2025-04-14 11:34:24,686 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:34:24" (1/1) ... [2025-04-14 11:34:24,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:34:24" (1/1) ... [2025-04-14 11:34:24,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:34:24" (1/1) ... [2025-04-14 11:34:24,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:34:24" (1/1) ... [2025-04-14 11:34:24,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 11:34:24,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-14 11:34:24,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-14 11:34:24,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-14 11:34:24,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:34:24" (1/1) ... [2025-04-14 11:34:24,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 11:34:24,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 11:34:24,733 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-14 11:34:24,735 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-14 11:34:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-14 11:34:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 11:34:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 11:34:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 11:34:24,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 11:34:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-14 11:34:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_read_nvram [2025-04-14 11:34:24,753 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_read_nvram [2025-04-14 11:34:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 11:34:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 11:34:24,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-14 11:34:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_write_nvram [2025-04-14 11:34:24,754 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_write_nvram [2025-04-14 11:34:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 11:34:24,755 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 11:34:25,084 INFO L234 CfgBuilder]: Building ICFG [2025-04-14 11:34:25,086 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 11:34:25,431 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 11:34:25,431 INFO L283 CfgBuilder]: Performing block encoding [2025-04-14 11:34:25,862 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 11:34:25,864 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 11:34:25,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:34:25 BoogieIcfgContainer [2025-04-14 11:34:25,865 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-14 11:34:25,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 11:34:25,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 11:34:25,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 11:34:25,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 11:34:19" (1/3) ... [2025-04-14 11:34:25,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67799eb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:34:25, skipping insertion in model container [2025-04-14 11:34:25,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:34:24" (2/3) ... [2025-04-14 11:34:25,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67799eb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:34:25, skipping insertion in model container [2025-04-14 11:34:25,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:34:25" (3/3) ... [2025-04-14 11:34:25,872 INFO L128 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_read_nvram_write_nvram.i [2025-04-14 11:34:25,883 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 11:34:25,887 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG char_generic_nvram_read_nvram_write_nvram.i that has 3 procedures, 43 locations, 50 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-14 11:34:25,887 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 11:34:25,948 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 11:34:25,974 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 11:34:25,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 11:34:25,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 11:34:25,976 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-14 11:34:26,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-14 11:34:26,174 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 11:34:26,189 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 11:34:26,194 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=PARTIAL_ORDER_FA, 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;@27528ec7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 11:34:26,194 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-14 11:34:26,493 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-14 11:34:26,494 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-14 11:34:26,498 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-14 11:34:26,502 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE (1/3) [2025-04-14 11:34:26,505 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 11:34:26,506 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 11:34:26,507 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == whoop_wrapper_write_nvramThread1of1ForFork1 ======== [2025-04-14 11:34:26,507 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=PARTIAL_ORDER_FA, 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;@27528ec7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 11:34:26,507 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 11:34:26,711 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 11:34:26,711 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 11:34:26,711 INFO L139 ounterexampleChecker]: Examining path program with hash 307159833, occurence #1 [2025-04-14 11:34:26,711 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 11:34:26,711 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 11:34:26,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 11:34:26,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2039993743, now seen corresponding path program 1 times [2025-04-14 11:34:26,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 11:34:26,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607005829] [2025-04-14 11:34:26,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 11:34:26,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 11:34:26,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 11:34:26,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 11:34:26,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 11:34:26,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 11:34:28,595 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-14 11:34:28,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 11:34:28,596 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607005829] [2025-04-14 11:34:28,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607005829] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 11:34:28,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 11:34:28,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 11:34:28,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491938984] [2025-04-14 11:34:28,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 11:34:28,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 11:34:28,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 11:34:28,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 11:34:28,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-14 11:34:28,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:34:28,619 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 11:34:28,621 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 11:34:28,621 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:34:29,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 11:34:29,100 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 11:34:29,100 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 11:34:29,100 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 11:34:29,100 INFO L139 ounterexampleChecker]: Examining path program with hash -1663544800, occurence #1 [2025-04-14 11:34:29,100 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 11:34:29,100 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 11:34:29,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 11:34:29,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1161423089, now seen corresponding path program 1 times [2025-04-14 11:34:29,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 11:34:29,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91282919] [2025-04-14 11:34:29,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 11:34:29,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 11:34:29,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 11:34:29,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 11:34:29,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 11:34:29,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 11:34:31,522 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-14 11:34:31,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 11:34:31,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91282919] [2025-04-14 11:34:31,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91282919] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 11:34:31,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 11:34:31,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-14 11:34:31,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326929916] [2025-04-14 11:34:31,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 11:34:31,523 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 11:34:31,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 11:34:31,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 11:34:31,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-14 11:34:31,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:34:31,524 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 11:34:31,524 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 11:34:31,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 11:34:31,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:34:32,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 11:34:32,267 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 11:34:32,267 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 11:34:32,267 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 11:34:32,267 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 11:34:32,268 INFO L139 ounterexampleChecker]: Examining path program with hash -270718161, occurence #1 [2025-04-14 11:34:32,268 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 11:34:32,268 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 11:34:32,268 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 11:34:32,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1298928627, now seen corresponding path program 1 times [2025-04-14 11:34:32,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 11:34:32,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343520419] [2025-04-14 11:34:32,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 11:34:32,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 11:34:32,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 11:34:32,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 11:34:32,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 11:34:32,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 11:34:34,026 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-14 11:34:34,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 11:34:34,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343520419] [2025-04-14 11:34:34,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343520419] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 11:34:34,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 11:34:34,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-14 11:34:34,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271379041] [2025-04-14 11:34:34,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 11:34:34,027 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 11:34:34,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 11:34:34,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 11:34:34,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-14 11:34:34,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:34:34,027 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 11:34:34,028 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 11:34:34,028 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 11:34:34,028 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-14 11:34:34,028 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:34:35,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 11:34:35,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 11:34:35,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 11:34:35,526 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 11:34:35,527 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 11:34:35,527 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 11:34:35,527 INFO L139 ounterexampleChecker]: Examining path program with hash -1990678365, occurence #1 [2025-04-14 11:34:35,527 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 11:34:35,527 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 11:34:35,527 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 11:34:35,527 INFO L85 PathProgramCache]: Analyzing trace with hash -220306669, now seen corresponding path program 1 times [2025-04-14 11:34:35,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 11:34:35,527 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037416742] [2025-04-14 11:34:35,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 11:34:35,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 11:34:35,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 11:34:35,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 11:34:35,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 11:34:35,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 11:34:37,113 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-14 11:34:37,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 11:34:37,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037416742] [2025-04-14 11:34:37,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037416742] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 11:34:37,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 11:34:37,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-14 11:34:37,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426058005] [2025-04-14 11:34:37,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 11:34:37,114 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 11:34:37,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 11:34:37,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 11:34:37,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-14 11:34:37,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:34:37,115 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 11:34:37,115 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 11:34:37,115 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 11:34:37,116 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 11:34:37,116 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-14 11:34:37,116 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:34:38,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 11:34:38,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 11:34:38,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 11:34:38,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 11:34:38,340 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 11:34:38,340 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 11:34:38,340 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 11:34:38,340 INFO L139 ounterexampleChecker]: Examining path program with hash -1939157023, occurence #1 [2025-04-14 11:34:38,340 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 11:34:38,340 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 11:34:38,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 11:34:38,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2100382762, now seen corresponding path program 1 times [2025-04-14 11:34:38,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 11:34:38,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641692195] [2025-04-14 11:34:38,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 11:34:38,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 11:34:38,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 11:34:38,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 11:34:38,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 11:34:38,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 11:34:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 11:34:42,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 11:34:42,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641692195] [2025-04-14 11:34:42,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641692195] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 11:34:42,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185393357] [2025-04-14 11:34:42,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 11:34:42,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 11:34:42,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 11:34:42,650 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 11:34:42,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 11:34:42,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 11:34:42,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 11:34:42,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 11:34:42,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 11:34:42,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-14 11:34:42,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 11:34:42,964 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 11:34:43,279 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 51 [2025-04-14 11:34:43,611 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 11:34:43,725 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 67 [2025-04-14 11:34:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 11:34:43,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 11:34:44,059 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-04-14 11:34:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 11:34:52,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185393357] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 11:34:52,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 11:34:52,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [20, 13] total 40 [2025-04-14 11:34:52,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986309405] [2025-04-14 11:34:52,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 11:34:52,519 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 11:34:52,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 11:34:52,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 11:34:52,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1450, Unknown=0, NotChecked=0, Total=1560 [2025-04-14 11:34:52,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:34:52,520 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 11:34:52,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 11:34:52,520 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 11:34:52,520 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 11:34:52,520 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-14 11:34:52,520 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 11:34:52,520 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:34:53,656 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 11:34:53,657 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 11:34:53,657 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 11:34:53,657 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 11:34:53,657 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 11:34:53,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 11:34:53,858 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 11:34:53,858 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 11:34:53,858 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 11:34:53,858 INFO L139 ounterexampleChecker]: Examining path program with hash -546330384, occurence #1 [2025-04-14 11:34:53,858 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 11:34:53,858 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 11:34:53,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 11:34:53,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2029631896, now seen corresponding path program 2 times [2025-04-14 11:34:53,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 11:34:53,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727143019] [2025-04-14 11:34:53,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 11:34:53,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 11:34:53,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 11:34:53,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 11:34:53,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 11:34:53,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 11:34:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 11:34:56,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 11:34:56,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727143019] [2025-04-14 11:34:56,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727143019] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 11:34:56,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016603497] [2025-04-14 11:34:56,748 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 11:34:56,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 11:34:56,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 11:34:56,750 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 11:34:56,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 11:34:56,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 11:34:57,023 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 11:34:57,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 11:34:57,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 11:34:57,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-14 11:34:57,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 11:34:57,299 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 51 [2025-04-14 11:34:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 11:34:57,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 11:34:58,151 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 11:34:58,152 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 66 [2025-04-14 11:34:58,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 11:34:58,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016603497] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 11:34:58,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 11:34:58,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 34 [2025-04-14 11:34:58,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530007655] [2025-04-14 11:34:58,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 11:34:58,272 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 11:34:58,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 11:34:58,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 11:34:58,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1035, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 11:34:58,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:34:58,273 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 11:34:58,273 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 34 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 11:34:58,273 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 11:34:58,273 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 11:34:58,273 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-14 11:34:58,273 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 11:34:58,273 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-14 11:34:58,273 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:35:03,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 11:35:03,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 11:35:03,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 11:35:03,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 11:35:03,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 11:35:03,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-14 11:35:03,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 11:35:03,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 11:35:03,972 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 11:35:03,972 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 11:35:03,972 INFO L139 ounterexampleChecker]: Examining path program with hash -457469400, occurence #1 [2025-04-14 11:35:03,972 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 11:35:03,972 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 11:35:03,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 11:35:03,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1373196744, now seen corresponding path program 1 times [2025-04-14 11:35:03,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 11:35:03,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333129814] [2025-04-14 11:35:03,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 11:35:03,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 11:35:04,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 11:35:04,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 11:35:04,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 11:35:04,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 11:35:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 11:35:06,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 11:35:06,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333129814] [2025-04-14 11:35:06,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333129814] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 11:35:06,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672119148] [2025-04-14 11:35:06,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 11:35:06,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 11:35:06,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 11:35:06,430 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 11:35:06,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 11:35:06,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 11:35:06,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 11:35:06,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 11:35:06,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 11:35:06,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-14 11:35:06,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 11:35:06,669 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 11:35:06,899 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 51 [2025-04-14 11:35:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 11:35:07,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 11:35:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 11:35:07,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672119148] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 11:35:07,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 11:35:07,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 36 [2025-04-14 11:35:07,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576417670] [2025-04-14 11:35:07,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 11:35:07,959 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-14 11:35:07,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 11:35:07,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-14 11:35:07,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1169, Unknown=0, NotChecked=0, Total=1260 [2025-04-14 11:35:07,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:35:07,960 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 11:35:07,960 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.25) internal successors, (81), 36 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 11:35:07,960 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 11:35:07,961 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 11:35:07,961 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-14 11:35:07,961 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 11:35:07,961 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2025-04-14 11:35:07,961 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-04-14 11:35:07,961 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:35:17,630 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 11:35:22,820 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 11:35:24,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 11:35:24,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 11:35:24,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 11:35:24,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 11:35:24,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 11:35:24,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 11:35:24,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 11:35:24,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 11:35:24,629 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 11:35:24,629 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 11:35:24,629 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 11:35:24,630 INFO L139 ounterexampleChecker]: Examining path program with hash -2141920184, occurence #1 [2025-04-14 11:35:24,630 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 11:35:24,630 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 11:35:24,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 11:35:24,630 INFO L85 PathProgramCache]: Analyzing trace with hash 437340372, now seen corresponding path program 1 times [2025-04-14 11:35:24,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 11:35:24,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654730343] [2025-04-14 11:35:24,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 11:35:24,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 11:35:24,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 11:35:24,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 11:35:24,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 11:35:24,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 11:35:26,835 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-14 11:35:26,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 11:35:26,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654730343] [2025-04-14 11:35:26,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654730343] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 11:35:26,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 11:35:26,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-04-14 11:35:26,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538967778] [2025-04-14 11:35:26,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 11:35:26,836 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 11:35:26,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 11:35:26,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 11:35:26,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-04-14 11:35:26,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:35:26,837 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 11:35:26,837 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 11:35:26,837 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 11:35:26,837 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-04-14 11:35:26,837 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-14 11:35:26,837 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 11:35:26,837 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2025-04-14 11:35:26,837 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 11:35:26,837 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2025-04-14 11:35:26,837 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:35:29,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 11:35:29,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 11:35:29,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 11:35:29,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 11:35:29,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 11:35:29,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 11:35:29,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 11:35:29,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 11:35:29,463 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 11:35:29,463 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 11:35:29,463 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 11:35:29,463 INFO L139 ounterexampleChecker]: Examining path program with hash -749093545, occurence #1 [2025-04-14 11:35:29,463 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 11:35:29,463 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 11:35:29,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 11:35:29,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1240139542, now seen corresponding path program 3 times [2025-04-14 11:35:29,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 11:35:29,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863057835] [2025-04-14 11:35:29,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 11:35:29,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 11:35:29,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-04-14 11:35:29,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 11:35:29,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 11:35:29,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 11:35:29,523 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 11:35:29,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 11:35:29,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 11:35:29,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 11:35:29,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 11:35:29,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 11:35:29,641 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 11:35:29,641 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 11:35:29,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 11:35:29,642 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2025-04-14 11:35:29,643 INFO L320 ceAbstractionStarter]: Result for error location whoop_wrapper_write_nvramThread1of1ForFork1 was UNSAFE (2/3) [2025-04-14 11:35:29,814 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 11:35:29,814 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 11:35:29,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-14 11:35:29,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 11:35:29 BasicIcfg [2025-04-14 11:35:29,837 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 11:35:29,838 INFO L158 Benchmark]: Toolchain (without parser) took 70182.07ms. Allocated memory was 155.2MB in the beginning and 251.7MB in the end (delta: 96.5MB). Free memory was 98.8MB in the beginning and 117.0MB in the end (delta: -18.2MB). Peak memory consumption was 163.8MB. Max. memory is 8.0GB. [2025-04-14 11:35:29,838 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 167.8MB. Free memory is still 94.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 11:35:29,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 4881.14ms. Allocated memory was 155.2MB in the beginning and 465.6MB in the end (delta: 310.4MB). Free memory was 98.8MB in the beginning and 344.7MB in the end (delta: -245.8MB). Peak memory consumption was 108.7MB. Max. memory is 8.0GB. [2025-04-14 11:35:29,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.73ms. Allocated memory is still 465.6MB. Free memory was 344.7MB in the beginning and 335.1MB in the end (delta: 9.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 11:35:29,839 INFO L158 Benchmark]: Boogie Preprocessor took 60.33ms. Allocated memory is still 465.6MB. Free memory was 335.1MB in the beginning and 330.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 11:35:29,839 INFO L158 Benchmark]: RCFGBuilder took 1155.22ms. Allocated memory is still 465.6MB. Free memory was 330.9MB in the beginning and 144.4MB in the end (delta: 186.5MB). Peak memory consumption was 184.5MB. Max. memory is 8.0GB. [2025-04-14 11:35:29,839 INFO L158 Benchmark]: TraceAbstraction took 63971.01ms. Allocated memory was 465.6MB in the beginning and 251.7MB in the end (delta: -213.9MB). Free memory was 143.4MB in the beginning and 117.0MB in the end (delta: 26.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 11:35:29,840 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.76ms. Allocated memory is still 167.8MB. Free memory is still 94.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 4881.14ms. Allocated memory was 155.2MB in the beginning and 465.6MB in the end (delta: 310.4MB). Free memory was 98.8MB in the beginning and 344.7MB in the end (delta: -245.8MB). Peak memory consumption was 108.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 109.73ms. Allocated memory is still 465.6MB. Free memory was 344.7MB in the beginning and 335.1MB in the end (delta: 9.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.33ms. Allocated memory is still 465.6MB. Free memory was 335.1MB in the beginning and 330.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1155.22ms. Allocated memory is still 465.6MB. Free memory was 330.9MB in the beginning and 144.4MB in the end (delta: 186.5MB). Peak memory consumption was 184.5MB. Max. memory is 8.0GB. * TraceAbstraction took 63971.01ms. Allocated memory was 465.6MB in the beginning and 251.7MB in the end (delta: -213.9MB). Free memory was 143.4MB in the beginning and 117.0MB in the end (delta: 26.4MB). There was no memory consumed. 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: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 436, independent: 428, independent conditional: 13, independent unconditional: 415, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 432, independent: 428, independent conditional: 13, independent unconditional: 415, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 432, independent: 428, independent conditional: 13, independent unconditional: 415, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 432, independent: 428, independent conditional: 13, independent unconditional: 415, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 432, independent: 428, independent conditional: 0, independent unconditional: 428, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 432, independent: 428, independent conditional: 0, independent unconditional: 428, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 419, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 419, independent: 414, independent conditional: 0, independent unconditional: 414, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 254, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 213, dependent conditional: 0, dependent unconditional: 213, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 432, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 419, unknown conditional: 0, unknown unconditional: 419] , Statistics on independence cache: Total cache size (in pairs): 419, Positive cache size: 415, Positive conditional cache size: 0, Positive unconditional cache size: 415, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0, Independence queries for same thread: 4, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 20, Number of trivial persistent sets: 18, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 419, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 436, independent: 428, independent conditional: 13, independent unconditional: 415, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 432, independent: 428, independent conditional: 13, independent unconditional: 415, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 432, independent: 428, independent conditional: 13, independent unconditional: 415, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 432, independent: 428, independent conditional: 13, independent unconditional: 415, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 432, independent: 428, independent conditional: 0, independent unconditional: 428, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 432, independent: 428, independent conditional: 0, independent unconditional: 428, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 419, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 419, independent: 414, independent conditional: 0, independent unconditional: 414, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 254, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 213, dependent conditional: 0, dependent unconditional: 213, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 432, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 419, unknown conditional: 0, unknown unconditional: 419] , Statistics on independence cache: Total cache size (in pairs): 419, Positive cache size: 415, Positive conditional cache size: 0, Positive unconditional cache size: 415, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0, Independence queries for same thread: 4 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2506, independent: 2141, independent conditional: 1209, independent unconditional: 932, dependent: 365, dependent conditional: 352, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2170, independent: 2141, independent conditional: 1209, independent unconditional: 932, dependent: 29, dependent conditional: 16, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2170, independent: 2141, independent conditional: 1209, independent unconditional: 932, dependent: 29, dependent conditional: 16, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2303, independent: 2141, independent conditional: 1209, independent unconditional: 932, dependent: 162, dependent conditional: 149, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2303, independent: 2141, independent conditional: 38, independent unconditional: 2103, dependent: 162, dependent conditional: 59, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2303, independent: 2141, independent conditional: 38, independent unconditional: 2103, dependent: 162, dependent conditional: 59, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 584, independent: 540, independent conditional: 21, independent unconditional: 519, dependent: 44, dependent conditional: 35, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 584, independent: 519, independent conditional: 0, independent unconditional: 519, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 65, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 44, dependent conditional: 35, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 44, dependent conditional: 35, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1688, independent: 522, independent conditional: 522, independent unconditional: 0, dependent: 1165, dependent conditional: 866, dependent unconditional: 299, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 2303, independent: 1601, independent conditional: 17, independent unconditional: 1584, dependent: 118, dependent conditional: 24, dependent unconditional: 94, unknown: 584, unknown conditional: 56, unknown unconditional: 528] , Statistics on independence cache: Total cache size (in pairs): 1003, Positive cache size: 955, Positive conditional cache size: 21, Positive unconditional cache size: 934, Negative cache size: 48, Negative conditional cache size: 35, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1261, Maximal queried relation: 7, Independence queries for same thread: 336, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 107, Number of trivial persistent sets: 93, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 945, independent: 932, independent conditional: 0, independent unconditional: 932, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2506, independent: 2141, independent conditional: 1209, independent unconditional: 932, dependent: 365, dependent conditional: 352, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2170, independent: 2141, independent conditional: 1209, independent unconditional: 932, dependent: 29, dependent conditional: 16, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2170, independent: 2141, independent conditional: 1209, independent unconditional: 932, dependent: 29, dependent conditional: 16, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2303, independent: 2141, independent conditional: 1209, independent unconditional: 932, dependent: 162, dependent conditional: 149, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2303, independent: 2141, independent conditional: 38, independent unconditional: 2103, dependent: 162, dependent conditional: 59, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2303, independent: 2141, independent conditional: 38, independent unconditional: 2103, dependent: 162, dependent conditional: 59, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 584, independent: 540, independent conditional: 21, independent unconditional: 519, dependent: 44, dependent conditional: 35, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 584, independent: 519, independent conditional: 0, independent unconditional: 519, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 65, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 44, dependent conditional: 35, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 44, dependent conditional: 35, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1688, independent: 522, independent conditional: 522, independent unconditional: 0, dependent: 1165, dependent conditional: 866, dependent unconditional: 299, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 2303, independent: 1601, independent conditional: 17, independent unconditional: 1584, dependent: 118, dependent conditional: 24, dependent unconditional: 94, unknown: 584, unknown conditional: 56, unknown unconditional: 528] , Statistics on independence cache: Total cache size (in pairs): 1003, Positive cache size: 955, Positive conditional cache size: 21, Positive unconditional cache size: 934, Negative cache size: 48, Negative conditional cache size: 35, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1261, Maximal queried relation: 7, Independence queries for same thread: 336 - 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 }; [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, }; [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 TRUE 0 nvram_len < 0 [L6812] 0 nvram_len = 8192 [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=8192, nvram_mutex={7:0}, pthread_t_write_nvram=-1, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7: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)={-10:0}, \at(count, Pre)=1, \at(file, Pre)={-14:0}, \at(ppos, Pre)={-2:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-10:0}, c=0, count=1, default_alloc_size=4, file={-14:0}, jiffies=0, lppos=8190, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-10:0}, ppos={-2:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] [L6755] EXPR 1 \read(*ppos) [L6755] 1 lppos = *ppos [L6757] 1 i = lppos VAL [\at(buf, Pre)={-10:0}, \at(count, Pre)=1, \at(file, Pre)={-14:0}, \at(ppos, Pre)={-2:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-10:0}, c=0, count=1, default_alloc_size=4, file={-14:0}, i=8190, jiffies=0, lppos=8190, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-10:0}, ppos={-2:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7: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=8192, nvram_mutex={7:0}, pthread_t_read_nvram=0, pthread_t_write_nvram=-1, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7: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)={-10:0}, \at(count, Pre)=1, \at(file, Pre)={-17:0}, \at(ppos, Pre)={-2:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-10:0}, count=1, default_alloc_size=4, file={-17:0}, jiffies=0, lppos=8190, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-10:0}, ppos={-2:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7: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 VAL [\at(buf, Pre)={-10:0}, \at(count, Pre)=1, \at(file, Pre)={-14:0}, \at(ppos, Pre)={-2:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-10:0}, c=0, count=0, default_alloc_size=4, file={-14:0}, i=8191, jiffies=0, lppos=8190, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-10:1}, ppos={-2:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] [L6757] COND FALSE 1 !(count > 0 && i < nvram_len) VAL [\at(buf, Pre)={-10:0}, \at(count, Pre)=1, \at(file, Pre)={-14:0}, \at(ppos, Pre)={-2:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-10:0}, c=0, count=0, default_alloc_size=4, file={-14:0}, i=8191, jiffies=0, lppos=8190, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-10:1}, ppos={-2:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] [L6763] 1 *ppos = i VAL [\at(buf, Pre)={-10:0}, \at(count, Pre)=1, \at(file, Pre)={-14:0}, \at(ppos, Pre)={-2:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-10:0}, c=0, count=0, default_alloc_size=4, file={-14:0}, i=8191, jiffies=0, lppos=8190, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-10:1}, ppos={-2:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] [L6727] EXPR 2 \read(*ppos) [L6727] 2 lppos = *ppos [L6729] 2 i = lppos VAL [\at(buf, Pre)={-10:0}, \at(count, Pre)=1, \at(file, Pre)={-17:0}, \at(ppos, Pre)={-2:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-10:0}, count=1, default_alloc_size=4, file={-17:0}, i=8191, jiffies=0, lppos=8191, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-10:0}, ppos={-2:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7: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 VAL [\at(buf, Pre)={-10:0}, \at(count, Pre)=1, \at(file, Pre)={-17:0}, \at(ppos, Pre)={-2:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-10:0}, count=0, default_alloc_size=4, file={-17:0}, i=8192, jiffies=0, lppos=8191, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-10:1}, ppos={-2:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] [L6729] COND FALSE 2 !(count > 0 && i < nvram_len) VAL [\at(buf, Pre)={-10:0}, \at(count, Pre)=1, \at(file, Pre)={-17:0}, \at(ppos, Pre)={-2:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-10:0}, count=0, default_alloc_size=4, file={-17:0}, i=8192, jiffies=0, lppos=8191, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-10:1}, ppos={-2:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] [L6733] 2 *ppos = i VAL [\at(buf, Pre)={-10:0}, \at(count, Pre)=1, \at(file, Pre)={-17:0}, \at(ppos, Pre)={-2:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-10:0}, count=0, default_alloc_size=4, file={-17:0}, i=8192, jiffies=0, lppos=8191, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-10:1}, ppos={-2:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7: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) 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=8192, nvram_mutex={7:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] [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=8192, nvram_mutex={7:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 79 locations, 98 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: whoop_wrapper_write_nvramThread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 79 locations, 98 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 63.1s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 29.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 30.7s InterpolantComputationTime, 352 NumberOfCodeBlocks, 352 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 16395 SizeOfPredicates, 65 NumberOfNonLiveVariables, 1886 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 1/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2025-04-14 11:35:29,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...