./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis SLEEP_NEW_STATES --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6f232940 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f16b4cfe031f645c2fa5eeec572887c79d8e9243727503d849e4b19e0e31cc63 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis SLEEP_NEW_STATES --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6f23294-m [2025-03-19 18:18:57,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-19 18:18:57,534 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-03-19 18:18:57,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-19 18:18:57,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-19 18:18:57,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-19 18:18:57,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-19 18:18:57,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-19 18:18:57,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-19 18:18:57,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-19 18:18:57,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-19 18:18:57,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-19 18:18:57,559 INFO L153 SettingsManager]: * Use SBE=true [2025-03-19 18:18:57,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-19 18:18:57,559 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-19 18:18:57,559 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-19 18:18:57,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-19 18:18:57,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-19 18:18:57,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-19 18:18:57,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-19 18:18:57,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-19 18:18:57,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-19 18:18:57,560 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-19 18:18:57,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-19 18:18:57,560 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-19 18:18:57,560 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-19 18:18:57,560 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-19 18:18:57,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-19 18:18:57,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-19 18:18:57,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-19 18:18:57,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-19 18:18:57,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-19 18:18:57,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-19 18:18:57,562 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-19 18:18:57,562 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-03-19 18:18:57,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-19 18:18:57,562 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-19 18:18:57,562 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-03-19 18:18:57,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-19 18:18:57,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-03-19 18:18:57,562 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-03-19 18:18:57,562 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-03-19 18:18:57,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f16b4cfe031f645c2fa5eeec572887c79d8e9243727503d849e4b19e0e31cc63 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> SLEEP_NEW_STATES [2025-03-19 18:18:57,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-19 18:18:57,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-19 18:18:57,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-19 18:18:57,793 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-19 18:18:57,793 INFO L274 PluginConnector]: CDTParser initialized [2025-03-19 18:18:57,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i [2025-03-19 18:18:59,052 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c4e220921/c3c5355482c045b7a51669b98154071e/FLAG87561cb0d [2025-03-19 18:18:59,442 INFO L389 CDTParser]: Found 1 translation units. [2025-03-19 18:18:59,442 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i [2025-03-19 18:18:59,479 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c4e220921/c3c5355482c045b7a51669b98154071e/FLAG87561cb0d [2025-03-19 18:19:00,187 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c4e220921/c3c5355482c045b7a51669b98154071e [2025-03-19 18:19:00,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-19 18:19:00,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-19 18:19:00,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-19 18:19:00,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-19 18:19:00,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-19 18:19:00,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 06:19:00" (1/1) ... [2025-03-19 18:19:00,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f1a5f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:19:00, skipping insertion in model container [2025-03-19 18:19:00,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 06:19:00" (1/1) ... [2025-03-19 18:19:00,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-19 18:19:00,568 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i[5520,5533] [2025-03-19 18:19:03,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-19 18:19:03,167 INFO L200 MainTranslator]: Completed pre-run [2025-03-19 18:19:03,194 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i[5520,5533] [2025-03-19 18:19:03,312 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-03-19 18:19:03,313 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-03-19 18:19:03,313 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-03-19 18:19:03,314 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-03-19 18:19:03,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] [2025-03-19 18:19:03,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-19 18:19:03,746 INFO L204 MainTranslator]: Completed translation [2025-03-19 18:19:03,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:19:03 WrapperNode [2025-03-19 18:19:03,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-19 18:19:03,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-19 18:19:03,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-19 18:19:03,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-19 18:19:03,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:19:03" (1/1) ... [2025-03-19 18:19:03,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:19:03" (1/1) ... [2025-03-19 18:19:03,840 INFO L138 Inliner]: procedures = 1354, calls = 1479, calls flagged for inlining = 352, calls inlined = 18, statements flattened = 394 [2025-03-19 18:19:03,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-19 18:19:03,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-19 18:19:03,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-19 18:19:03,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-19 18:19:03,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:19:03" (1/1) ... [2025-03-19 18:19:03,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:19:03" (1/1) ... [2025-03-19 18:19:03,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:19:03" (1/1) ... [2025-03-19 18:19:03,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:19:03" (1/1) ... [2025-03-19 18:19:03,858 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:19:03" (1/1) ... [2025-03-19 18:19:03,859 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:19:03" (1/1) ... [2025-03-19 18:19:03,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:19:03" (1/1) ... [2025-03-19 18:19:03,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:19:03" (1/1) ... [2025-03-19 18:19:03,873 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:19:03" (1/1) ... [2025-03-19 18:19:03,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-19 18:19:03,883 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-19 18:19:03,883 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-19 18:19:03,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-19 18:19:03,884 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:19:03" (1/1) ... [2025-03-19 18:19:03,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-19 18:19:03,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 18:19:03,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-19 18:19:03,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-19 18:19:03,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-19 18:19:03,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-19 18:19:03,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-19 18:19:03,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-19 18:19:03,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-19 18:19:03,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-19 18:19:03,924 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_read_nvram [2025-03-19 18:19:03,924 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_read_nvram [2025-03-19 18:19:03,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-19 18:19:03,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-19 18:19:03,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-19 18:19:03,925 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_write_nvram [2025-03-19 18:19:03,925 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_write_nvram [2025-03-19 18:19:03,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-19 18:19:03,926 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-19 18:19:04,209 INFO L234 CfgBuilder]: Building ICFG [2025-03-19 18:19:04,210 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-19 18:19:04,617 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-19 18:19:04,618 INFO L283 CfgBuilder]: Performing block encoding [2025-03-19 18:19:04,988 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-19 18:19:04,988 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-19 18:19:04,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 06:19:04 BoogieIcfgContainer [2025-03-19 18:19:04,989 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-19 18:19:04,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-19 18:19:04,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-19 18:19:04,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-19 18:19:04,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 06:19:00" (1/3) ... [2025-03-19 18:19:04,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd83019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 06:19:04, skipping insertion in model container [2025-03-19 18:19:04,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:19:03" (2/3) ... [2025-03-19 18:19:04,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd83019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 06:19:04, skipping insertion in model container [2025-03-19 18:19:04,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 06:19:04" (3/3) ... [2025-03-19 18:19:04,997 INFO L128 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_read_nvram_write_nvram.i [2025-03-19 18:19:05,008 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-19 18:19:05,011 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-03-19 18:19:05,011 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-19 18:19:05,072 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-19 18:19:05,106 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 18:19:05,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-03-19 18:19:05,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 18:19:05,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-03-19 18:19:05,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-03-19 18:19:05,330 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 18:19:05,335 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-19 18:19:05,339 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;@7309924e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 18:19:05,340 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-19 18:19:05,364 INFO L791 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-19 18:19:05,365 INFO L791 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-03-19 18:19:05,368 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-03-19 18:19:05,369 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE (1/3) [2025-03-19 18:19:05,372 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 18:19:05,375 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 18:19:05,375 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == whoop_wrapper_write_nvramThread1of1ForFork1 ======== [2025-03-19 18:19:05,375 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;@7309924e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 18:19:05,376 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-19 18:19:05,388 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 18:19:05,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 18:19:05,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2039993743, now seen corresponding path program 1 times [2025-03-19 18:19:05,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 18:19:05,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89004507] [2025-03-19 18:19:05,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 18:19:05,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 18:19:05,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-19 18:19:05,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-19 18:19:05,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 18:19:05,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 18:19:07,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 18:19:07,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 18:19:07,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89004507] [2025-03-19 18:19:07,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89004507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 18:19:07,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 18:19:07,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-19 18:19:07,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210244062] [2025-03-19 18:19:07,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 18:19:07,157 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-19 18:19:07,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 18:19:07,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-19 18:19:07,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-19 18:19:07,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 18:19:07,171 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 18:19:07,172 INFO L481 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-03-19 18:19:07,172 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 18:19:07,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-19 18:19:07,658 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-19 18:19:07,659 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 18:19:07,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 18:19:07,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1161423089, now seen corresponding path program 1 times [2025-03-19 18:19:07,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 18:19:07,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759132125] [2025-03-19 18:19:07,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 18:19:07,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 18:19:07,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-19 18:19:07,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-19 18:19:07,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 18:19:07,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 18:19:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 18:19:09,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 18:19:09,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759132125] [2025-03-19 18:19:09,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759132125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 18:19:09,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 18:19:09,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-19 18:19:09,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92088849] [2025-03-19 18:19:09,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 18:19:09,901 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-19 18:19:09,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 18:19:09,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-19 18:19:09,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-19 18:19:09,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 18:19:09,902 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 18:19:09,902 INFO L481 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-03-19 18:19:09,902 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-19 18:19:09,902 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 18:19:10,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-19 18:19:10,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-19 18:19:10,753 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-19 18:19:10,753 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 18:19:10,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 18:19:10,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1298928627, now seen corresponding path program 1 times [2025-03-19 18:19:10,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 18:19:10,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660019087] [2025-03-19 18:19:10,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 18:19:10,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 18:19:10,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-19 18:19:10,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-19 18:19:10,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 18:19:10,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 18:19:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 18:19:12,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 18:19:12,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660019087] [2025-03-19 18:19:12,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660019087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 18:19:12,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 18:19:12,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-19 18:19:12,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622609426] [2025-03-19 18:19:12,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 18:19:12,516 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-19 18:19:12,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 18:19:12,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-19 18:19:12,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-19 18:19:12,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 18:19:12,517 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 18:19:12,517 INFO L481 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-03-19 18:19:12,518 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-19 18:19:12,518 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-03-19 18:19:12,518 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 18:19:13,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:13,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-19 18:19:13,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:13,743 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-19 18:19:13,743 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 18:19:13,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 18:19:13,744 INFO L85 PathProgramCache]: Analyzing trace with hash -220306669, now seen corresponding path program 1 times [2025-03-19 18:19:13,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 18:19:13,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950795283] [2025-03-19 18:19:13,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 18:19:13,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 18:19:13,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-19 18:19:13,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-19 18:19:13,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 18:19:13,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 18:19:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 18:19:15,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 18:19:15,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950795283] [2025-03-19 18:19:15,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950795283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 18:19:15,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 18:19:15,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-19 18:19:15,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064646621] [2025-03-19 18:19:15,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 18:19:15,298 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-19 18:19:15,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 18:19:15,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-19 18:19:15,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-19 18:19:15,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 18:19:15,299 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 18:19:15,300 INFO L481 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-03-19 18:19:15,300 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:15,300 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-03-19 18:19:15,300 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:15,300 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 18:19:16,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:16,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-19 18:19:16,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:16,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-19 18:19:16,228 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-19 18:19:16,228 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 18:19:16,229 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 18:19:16,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2100382762, now seen corresponding path program 1 times [2025-03-19 18:19:16,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 18:19:16,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032516583] [2025-03-19 18:19:16,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 18:19:16,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 18:19:16,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-19 18:19:16,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-19 18:19:16,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 18:19:16,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 18:19:20,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 18:19:20,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 18:19:20,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032516583] [2025-03-19 18:19:20,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032516583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-19 18:19:20,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107699306] [2025-03-19 18:19:20,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 18:19:20,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 18:19:20,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 18:19:20,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-19 18:19:20,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-19 18:19:20,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-19 18:19:20,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-19 18:19:20,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 18:19:20,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 18:19:20,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-19 18:19:20,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 18:19:20,559 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-03-19 18:19:20,838 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-03-19 18:19:21,135 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-03-19 18:19:21,210 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-03-19 18:19:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 18:19:21,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-19 18:19:21,527 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-03-19 18:19:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-19 18:19:24,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107699306] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-19 18:19:24,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-19 18:19:24,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [20, 13] total 40 [2025-03-19 18:19:24,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561943062] [2025-03-19 18:19:24,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 18:19:24,357 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-19 18:19:24,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 18:19:24,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-19 18:19:24,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1450, Unknown=0, NotChecked=0, Total=1560 [2025-03-19 18:19:24,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 18:19:24,358 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 18:19:24,358 INFO L481 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-03-19 18:19:24,358 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:24,358 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-03-19 18:19:24,358 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:24,358 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-19 18:19:24,359 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 18:19:25,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:25,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-19 18:19:25,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:25,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-19 18:19:25,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-19 18:19:25,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-19 18:19:25,497 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 18:19:25,498 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 18:19:25,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 18:19:25,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2029631896, now seen corresponding path program 2 times [2025-03-19 18:19:25,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 18:19:25,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598307810] [2025-03-19 18:19:25,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-19 18:19:25,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 18:19:25,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-19 18:19:25,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-19 18:19:25,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-19 18:19:25,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 18:19:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 18:19:27,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 18:19:27,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598307810] [2025-03-19 18:19:27,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598307810] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-19 18:19:27,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232910808] [2025-03-19 18:19:27,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-19 18:19:27,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 18:19:27,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 18:19:27,934 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-19 18:19:27,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-19 18:19:28,083 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-19 18:19:28,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-19 18:19:28,185 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-19 18:19:28,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 18:19:28,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-19 18:19:28,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 18:19:28,412 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-03-19 18:19:28,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 18:19:28,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-19 18:19:29,148 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-19 18:19:29,148 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-03-19 18:19:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 18:19:29,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232910808] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-19 18:19:29,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-19 18:19:29,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 34 [2025-03-19 18:19:29,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060646549] [2025-03-19 18:19:29,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-19 18:19:29,249 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-19 18:19:29,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 18:19:29,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-19 18:19:29,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1035, Unknown=0, NotChecked=0, Total=1122 [2025-03-19 18:19:29,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 18:19:29,250 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 18:19:29,250 INFO L481 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-03-19 18:19:29,250 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:29,250 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-03-19 18:19:29,250 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:29,250 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-19 18:19:29,250 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2025-03-19 18:19:29,250 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 18:19:33,748 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:33,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-19 18:19:33,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:33,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-19 18:19:33,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-19 18:19:33,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-19 18:19:33,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-19 18:19:33,950 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 18:19:33,950 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 18:19:33,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 18:19:33,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1373196744, now seen corresponding path program 1 times [2025-03-19 18:19:33,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 18:19:33,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423210722] [2025-03-19 18:19:33,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 18:19:33,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 18:19:33,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-19 18:19:34,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-19 18:19:34,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 18:19:34,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 18:19:35,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 18:19:35,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 18:19:35,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423210722] [2025-03-19 18:19:35,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423210722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-19 18:19:35,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947423715] [2025-03-19 18:19:35,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 18:19:35,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 18:19:35,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 18:19:35,985 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-19 18:19:35,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-19 18:19:36,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-19 18:19:36,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-19 18:19:36,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 18:19:36,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 18:19:36,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-19 18:19:36,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 18:19:36,215 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-03-19 18:19:36,423 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-03-19 18:19:36,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 18:19:36,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-19 18:19:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 18:19:37,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947423715] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-19 18:19:37,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-19 18:19:37,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 36 [2025-03-19 18:19:37,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039843719] [2025-03-19 18:19:37,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-19 18:19:37,315 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-19 18:19:37,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 18:19:37,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-19 18:19:37,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1169, Unknown=0, NotChecked=0, Total=1260 [2025-03-19 18:19:37,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 18:19:37,316 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 18:19:37,317 INFO L481 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-03-19 18:19:37,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:37,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-03-19 18:19:37,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:37,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-19 18:19:37,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2025-03-19 18:19:37,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-03-19 18:19:37,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 18:19:45,198 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-19 18:19:48,339 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-19 18:19:51,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:51,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-19 18:19:51,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:51,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-19 18:19:51,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-19 18:19:51,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-19 18:19:51,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-19 18:19:51,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-19 18:19:51,922 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 18:19:51,922 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 18:19:51,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 18:19:51,923 INFO L85 PathProgramCache]: Analyzing trace with hash 449781683, now seen corresponding path program 2 times [2025-03-19 18:19:51,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 18:19:51,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555872090] [2025-03-19 18:19:51,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-19 18:19:51,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 18:19:51,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-03-19 18:19:51,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-19 18:19:51,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-19 18:19:51,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 18:19:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 18:19:53,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 18:19:53,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555872090] [2025-03-19 18:19:53,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555872090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 18:19:53,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 18:19:53,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-19 18:19:53,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263773001] [2025-03-19 18:19:53,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 18:19:53,204 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-19 18:19:53,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 18:19:53,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-19 18:19:53,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-19 18:19:53,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 18:19:53,205 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 18:19:53,205 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) 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-03-19 18:19:53,205 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:53,205 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-03-19 18:19:53,205 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:53,205 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-19 18:19:53,205 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-03-19 18:19:53,205 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2025-03-19 18:19:53,205 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2025-03-19 18:19:53,205 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 18:19:55,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:55,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-19 18:19:55,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:55,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-19 18:19:55,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-19 18:19:55,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-19 18:19:55,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-19 18:19:55,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-19 18:19:55,703 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-19 18:19:55,703 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 18:19:55,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 18:19:55,704 INFO L85 PathProgramCache]: Analyzing trace with hash 437340372, now seen corresponding path program 1 times [2025-03-19 18:19:55,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 18:19:55,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241314352] [2025-03-19 18:19:55,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 18:19:55,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 18:19:55,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-19 18:19:55,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-19 18:19:55,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 18:19:55,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 18:19:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 18:19:57,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 18:19:57,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241314352] [2025-03-19 18:19:57,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241314352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 18:19:57,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 18:19:57,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-19 18:19:57,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975858075] [2025-03-19 18:19:57,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 18:19:57,619 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-19 18:19:57,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 18:19:57,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-19 18:19:57,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-03-19 18:19:57,619 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 18:19:57,619 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 18:19:57,619 INFO L481 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-03-19 18:19:57,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:57,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-03-19 18:19:57,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:57,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-19 18:19:57,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-03-19 18:19:57,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2025-03-19 18:19:57,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2025-03-19 18:19:57,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2025-03-19 18:19:57,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 18:19:59,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:59,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-19 18:19:59,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-19 18:19:59,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-19 18:19:59,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-19 18:19:59,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-19 18:19:59,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-19 18:19:59,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-19 18:19:59,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-19 18:19:59,688 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-19 18:19:59,688 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 18:19:59,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 18:19:59,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1240139542, now seen corresponding path program 3 times [2025-03-19 18:19:59,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 18:19:59,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502412013] [2025-03-19 18:19:59,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-19 18:19:59,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 18:19:59,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-03-19 18:19:59,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-19 18:19:59,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-19 18:19:59,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 18:19:59,742 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-19 18:19:59,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-19 18:19:59,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-19 18:19:59,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 18:19:59,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 18:19:59,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-19 18:19:59,828 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-19 18:19:59,829 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-19 18:19:59,829 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-19 18:19:59,829 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2025-03-19 18:19:59,830 INFO L320 ceAbstractionStarter]: Result for error location whoop_wrapper_write_nvramThread1of1ForFork1 was UNSAFE (2/3) [2025-03-19 18:19:59,926 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-19 18:19:59,926 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-03-19 18:19:59,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-03-19 18:19:59,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 06:19:59 BasicIcfg [2025-03-19 18:19:59,941 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-19 18:19:59,942 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-19 18:19:59,942 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-19 18:19:59,942 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-19 18:19:59,942 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 06:19:04" (3/4) ... [2025-03-19 18:19:59,943 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-19 18:20:00,021 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 38. [2025-03-19 18:20:00,081 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-03-19 18:20:00,083 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.yml [2025-03-19 18:20:00,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-19 18:20:00,084 INFO L158 Benchmark]: Toolchain (without parser) took 59894.20ms. Allocated memory was 117.4MB in the beginning and 830.5MB in the end (delta: 713.0MB). Free memory was 81.4MB in the beginning and 641.3MB in the end (delta: -559.9MB). Peak memory consumption was 154.5MB. Max. memory is 16.1GB. [2025-03-19 18:20:00,084 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-19 18:20:00,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3557.43ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 81.2MB in the beginning and 154.4MB in the end (delta: -73.3MB). Peak memory consumption was 138.4MB. Max. memory is 16.1GB. [2025-03-19 18:20:00,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.95ms. Allocated memory is still 234.9MB. Free memory was 154.4MB in the beginning and 146.1MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-19 18:20:00,085 INFO L158 Benchmark]: Boogie Preprocessor took 38.68ms. Allocated memory is still 234.9MB. Free memory was 146.1MB in the beginning and 142.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-19 18:20:00,085 INFO L158 Benchmark]: RCFGBuilder took 1105.90ms. Allocated memory is still 234.9MB. Free memory was 142.2MB in the beginning and 72.8MB in the end (delta: 69.4MB). Peak memory consumption was 108.9MB. Max. memory is 16.1GB. [2025-03-19 18:20:00,086 INFO L158 Benchmark]: TraceAbstraction took 54951.15ms. Allocated memory was 234.9MB in the beginning and 830.5MB in the end (delta: 595.6MB). Free memory was 72.8MB in the beginning and 697.9MB in the end (delta: -625.1MB). Peak memory consumption was 402.7MB. Max. memory is 16.1GB. [2025-03-19 18:20:00,086 INFO L158 Benchmark]: Witness Printer took 141.70ms. Allocated memory is still 830.5MB. Free memory was 697.9MB in the beginning and 641.3MB in the end (delta: 56.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-19 18:20:00,087 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.20ms. Allocated memory is still 83.9MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3557.43ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 81.2MB in the beginning and 154.4MB in the end (delta: -73.3MB). Peak memory consumption was 138.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.95ms. Allocated memory is still 234.9MB. Free memory was 154.4MB in the beginning and 146.1MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.68ms. Allocated memory is still 234.9MB. Free memory was 146.1MB in the beginning and 142.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1105.90ms. Allocated memory is still 234.9MB. Free memory was 142.2MB in the beginning and 72.8MB in the end (delta: 69.4MB). Peak memory consumption was 108.9MB. Max. memory is 16.1GB. * TraceAbstraction took 54951.15ms. Allocated memory was 234.9MB in the beginning and 830.5MB in the end (delta: 595.6MB). Free memory was 72.8MB in the beginning and 697.9MB in the end (delta: -625.1MB). Peak memory consumption was 402.7MB. Max. memory is 16.1GB. * Witness Printer took 141.70ms. Allocated memory is still 830.5MB. Free memory was 697.9MB in the beginning and 641.3MB in the end (delta: 56.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * 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: 51, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 39, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 35, unknown conditional: 0, unknown unconditional: 35] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 12 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4459, independent: 3732, independent conditional: 3732, independent unconditional: 0, dependent: 727, dependent conditional: 727, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3800, independent: 3732, independent conditional: 0, independent unconditional: 3732, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 214, independent: 207, independent conditional: 0, independent unconditional: 207, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 214, independent: 207, independent conditional: 0, independent unconditional: 207, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 201, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 201, dependent conditional: 0, dependent unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 3800, independent: 3525, independent conditional: 0, independent unconditional: 3525, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 214, unknown conditional: 0, unknown unconditional: 214] , Statistics on independence cache: Total cache size (in pairs): 249, Positive cache size: 242, Positive conditional cache size: 0, Positive unconditional cache size: 242, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 659 - 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.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: No data available - 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: 54.5s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 27.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: 219, 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, 24.1s InterpolantComputationTime, 379 NumberOfCodeBlocks, 379 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 430 ConstructedInterpolants, 0 QuantifiedInterpolants, 17312 SizeOfPredicates, 65 NumberOfNonLiveVariables, 1886 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 1/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-19 18:20:00,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE