./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram-race.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aedfaf2f30401ef1fb89035eef2af3f1fa0e071d7640dfb0ac0413d4b26b1c7b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:27:30,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:27:30,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:27:30,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:27:30,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:27:30,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:27:30,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:27:30,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:27:30,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:27:30,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:27:30,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:27:30,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:27:30,126 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:27:30,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:27:30,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:27:30,126 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:27:30,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:27:30,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:27:30,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:27:30,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:27:30,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:27:30,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:27:30,127 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:27:30,127 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:27:30,127 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:27:30,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:27:30,127 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:27:30,127 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:27:30,127 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:27:30,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:27:30,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:27:30,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:27:30,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:27:30,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:27:30,128 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:27:30,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:27:30,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:27:30,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:27:30,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:27:30,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:27:30,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:27:30,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:27:30,129 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-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 ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> aedfaf2f30401ef1fb89035eef2af3f1fa0e071d7640dfb0ac0413d4b26b1c7b [2025-02-08 05:27:30,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:27:30,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:27:30,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:27:30,340 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:27:30,341 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:27:30,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram-race.i [2025-02-08 05:27:31,417 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9b5fabdc/74b202980df048c7817284d0edadef47/FLAG678c5538e [2025-02-08 05:27:31,982 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:27:31,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram-race.i [2025-02-08 05:27:32,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9b5fabdc/74b202980df048c7817284d0edadef47/FLAG678c5538e [2025-02-08 05:27:32,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9b5fabdc/74b202980df048c7817284d0edadef47 [2025-02-08 05:27:32,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:27:32,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:27:32,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:27:32,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:27:32,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:27:32,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:27:32" (1/1) ... [2025-02-08 05:27:32,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@329c0671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:32, skipping insertion in model container [2025-02-08 05:27:32,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:27:32" (1/1) ... [2025-02-08 05:27:32,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:27:35,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:27:35,405 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:27:35,485 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-02-08 05:27:35,486 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-02-08 05:27:35,542 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-02-08 05:27:35,542 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-02-08 05:27:35,609 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] [2025-02-08 05:27:35,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:27:36,032 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:27:36,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:36 WrapperNode [2025-02-08 05:27:36,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:27:36,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:27:36,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:27:36,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:27:36,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:36" (1/1) ... [2025-02-08 05:27:36,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:36" (1/1) ... [2025-02-08 05:27:36,151 INFO L138 Inliner]: procedures = 1354, calls = 1464, calls flagged for inlining = 353, calls inlined = 20, statements flattened = 590 [2025-02-08 05:27:36,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:27:36,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:27:36,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:27:36,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:27:36,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:36" (1/1) ... [2025-02-08 05:27:36,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:36" (1/1) ... [2025-02-08 05:27:36,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:36" (1/1) ... [2025-02-08 05:27:36,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:36" (1/1) ... [2025-02-08 05:27:36,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:36" (1/1) ... [2025-02-08 05:27:36,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:36" (1/1) ... [2025-02-08 05:27:36,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:36" (1/1) ... [2025-02-08 05:27:36,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:36" (1/1) ... [2025-02-08 05:27:36,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:27:36,201 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:27:36,201 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:27:36,201 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:27:36,202 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:36" (1/1) ... [2025-02-08 05:27:36,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:27:36,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:27:36,223 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:27:36,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:27:36,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:27:36,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:27:36,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:27:36,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:27:36,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:27:36,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:27:36,239 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_read_nvram [2025-02-08 05:27:36,239 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_read_nvram [2025-02-08 05:27:36,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 05:27:36,239 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_write_nvram [2025-02-08 05:27:36,239 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_write_nvram [2025-02-08 05:27:36,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:27:36,240 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:27:36,515 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:27:36,516 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:27:36,683 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-6: havoc __put_user_#in~arg0#1, __put_user_#in~arg1#1.base, __put_user_#in~arg1#1.offset; [2025-02-08 05:27:36,683 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-5: assume { :end_inline___put_user } true;assume -2147483648 <= read_nvram_#t~ret1322#1 && read_nvram_#t~ret1322#1 <= 2147483647; [2025-02-08 05:27:36,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-4: havoc read_nvram_#t~ret1321#1; [2025-02-08 05:27:36,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-3: havoc read_nvram_#t~ret1321#1; [2025-02-08 05:27:36,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-10: havoc __put_user_#res#1; [2025-02-08 05:27:36,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-9: havoc __put_user_#t~nondet1284#1, __put_user_~arg0#1, __put_user_~arg1#1.base, __put_user_~arg1#1.offset; [2025-02-08 05:27:36,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-8: read_nvram_#t~ret1322#1 := __put_user_#res#1; [2025-02-08 05:27:36,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-7: havoc __put_user_#t~nondet1284#1, __put_user_~arg0#1, __put_user_~arg1#1.base, __put_user_~arg1#1.offset; [2025-02-08 05:27:36,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-14: read_nvram_#t~ret1321#1 := nvram_read_byte_#res#1; [2025-02-08 05:27:36,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-13: havoc nvram_read_byte_#t~nondet1302#1, nvram_read_byte_~arg0#1; [2025-02-08 05:27:36,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6551: havoc access_ok_#t~nondet1286#1; [2025-02-08 05:27:36,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-12: havoc nvram_read_byte_#in~arg0#1; [2025-02-08 05:27:36,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-11: assume { :end_inline_nvram_read_byte } true;assume { :begin_inline___put_user } true;__put_user_#in~arg0#1, __put_user_#in~arg1#1.base, __put_user_#in~arg1#1.offset := (if read_nvram_#t~ret1321#1 % 256 % 4294967296 <= 2147483647 then read_nvram_#t~ret1321#1 % 256 % 4294967296 else read_nvram_#t~ret1321#1 % 256 % 4294967296 - 4294967296), read_nvram_~p~1#1.base, read_nvram_~p~1#1.offset; [2025-02-08 05:27:36,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543: havoc __put_user_#t~nondet1284#1; [2025-02-08 05:27:36,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543-5: havoc __put_user_#t~nondet1284#1; [2025-02-08 05:27:36,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543-4: assume -2147483648 <= __put_user_#t~nondet1284#1 && __put_user_#t~nondet1284#1 <= 2147483647; [2025-02-08 05:27:36,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543-3: __put_user_#res#1 := __put_user_#t~nondet1284#1; [2025-02-08 05:27:36,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543-2: havoc __put_user_#t~nondet1284#1; [2025-02-08 05:27:36,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6725-1: read_nvram_#res#1 := -14; [2025-02-08 05:27:36,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6636: havoc nvram_read_byte_#t~nondet1302#1; [2025-02-08 05:27:36,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6723-1: havoc read_nvram_#t~pre1325#1; [2025-02-08 05:27:36,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6723-5: read_nvram_~p~1#1.base, read_nvram_~p~1#1.offset := read_nvram_~p~1#1.base, 1 + read_nvram_~p~1#1.offset; [2025-02-08 05:27:36,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6723-4: havoc read_nvram_#t~pre1324#1.base, read_nvram_#t~pre1324#1.offset; [2025-02-08 05:27:36,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6723-3: read_nvram_#t~pre1325#1 := read_nvram_~count#1 - 1; [2025-02-08 05:27:36,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6723-2: read_nvram_~count#1 := read_nvram_~count#1 - 1; [2025-02-08 05:27:36,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6723-9: read_nvram_#t~pre1323#1 := 1 + read_nvram_~i~1#1; [2025-02-08 05:27:36,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6723-8: read_nvram_~i~1#1 := 1 + read_nvram_~i~1#1; [2025-02-08 05:27:36,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6723-7: havoc read_nvram_#t~pre1323#1; [2025-02-08 05:27:36,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6723-6: read_nvram_#t~pre1324#1.base, read_nvram_#t~pre1324#1.offset := read_nvram_~p~1#1.base, 1 + read_nvram_~p~1#1.offset; [2025-02-08 05:27:36,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6542: __put_user_~arg1#1.base, __put_user_~arg1#1.offset := __put_user_#in~arg1#1.base, __put_user_#in~arg1#1.offset; [2025-02-08 05:27:36,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6542-1: __put_user_~arg0#1 := __put_user_#in~arg0#1; [2025-02-08 05:27:36,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-2: assume 0 != read_nvram_#t~ret1322#1; [2025-02-08 05:27:36,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-2: assume !(0 != read_nvram_#t~ret1322#1); [2025-02-08 05:27:36,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724-1: havoc read_nvram_#t~ret1322#1; [2025-02-08 05:27:36,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724: havoc read_nvram_#t~ret1322#1; [2025-02-08 05:27:36,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6551: havoc access_ok_#t~nondet1286#1; [2025-02-08 05:27:36,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6741-3: assume { :end_inline___get_user } true;assume -2147483648 <= write_nvram_#t~ret1333#1 && write_nvram_#t~ret1333#1 <= 2147483647; [2025-02-08 05:27:36,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6741-2: havoc write_nvram_#t~ret1333#1; [2025-02-08 05:27:36,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6741-1: havoc write_nvram_#t~ret1333#1; [2025-02-08 05:27:36,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6741: assume 0 != write_nvram_#t~ret1333#1; [2025-02-08 05:27:36,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6741: assume !(0 != write_nvram_#t~ret1333#1); [2025-02-08 05:27:36,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6741-6: write_nvram_#t~ret1333#1 := __get_user_#res#1; [2025-02-08 05:27:36,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6741-5: havoc __get_user_#t~nondet1282#1, __get_user_~arg0#1, __get_user_~arg1#1.base, __get_user_~arg1#1.offset; [2025-02-08 05:27:36,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6741-4: havoc __get_user_#in~arg0#1, __get_user_#in~arg1#1.base, __get_user_#in~arg1#1.offset; [2025-02-08 05:27:36,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6535: havoc __get_user_#t~nondet1282#1; [2025-02-08 05:27:36,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6742-1: write_nvram_#res#1 := -14; [2025-02-08 05:27:36,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6743-1: havoc nvram_write_byte_#in~arg0#1, nvram_write_byte_#in~arg1#1; [2025-02-08 05:27:36,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6743: assume { :end_inline_nvram_write_byte } true;write_nvram_#t~pre1334#1 := 1 + write_nvram_~i~2#1; [2025-02-08 05:27:36,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6743-4: assume { :begin_inline_nvram_write_byte } true;nvram_write_byte_#in~arg0#1, nvram_write_byte_#in~arg1#1 := write_nvram_~c~4#1, (if write_nvram_~i~2#1 % 4294967296 % 4294967296 <= 2147483647 then write_nvram_~i~2#1 % 4294967296 % 4294967296 else write_nvram_~i~2#1 % 4294967296 % 4294967296 - 4294967296); [2025-02-08 05:27:36,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6743-3: havoc nvram_write_byte_~arg0#1, nvram_write_byte_~arg1#1; [2025-02-08 05:27:36,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6743-2: havoc nvram_write_byte_~arg0#1, nvram_write_byte_~arg1#1; [2025-02-08 05:27:36,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6740-2: write_nvram_~count#1 := write_nvram_~count#1 - 1; [2025-02-08 05:27:36,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6740-1: havoc write_nvram_#t~pre1336#1; [2025-02-08 05:27:36,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6740-6: write_nvram_#t~pre1335#1.base, write_nvram_#t~pre1335#1.offset := write_nvram_~p~2#1.base, 1 + write_nvram_~p~2#1.offset; [2025-02-08 05:27:36,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6740-5: write_nvram_~p~2#1.base, write_nvram_~p~2#1.offset := write_nvram_~p~2#1.base, 1 + write_nvram_~p~2#1.offset; [2025-02-08 05:27:36,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6740-4: havoc write_nvram_#t~pre1335#1.base, write_nvram_#t~pre1335#1.offset; [2025-02-08 05:27:36,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6641-1: nvram_write_byte_~arg0#1 := nvram_write_byte_#in~arg0#1; [2025-02-08 05:27:36,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6740-3: write_nvram_#t~pre1336#1 := write_nvram_~count#1 - 1; [2025-02-08 05:27:36,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6641: nvram_write_byte_~arg1#1 := nvram_write_byte_#in~arg1#1; [2025-02-08 05:27:36,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6740-8: write_nvram_~i~2#1 := 1 + write_nvram_~i~2#1; [2025-02-08 05:27:36,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6740-7: havoc write_nvram_#t~pre1334#1; [2025-02-08 05:27:36,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6632: havoc nvram_get_size_#t~nondet1301#1; [2025-02-08 05:27:36,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6650: havoc printk_#t~nondet1304#1; [2025-02-08 05:27:36,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6624: havoc misc_register_#t~nondet1299#1; [2025-02-08 05:27:36,994 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:27:36,994 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:27:37,011 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:27:37,011 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:27:37,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:27:37 BoogieIcfgContainer [2025-02-08 05:27:37,011 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:27:37,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:27:37,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:27:37,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:27:37,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:27:32" (1/3) ... [2025-02-08 05:27:37,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f574873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:27:37, skipping insertion in model container [2025-02-08 05:27:37,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:36" (2/3) ... [2025-02-08 05:27:37,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f574873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:27:37, skipping insertion in model container [2025-02-08 05:27:37,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:27:37" (3/3) ... [2025-02-08 05:27:37,021 INFO L128 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_read_nvram_write_nvram-race.i [2025-02-08 05:27:37,031 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:27:37,035 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG char_generic_nvram_read_nvram_write_nvram-race.i that has 3 procedures, 625 locations, 1 initial locations, 2 loop locations, and 45 error locations. [2025-02-08 05:27:37,035 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:27:37,179 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:27:37,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 631 places, 636 transitions, 1286 flow [2025-02-08 05:27:37,375 INFO L124 PetriNetUnfolderBase]: 12/634 cut-off events. [2025-02-08 05:27:37,377 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:27:37,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 634 events. 12/634 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 642 event pairs, 0 based on Foata normal form. 0/572 useless extension candidates. Maximal degree in co-relation 490. Up to 2 conditions per place. [2025-02-08 05:27:37,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 631 places, 636 transitions, 1286 flow [2025-02-08 05:27:37,391 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 624 places, 629 transitions, 1267 flow [2025-02-08 05:27:37,396 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:27:37,403 INFO L333 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=PETRI_NET, 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;@3a8acb6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:27:37,404 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2025-02-08 05:27:37,431 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:27:37,432 INFO L124 PetriNetUnfolderBase]: 0/87 cut-off events. [2025-02-08 05:27:37,432 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:27:37,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:37,433 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:37,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:37,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:37,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1166958089, now seen corresponding path program 1 times [2025-02-08 05:27:37,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:37,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932199610] [2025-02-08 05:27:37,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:37,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:37,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 05:27:37,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 05:27:37,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:37,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:37,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:37,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:37,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932199610] [2025-02-08 05:27:37,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932199610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:37,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:37,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:37,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658190041] [2025-02-08 05:27:37,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:37,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:37,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:37,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:37,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:37,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 636 [2025-02-08 05:27:37,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 629 transitions, 1267 flow. Second operand has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:37,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:37,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 636 [2025-02-08 05:27:37,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:37,975 INFO L124 PetriNetUnfolderBase]: 5/617 cut-off events. [2025-02-08 05:27:37,975 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-02-08 05:27:37,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 617 events. 5/617 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 566 event pairs, 0 based on Foata normal form. 10/571 useless extension candidates. Maximal degree in co-relation 488. Up to 7 conditions per place. [2025-02-08 05:27:37,981 INFO L140 encePairwiseOnDemand]: 626/636 looper letters, 6 selfloop transitions, 2 changer transitions 1/617 dead transitions. [2025-02-08 05:27:37,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 617 transitions, 1259 flow [2025-02-08 05:27:37,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:37,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1864 transitions. [2025-02-08 05:27:37,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9769392033542977 [2025-02-08 05:27:37,994 INFO L175 Difference]: Start difference. First operand has 624 places, 629 transitions, 1267 flow. Second operand 3 states and 1864 transitions. [2025-02-08 05:27:37,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 617 transitions, 1259 flow [2025-02-08 05:27:38,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 617 transitions, 1254 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:27:38,007 INFO L231 Difference]: Finished difference. Result has 618 places, 616 transitions, 1240 flow [2025-02-08 05:27:38,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1240, PETRI_PLACES=618, PETRI_TRANSITIONS=616} [2025-02-08 05:27:38,012 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -6 predicate places. [2025-02-08 05:27:38,012 INFO L471 AbstractCegarLoop]: Abstraction has has 618 places, 616 transitions, 1240 flow [2025-02-08 05:27:38,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:38,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:38,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:38,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:27:38,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:38,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:38,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1633682397, now seen corresponding path program 1 times [2025-02-08 05:27:38,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:38,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065015565] [2025-02-08 05:27:38,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:38,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:38,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:27:38,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:27:38,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:38,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:38,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:38,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065015565] [2025-02-08 05:27:38,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065015565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:38,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:38,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:38,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452244051] [2025-02-08 05:27:38,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:38,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:38,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:38,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:38,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:38,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 636 [2025-02-08 05:27:38,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 616 transitions, 1240 flow. Second operand has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:38,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:38,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 636 [2025-02-08 05:27:38,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:38,237 INFO L124 PetriNetUnfolderBase]: 8/754 cut-off events. [2025-02-08 05:27:38,237 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:27:38,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 754 events. 8/754 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1257 event pairs, 1 based on Foata normal form. 0/684 useless extension candidates. Maximal degree in co-relation 680. Up to 10 conditions per place. [2025-02-08 05:27:38,240 INFO L140 encePairwiseOnDemand]: 633/636 looper letters, 7 selfloop transitions, 2 changer transitions 0/615 dead transitions. [2025-02-08 05:27:38,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 615 transitions, 1256 flow [2025-02-08 05:27:38,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:38,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:38,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1855 transitions. [2025-02-08 05:27:38,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9722222222222222 [2025-02-08 05:27:38,243 INFO L175 Difference]: Start difference. First operand has 618 places, 616 transitions, 1240 flow. Second operand 3 states and 1855 transitions. [2025-02-08 05:27:38,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 615 transitions, 1256 flow [2025-02-08 05:27:38,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 615 transitions, 1252 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:38,249 INFO L231 Difference]: Finished difference. Result has 616 places, 615 transitions, 1238 flow [2025-02-08 05:27:38,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=614, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1238, PETRI_PLACES=616, PETRI_TRANSITIONS=615} [2025-02-08 05:27:38,251 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -8 predicate places. [2025-02-08 05:27:38,251 INFO L471 AbstractCegarLoop]: Abstraction has has 616 places, 615 transitions, 1238 flow [2025-02-08 05:27:38,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:38,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:38,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:38,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:27:38,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:38,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:38,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1968845736, now seen corresponding path program 1 times [2025-02-08 05:27:38,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:38,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895701784] [2025-02-08 05:27:38,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:38,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:38,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:27:38,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:27:38,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:38,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:38,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:38,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895701784] [2025-02-08 05:27:38,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895701784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:38,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:38,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:38,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366720315] [2025-02-08 05:27:38,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:38,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:38,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:38,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:38,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:38,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 636 [2025-02-08 05:27:38,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 615 transitions, 1238 flow. Second operand has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:38,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:38,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 636 [2025-02-08 05:27:38,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:38,441 INFO L124 PetriNetUnfolderBase]: 5/614 cut-off events. [2025-02-08 05:27:38,441 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:27:38,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 614 events. 5/614 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 557 event pairs, 0 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 528. Up to 7 conditions per place. [2025-02-08 05:27:38,445 INFO L140 encePairwiseOnDemand]: 633/636 looper letters, 6 selfloop transitions, 2 changer transitions 0/614 dead transitions. [2025-02-08 05:27:38,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 614 transitions, 1252 flow [2025-02-08 05:27:38,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:38,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:38,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1857 transitions. [2025-02-08 05:27:38,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732704402515723 [2025-02-08 05:27:38,450 INFO L175 Difference]: Start difference. First operand has 616 places, 615 transitions, 1238 flow. Second operand 3 states and 1857 transitions. [2025-02-08 05:27:38,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 614 transitions, 1252 flow [2025-02-08 05:27:38,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 614 transitions, 1248 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:38,456 INFO L231 Difference]: Finished difference. Result has 615 places, 614 transitions, 1236 flow [2025-02-08 05:27:38,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1232, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1236, PETRI_PLACES=615, PETRI_TRANSITIONS=614} [2025-02-08 05:27:38,458 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -9 predicate places. [2025-02-08 05:27:38,458 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 614 transitions, 1236 flow [2025-02-08 05:27:38,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:38,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:38,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:38,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:27:38,459 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:38,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:38,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1016835769, now seen corresponding path program 1 times [2025-02-08 05:27:38,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:38,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942094556] [2025-02-08 05:27:38,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:38,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:38,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 05:27:38,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 05:27:38,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:38,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:38,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:38,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:38,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942094556] [2025-02-08 05:27:38,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942094556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:38,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:38,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:38,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165073163] [2025-02-08 05:27:38,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:38,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:38,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:38,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:38,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:38,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 636 [2025-02-08 05:27:38,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 614 transitions, 1236 flow. Second operand has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:38,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:38,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 636 [2025-02-08 05:27:38,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:38,765 INFO L124 PetriNetUnfolderBase]: 8/746 cut-off events. [2025-02-08 05:27:38,765 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-08 05:27:38,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 746 events. 8/746 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 621 event pairs, 1 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 656. Up to 10 conditions per place. [2025-02-08 05:27:38,772 INFO L140 encePairwiseOnDemand]: 633/636 looper letters, 7 selfloop transitions, 2 changer transitions 0/613 dead transitions. [2025-02-08 05:27:38,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 613 transitions, 1252 flow [2025-02-08 05:27:38,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1855 transitions. [2025-02-08 05:27:38,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9722222222222222 [2025-02-08 05:27:38,776 INFO L175 Difference]: Start difference. First operand has 615 places, 614 transitions, 1236 flow. Second operand 3 states and 1855 transitions. [2025-02-08 05:27:38,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 613 transitions, 1252 flow [2025-02-08 05:27:38,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 613 transitions, 1248 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:38,788 INFO L231 Difference]: Finished difference. Result has 614 places, 613 transitions, 1234 flow [2025-02-08 05:27:38,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1234, PETRI_PLACES=614, PETRI_TRANSITIONS=613} [2025-02-08 05:27:38,789 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -10 predicate places. [2025-02-08 05:27:38,792 INFO L471 AbstractCegarLoop]: Abstraction has has 614 places, 613 transitions, 1234 flow [2025-02-08 05:27:38,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:38,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:38,794 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:38,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:27:38,794 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:38,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:38,794 INFO L85 PathProgramCache]: Analyzing trace with hash -909450719, now seen corresponding path program 1 times [2025-02-08 05:27:38,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:38,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194413490] [2025-02-08 05:27:38,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:38,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:38,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 05:27:38,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 05:27:38,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:38,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:38,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:38,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194413490] [2025-02-08 05:27:38,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194413490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:38,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:38,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:38,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879338391] [2025-02-08 05:27:38,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:38,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:38,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:38,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:38,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:38,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 636 [2025-02-08 05:27:38,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 613 transitions, 1234 flow. Second operand has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:38,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:38,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 636 [2025-02-08 05:27:38,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:39,031 INFO L124 PetriNetUnfolderBase]: 5/612 cut-off events. [2025-02-08 05:27:39,031 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:27:39,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 612 events. 5/612 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 552 event pairs, 0 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 512. Up to 7 conditions per place. [2025-02-08 05:27:39,035 INFO L140 encePairwiseOnDemand]: 633/636 looper letters, 6 selfloop transitions, 2 changer transitions 0/612 dead transitions. [2025-02-08 05:27:39,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 612 transitions, 1248 flow [2025-02-08 05:27:39,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1857 transitions. [2025-02-08 05:27:39,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732704402515723 [2025-02-08 05:27:39,039 INFO L175 Difference]: Start difference. First operand has 614 places, 613 transitions, 1234 flow. Second operand 3 states and 1857 transitions. [2025-02-08 05:27:39,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 612 transitions, 1248 flow [2025-02-08 05:27:39,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 612 transitions, 1244 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:39,045 INFO L231 Difference]: Finished difference. Result has 613 places, 612 transitions, 1232 flow [2025-02-08 05:27:39,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1228, PETRI_DIFFERENCE_MINUEND_PLACES=611, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1232, PETRI_PLACES=613, PETRI_TRANSITIONS=612} [2025-02-08 05:27:39,047 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -11 predicate places. [2025-02-08 05:27:39,048 INFO L471 AbstractCegarLoop]: Abstraction has has 613 places, 612 transitions, 1232 flow [2025-02-08 05:27:39,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:39,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:39,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:39,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:27:39,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:39,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:39,050 INFO L85 PathProgramCache]: Analyzing trace with hash -368727687, now seen corresponding path program 1 times [2025-02-08 05:27:39,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:39,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173160773] [2025-02-08 05:27:39,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:39,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:39,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:27:39,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:27:39,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:39,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:39,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:39,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:39,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173160773] [2025-02-08 05:27:39,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173160773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:39,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:39,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:39,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120782091] [2025-02-08 05:27:39,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:39,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:39,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:39,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:39,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:39,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 636 [2025-02-08 05:27:39,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 612 transitions, 1232 flow. Second operand has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:39,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:39,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 636 [2025-02-08 05:27:39,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:39,205 INFO L124 PetriNetUnfolderBase]: 5/611 cut-off events. [2025-02-08 05:27:39,206 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:27:39,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 611 events. 5/611 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 550 event pairs, 0 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 504. Up to 7 conditions per place. [2025-02-08 05:27:39,209 INFO L140 encePairwiseOnDemand]: 633/636 looper letters, 6 selfloop transitions, 2 changer transitions 0/611 dead transitions. [2025-02-08 05:27:39,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 611 transitions, 1246 flow [2025-02-08 05:27:39,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1857 transitions. [2025-02-08 05:27:39,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732704402515723 [2025-02-08 05:27:39,212 INFO L175 Difference]: Start difference. First operand has 613 places, 612 transitions, 1232 flow. Second operand 3 states and 1857 transitions. [2025-02-08 05:27:39,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 611 transitions, 1246 flow [2025-02-08 05:27:39,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 611 transitions, 1242 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:39,218 INFO L231 Difference]: Finished difference. Result has 612 places, 611 transitions, 1230 flow [2025-02-08 05:27:39,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1230, PETRI_PLACES=612, PETRI_TRANSITIONS=611} [2025-02-08 05:27:39,219 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -12 predicate places. [2025-02-08 05:27:39,219 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 611 transitions, 1230 flow [2025-02-08 05:27:39,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:39,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:39,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:39,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:27:39,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:39,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:39,221 INFO L85 PathProgramCache]: Analyzing trace with hash 999422362, now seen corresponding path program 1 times [2025-02-08 05:27:39,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:39,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908544758] [2025-02-08 05:27:39,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:39,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:39,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-08 05:27:39,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-08 05:27:39,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:39,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:39,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:39,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:39,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908544758] [2025-02-08 05:27:39,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908544758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:39,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:39,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:39,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846207064] [2025-02-08 05:27:39,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:39,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:39,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:39,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:39,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:39,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 636 [2025-02-08 05:27:39,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 611 transitions, 1230 flow. Second operand has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:39,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:39,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 636 [2025-02-08 05:27:39,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:39,351 INFO L124 PetriNetUnfolderBase]: 5/610 cut-off events. [2025-02-08 05:27:39,351 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:27:39,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 610 events. 5/610 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 546 event pairs, 0 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 496. Up to 7 conditions per place. [2025-02-08 05:27:39,355 INFO L140 encePairwiseOnDemand]: 633/636 looper letters, 6 selfloop transitions, 2 changer transitions 0/610 dead transitions. [2025-02-08 05:27:39,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 610 transitions, 1244 flow [2025-02-08 05:27:39,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:39,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1857 transitions. [2025-02-08 05:27:39,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732704402515723 [2025-02-08 05:27:39,359 INFO L175 Difference]: Start difference. First operand has 612 places, 611 transitions, 1230 flow. Second operand 3 states and 1857 transitions. [2025-02-08 05:27:39,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 610 transitions, 1244 flow [2025-02-08 05:27:39,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 610 transitions, 1240 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:39,365 INFO L231 Difference]: Finished difference. Result has 611 places, 610 transitions, 1228 flow [2025-02-08 05:27:39,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1228, PETRI_PLACES=611, PETRI_TRANSITIONS=610} [2025-02-08 05:27:39,366 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -13 predicate places. [2025-02-08 05:27:39,366 INFO L471 AbstractCegarLoop]: Abstraction has has 611 places, 610 transitions, 1228 flow [2025-02-08 05:27:39,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:39,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:39,368 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:39,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:27:39,368 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:39,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:39,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2071854821, now seen corresponding path program 1 times [2025-02-08 05:27:39,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:39,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56660974] [2025-02-08 05:27:39,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:39,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:39,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-08 05:27:39,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-08 05:27:39,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:39,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:39,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:39,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56660974] [2025-02-08 05:27:39,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56660974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:39,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:39,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:39,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443674491] [2025-02-08 05:27:39,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:39,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:39,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:39,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:39,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:39,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 636 [2025-02-08 05:27:39,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 610 transitions, 1228 flow. Second operand has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:39,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:39,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 636 [2025-02-08 05:27:39,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:39,523 INFO L124 PetriNetUnfolderBase]: 5/609 cut-off events. [2025-02-08 05:27:39,523 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:27:39,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 609 events. 5/609 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 543 event pairs, 0 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 488. Up to 7 conditions per place. [2025-02-08 05:27:39,527 INFO L140 encePairwiseOnDemand]: 633/636 looper letters, 6 selfloop transitions, 2 changer transitions 0/609 dead transitions. [2025-02-08 05:27:39,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 609 transitions, 1242 flow [2025-02-08 05:27:39,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:39,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:39,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1857 transitions. [2025-02-08 05:27:39,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732704402515723 [2025-02-08 05:27:39,531 INFO L175 Difference]: Start difference. First operand has 611 places, 610 transitions, 1228 flow. Second operand 3 states and 1857 transitions. [2025-02-08 05:27:39,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 609 transitions, 1242 flow [2025-02-08 05:27:39,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 609 transitions, 1238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:39,539 INFO L231 Difference]: Finished difference. Result has 610 places, 609 transitions, 1226 flow [2025-02-08 05:27:39,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1226, PETRI_PLACES=610, PETRI_TRANSITIONS=609} [2025-02-08 05:27:39,540 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -14 predicate places. [2025-02-08 05:27:39,540 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 609 transitions, 1226 flow [2025-02-08 05:27:39,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:39,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:39,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:39,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:27:39,541 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:39,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:39,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1327065085, now seen corresponding path program 1 times [2025-02-08 05:27:39,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:39,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942486885] [2025-02-08 05:27:39,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:39,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:39,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-08 05:27:39,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-08 05:27:39,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:39,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:39,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:39,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942486885] [2025-02-08 05:27:39,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942486885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:39,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:39,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:39,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49943989] [2025-02-08 05:27:39,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:39,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:39,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:39,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:39,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:39,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 636 [2025-02-08 05:27:39,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 609 transitions, 1226 flow. Second operand has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:39,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:39,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 636 [2025-02-08 05:27:39,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:39,702 INFO L124 PetriNetUnfolderBase]: 5/608 cut-off events. [2025-02-08 05:27:39,702 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:27:39,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 608 events. 5/608 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 539 event pairs, 0 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 480. Up to 7 conditions per place. [2025-02-08 05:27:39,707 INFO L140 encePairwiseOnDemand]: 633/636 looper letters, 6 selfloop transitions, 2 changer transitions 0/608 dead transitions. [2025-02-08 05:27:39,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 608 transitions, 1240 flow [2025-02-08 05:27:39,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:39,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1857 transitions. [2025-02-08 05:27:39,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732704402515723 [2025-02-08 05:27:39,711 INFO L175 Difference]: Start difference. First operand has 610 places, 609 transitions, 1226 flow. Second operand 3 states and 1857 transitions. [2025-02-08 05:27:39,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 611 places, 608 transitions, 1240 flow [2025-02-08 05:27:39,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 608 transitions, 1236 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:39,718 INFO L231 Difference]: Finished difference. Result has 609 places, 608 transitions, 1224 flow [2025-02-08 05:27:39,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1224, PETRI_PLACES=609, PETRI_TRANSITIONS=608} [2025-02-08 05:27:39,719 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -15 predicate places. [2025-02-08 05:27:39,720 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 608 transitions, 1224 flow [2025-02-08 05:27:39,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:39,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:39,721 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:39,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:27:39,721 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:39,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:39,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1397443477, now seen corresponding path program 1 times [2025-02-08 05:27:39,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:39,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683560770] [2025-02-08 05:27:39,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:39,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:39,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-08 05:27:39,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-08 05:27:39,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:39,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:39,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:39,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683560770] [2025-02-08 05:27:39,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683560770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:39,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:39,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:39,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669425076] [2025-02-08 05:27:39,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:39,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:39,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:39,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:39,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:39,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 636 [2025-02-08 05:27:39,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 608 transitions, 1224 flow. Second operand has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:39,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:39,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 636 [2025-02-08 05:27:39,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:39,851 INFO L124 PetriNetUnfolderBase]: 5/607 cut-off events. [2025-02-08 05:27:39,852 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:27:39,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 607 events. 5/607 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 537 event pairs, 0 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 472. Up to 7 conditions per place. [2025-02-08 05:27:39,855 INFO L140 encePairwiseOnDemand]: 633/636 looper letters, 6 selfloop transitions, 2 changer transitions 0/607 dead transitions. [2025-02-08 05:27:39,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 607 transitions, 1238 flow [2025-02-08 05:27:39,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:39,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1857 transitions. [2025-02-08 05:27:39,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732704402515723 [2025-02-08 05:27:39,858 INFO L175 Difference]: Start difference. First operand has 609 places, 608 transitions, 1224 flow. Second operand 3 states and 1857 transitions. [2025-02-08 05:27:39,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 607 transitions, 1238 flow [2025-02-08 05:27:39,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 607 transitions, 1234 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:39,865 INFO L231 Difference]: Finished difference. Result has 608 places, 607 transitions, 1222 flow [2025-02-08 05:27:39,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1222, PETRI_PLACES=608, PETRI_TRANSITIONS=607} [2025-02-08 05:27:39,866 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -16 predicate places. [2025-02-08 05:27:39,866 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 607 transitions, 1222 flow [2025-02-08 05:27:39,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:39,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:39,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:39,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:27:39,868 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:39,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:39,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1454421047, now seen corresponding path program 1 times [2025-02-08 05:27:39,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:39,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338038682] [2025-02-08 05:27:39,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:39,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:39,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-08 05:27:39,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-08 05:27:39,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:39,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:39,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:39,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338038682] [2025-02-08 05:27:39,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338038682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:39,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:39,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:39,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344139008] [2025-02-08 05:27:39,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:39,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:39,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:39,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:39,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:39,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 636 [2025-02-08 05:27:39,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 607 transitions, 1222 flow. Second operand has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:39,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:39,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 636 [2025-02-08 05:27:39,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:40,028 INFO L124 PetriNetUnfolderBase]: 5/606 cut-off events. [2025-02-08 05:27:40,028 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:27:40,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 606 events. 5/606 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 535 event pairs, 0 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 464. Up to 7 conditions per place. [2025-02-08 05:27:40,033 INFO L140 encePairwiseOnDemand]: 633/636 looper letters, 6 selfloop transitions, 2 changer transitions 0/606 dead transitions. [2025-02-08 05:27:40,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 606 transitions, 1236 flow [2025-02-08 05:27:40,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1857 transitions. [2025-02-08 05:27:40,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732704402515723 [2025-02-08 05:27:40,036 INFO L175 Difference]: Start difference. First operand has 608 places, 607 transitions, 1222 flow. Second operand 3 states and 1857 transitions. [2025-02-08 05:27:40,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 606 transitions, 1236 flow [2025-02-08 05:27:40,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 606 transitions, 1232 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:40,043 INFO L231 Difference]: Finished difference. Result has 607 places, 606 transitions, 1220 flow [2025-02-08 05:27:40,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1220, PETRI_PLACES=607, PETRI_TRANSITIONS=606} [2025-02-08 05:27:40,044 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -17 predicate places. [2025-02-08 05:27:40,044 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 606 transitions, 1220 flow [2025-02-08 05:27:40,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:40,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:40,045 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:40,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:27:40,045 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:40,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:40,046 INFO L85 PathProgramCache]: Analyzing trace with hash 844384674, now seen corresponding path program 1 times [2025-02-08 05:27:40,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:40,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242009249] [2025-02-08 05:27:40,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:40,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:40,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 05:27:40,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 05:27:40,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:40,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:40,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:40,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242009249] [2025-02-08 05:27:40,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242009249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:40,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:40,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:40,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595553660] [2025-02-08 05:27:40,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:40,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:40,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:40,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:40,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:40,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 636 [2025-02-08 05:27:40,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 606 transitions, 1220 flow. Second operand has 3 states, 3 states have (on average 615.3333333333334) internal successors, (1846), 3 states have internal predecessors, (1846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:40,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:40,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 636 [2025-02-08 05:27:40,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:40,213 INFO L124 PetriNetUnfolderBase]: 12/879 cut-off events. [2025-02-08 05:27:40,213 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:27:40,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 879 events. 12/879 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2064 event pairs, 3 based on Foata normal form. 0/806 useless extension candidates. Maximal degree in co-relation 740. Up to 15 conditions per place. [2025-02-08 05:27:40,218 INFO L140 encePairwiseOnDemand]: 633/636 looper letters, 8 selfloop transitions, 2 changer transitions 0/605 dead transitions. [2025-02-08 05:27:40,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 605 transitions, 1238 flow [2025-02-08 05:27:40,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:40,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1853 transitions. [2025-02-08 05:27:40,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9711740041928721 [2025-02-08 05:27:40,221 INFO L175 Difference]: Start difference. First operand has 607 places, 606 transitions, 1220 flow. Second operand 3 states and 1853 transitions. [2025-02-08 05:27:40,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 605 transitions, 1238 flow [2025-02-08 05:27:40,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 605 transitions, 1234 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:40,227 INFO L231 Difference]: Finished difference. Result has 606 places, 605 transitions, 1218 flow [2025-02-08 05:27:40,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1218, PETRI_PLACES=606, PETRI_TRANSITIONS=605} [2025-02-08 05:27:40,228 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -18 predicate places. [2025-02-08 05:27:40,228 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 605 transitions, 1218 flow [2025-02-08 05:27:40,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 615.3333333333334) internal successors, (1846), 3 states have internal predecessors, (1846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:40,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:40,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:40,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:27:40,230 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:40,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:40,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1662813114, now seen corresponding path program 1 times [2025-02-08 05:27:40,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:40,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975105831] [2025-02-08 05:27:40,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:40,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:40,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 05:27:40,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 05:27:40,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:40,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:40,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:40,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975105831] [2025-02-08 05:27:40,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975105831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:40,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:40,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:40,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456720142] [2025-02-08 05:27:40,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:40,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:40,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:40,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:40,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:40,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 636 [2025-02-08 05:27:40,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 605 transitions, 1218 flow. Second operand has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:40,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:40,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 636 [2025-02-08 05:27:40,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:40,411 INFO L124 PetriNetUnfolderBase]: 5/604 cut-off events. [2025-02-08 05:27:40,415 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:27:40,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 604 events. 5/604 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 528 event pairs, 0 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 448. Up to 7 conditions per place. [2025-02-08 05:27:40,420 INFO L140 encePairwiseOnDemand]: 633/636 looper letters, 6 selfloop transitions, 2 changer transitions 0/604 dead transitions. [2025-02-08 05:27:40,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 604 transitions, 1232 flow [2025-02-08 05:27:40,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1857 transitions. [2025-02-08 05:27:40,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732704402515723 [2025-02-08 05:27:40,427 INFO L175 Difference]: Start difference. First operand has 606 places, 605 transitions, 1218 flow. Second operand 3 states and 1857 transitions. [2025-02-08 05:27:40,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 604 transitions, 1232 flow [2025-02-08 05:27:40,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 604 transitions, 1228 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:40,440 INFO L231 Difference]: Finished difference. Result has 605 places, 604 transitions, 1216 flow [2025-02-08 05:27:40,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1212, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1216, PETRI_PLACES=605, PETRI_TRANSITIONS=604} [2025-02-08 05:27:40,448 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -19 predicate places. [2025-02-08 05:27:40,448 INFO L471 AbstractCegarLoop]: Abstraction has has 605 places, 604 transitions, 1216 flow [2025-02-08 05:27:40,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:40,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:40,449 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:40,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:27:40,449 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:40,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:40,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1731987722, now seen corresponding path program 1 times [2025-02-08 05:27:40,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:40,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568399277] [2025-02-08 05:27:40,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:40,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:40,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-08 05:27:40,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-08 05:27:40,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:40,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:40,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:40,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568399277] [2025-02-08 05:27:40,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568399277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:40,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:40,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:40,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993870328] [2025-02-08 05:27:40,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:40,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:40,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:40,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:40,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:40,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 636 [2025-02-08 05:27:40,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 604 transitions, 1216 flow. Second operand has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:40,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:40,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 636 [2025-02-08 05:27:40,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:40,644 INFO L124 PetriNetUnfolderBase]: 5/603 cut-off events. [2025-02-08 05:27:40,644 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:27:40,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 603 events. 5/603 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 526 event pairs, 0 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 440. Up to 7 conditions per place. [2025-02-08 05:27:40,648 INFO L140 encePairwiseOnDemand]: 633/636 looper letters, 6 selfloop transitions, 2 changer transitions 0/603 dead transitions. [2025-02-08 05:27:40,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 603 transitions, 1230 flow [2025-02-08 05:27:40,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1857 transitions. [2025-02-08 05:27:40,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732704402515723 [2025-02-08 05:27:40,651 INFO L175 Difference]: Start difference. First operand has 605 places, 604 transitions, 1216 flow. Second operand 3 states and 1857 transitions. [2025-02-08 05:27:40,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 603 transitions, 1230 flow [2025-02-08 05:27:40,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 603 transitions, 1226 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:40,656 INFO L231 Difference]: Finished difference. Result has 604 places, 603 transitions, 1214 flow [2025-02-08 05:27:40,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1214, PETRI_PLACES=604, PETRI_TRANSITIONS=603} [2025-02-08 05:27:40,657 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -20 predicate places. [2025-02-08 05:27:40,658 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 603 transitions, 1214 flow [2025-02-08 05:27:40,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:40,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:40,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:40,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:27:40,659 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:40,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:40,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1124572211, now seen corresponding path program 1 times [2025-02-08 05:27:40,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:40,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210018121] [2025-02-08 05:27:40,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:40,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:40,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 05:27:40,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 05:27:40,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:40,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:40,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:40,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:40,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210018121] [2025-02-08 05:27:40,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210018121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:40,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:40,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:40,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468225018] [2025-02-08 05:27:40,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:40,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:40,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:40,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:40,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:40,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 636 [2025-02-08 05:27:40,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 603 transitions, 1214 flow. Second operand has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:40,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:40,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 636 [2025-02-08 05:27:40,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:40,849 INFO L124 PetriNetUnfolderBase]: 5/602 cut-off events. [2025-02-08 05:27:40,850 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:27:40,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 602 events. 5/602 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 525 event pairs, 0 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 432. Up to 7 conditions per place. [2025-02-08 05:27:40,854 INFO L140 encePairwiseOnDemand]: 633/636 looper letters, 6 selfloop transitions, 2 changer transitions 0/602 dead transitions. [2025-02-08 05:27:40,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 602 transitions, 1228 flow [2025-02-08 05:27:40,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:40,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:40,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1857 transitions. [2025-02-08 05:27:40,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732704402515723 [2025-02-08 05:27:40,857 INFO L175 Difference]: Start difference. First operand has 604 places, 603 transitions, 1214 flow. Second operand 3 states and 1857 transitions. [2025-02-08 05:27:40,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 602 transitions, 1228 flow [2025-02-08 05:27:40,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 602 transitions, 1224 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:40,863 INFO L231 Difference]: Finished difference. Result has 603 places, 602 transitions, 1212 flow [2025-02-08 05:27:40,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1212, PETRI_PLACES=603, PETRI_TRANSITIONS=602} [2025-02-08 05:27:40,864 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -21 predicate places. [2025-02-08 05:27:40,864 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 602 transitions, 1212 flow [2025-02-08 05:27:40,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:40,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:40,866 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:40,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:27:40,866 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:40,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:40,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1577237193, now seen corresponding path program 1 times [2025-02-08 05:27:40,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:40,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136496944] [2025-02-08 05:27:40,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:40,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:40,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-08 05:27:40,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-08 05:27:40,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:40,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:40,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:40,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:40,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136496944] [2025-02-08 05:27:40,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136496944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:40,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:40,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:40,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625976361] [2025-02-08 05:27:40,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:40,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:40,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:40,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:40,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:40,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 636 [2025-02-08 05:27:40,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 602 transitions, 1212 flow. Second operand has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:40,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:40,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 636 [2025-02-08 05:27:40,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:41,116 INFO L124 PetriNetUnfolderBase]: 5/601 cut-off events. [2025-02-08 05:27:41,116 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:27:41,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 601 events. 5/601 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 525 event pairs, 0 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 424. Up to 7 conditions per place. [2025-02-08 05:27:41,123 INFO L140 encePairwiseOnDemand]: 633/636 looper letters, 6 selfloop transitions, 2 changer transitions 0/601 dead transitions. [2025-02-08 05:27:41,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 601 transitions, 1226 flow [2025-02-08 05:27:41,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:41,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:41,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1857 transitions. [2025-02-08 05:27:41,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732704402515723 [2025-02-08 05:27:41,131 INFO L175 Difference]: Start difference. First operand has 603 places, 602 transitions, 1212 flow. Second operand 3 states and 1857 transitions. [2025-02-08 05:27:41,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 601 transitions, 1226 flow [2025-02-08 05:27:41,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 601 transitions, 1222 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:41,141 INFO L231 Difference]: Finished difference. Result has 602 places, 601 transitions, 1210 flow [2025-02-08 05:27:41,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1210, PETRI_PLACES=602, PETRI_TRANSITIONS=601} [2025-02-08 05:27:41,146 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -22 predicate places. [2025-02-08 05:27:41,146 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 601 transitions, 1210 flow [2025-02-08 05:27:41,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:41,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:41,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:41,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:27:41,150 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:41,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:41,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1787618336, now seen corresponding path program 1 times [2025-02-08 05:27:41,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:41,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771034739] [2025-02-08 05:27:41,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:41,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:41,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-08 05:27:41,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-08 05:27:41,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:41,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:41,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:41,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:41,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771034739] [2025-02-08 05:27:41,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771034739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:41,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:41,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:41,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415158411] [2025-02-08 05:27:41,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:41,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:41,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:41,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:41,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:41,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 636 [2025-02-08 05:27:41,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 601 transitions, 1210 flow. Second operand has 3 states, 3 states have (on average 614.3333333333334) internal successors, (1843), 3 states have internal predecessors, (1843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:41,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:41,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 636 [2025-02-08 05:27:41,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:41,432 INFO L124 PetriNetUnfolderBase]: 12/862 cut-off events. [2025-02-08 05:27:41,433 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-08 05:27:41,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 889 conditions, 862 events. 12/862 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1303 event pairs, 3 based on Foata normal form. 0/794 useless extension candidates. Maximal degree in co-relation 689. Up to 16 conditions per place. [2025-02-08 05:27:41,437 INFO L140 encePairwiseOnDemand]: 633/636 looper letters, 9 selfloop transitions, 2 changer transitions 0/600 dead transitions. [2025-02-08 05:27:41,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 600 transitions, 1230 flow [2025-02-08 05:27:41,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:41,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:41,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1851 transitions. [2025-02-08 05:27:41,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.970125786163522 [2025-02-08 05:27:41,439 INFO L175 Difference]: Start difference. First operand has 602 places, 601 transitions, 1210 flow. Second operand 3 states and 1851 transitions. [2025-02-08 05:27:41,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 600 transitions, 1230 flow [2025-02-08 05:27:41,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 600 transitions, 1226 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:41,446 INFO L231 Difference]: Finished difference. Result has 601 places, 600 transitions, 1208 flow [2025-02-08 05:27:41,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1204, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1208, PETRI_PLACES=601, PETRI_TRANSITIONS=600} [2025-02-08 05:27:41,447 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -23 predicate places. [2025-02-08 05:27:41,447 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 600 transitions, 1208 flow [2025-02-08 05:27:41,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.3333333333334) internal successors, (1843), 3 states have internal predecessors, (1843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:41,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:41,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:41,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:27:41,452 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:41,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:41,453 INFO L85 PathProgramCache]: Analyzing trace with hash 777567852, now seen corresponding path program 1 times [2025-02-08 05:27:41,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:41,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078794014] [2025-02-08 05:27:41,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:41,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:41,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-08 05:27:41,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-08 05:27:41,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:41,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:41,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:41,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078794014] [2025-02-08 05:27:41,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078794014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:41,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:41,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:41,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600171073] [2025-02-08 05:27:41,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:41,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:41,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:41,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:41,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:41,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 636 [2025-02-08 05:27:41,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 600 transitions, 1208 flow. Second operand has 3 states, 3 states have (on average 614.0) internal successors, (1842), 3 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:41,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:41,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 636 [2025-02-08 05:27:41,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:41,759 INFO L124 PetriNetUnfolderBase]: 23/1237 cut-off events. [2025-02-08 05:27:41,760 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:27:41,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 1237 events. 23/1237 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3869 event pairs, 8 based on Foata normal form. 0/1140 useless extension candidates. Maximal degree in co-relation 1068. Up to 25 conditions per place. [2025-02-08 05:27:41,765 INFO L140 encePairwiseOnDemand]: 632/636 looper letters, 9 selfloop transitions, 1 changer transitions 0/597 dead transitions. [2025-02-08 05:27:41,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 597 transitions, 1222 flow [2025-02-08 05:27:41,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:41,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2025-02-08 05:27:41,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9706498951781971 [2025-02-08 05:27:41,768 INFO L175 Difference]: Start difference. First operand has 601 places, 600 transitions, 1208 flow. Second operand 3 states and 1852 transitions. [2025-02-08 05:27:41,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 597 transitions, 1222 flow [2025-02-08 05:27:41,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 597 transitions, 1218 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:41,774 INFO L231 Difference]: Finished difference. Result has 598 places, 597 transitions, 1200 flow [2025-02-08 05:27:41,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1200, PETRI_PLACES=598, PETRI_TRANSITIONS=597} [2025-02-08 05:27:41,775 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -26 predicate places. [2025-02-08 05:27:41,775 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 597 transitions, 1200 flow [2025-02-08 05:27:41,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.0) internal successors, (1842), 3 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:41,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:41,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:41,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:27:41,777 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:41,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:41,777 INFO L85 PathProgramCache]: Analyzing trace with hash -340118007, now seen corresponding path program 1 times [2025-02-08 05:27:41,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:41,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465349812] [2025-02-08 05:27:41,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:41,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:41,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:27:41,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:27:41,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:41,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:44,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:44,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465349812] [2025-02-08 05:27:44,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465349812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:44,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:44,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:27:44,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456636206] [2025-02-08 05:27:44,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:44,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:27:44,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:44,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:27:44,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:27:44,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 636 [2025-02-08 05:27:44,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 597 transitions, 1200 flow. Second operand has 10 states, 10 states have (on average 544.3) internal successors, (5443), 10 states have internal predecessors, (5443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:44,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:44,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 636 [2025-02-08 05:27:44,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:45,393 INFO L124 PetriNetUnfolderBase]: 1126/5261 cut-off events. [2025-02-08 05:27:45,394 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-02-08 05:27:45,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7589 conditions, 5261 events. 1126/5261 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 39965 event pairs, 1088 based on Foata normal form. 0/4828 useless extension candidates. Maximal degree in co-relation 7380. Up to 2249 conditions per place. [2025-02-08 05:27:45,414 INFO L140 encePairwiseOnDemand]: 626/636 looper letters, 72 selfloop transitions, 9 changer transitions 0/596 dead transitions. [2025-02-08 05:27:45,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 596 transitions, 1360 flow [2025-02-08 05:27:45,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:27:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:27:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5512 transitions. [2025-02-08 05:27:45,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2025-02-08 05:27:45,424 INFO L175 Difference]: Start difference. First operand has 598 places, 597 transitions, 1200 flow. Second operand 10 states and 5512 transitions. [2025-02-08 05:27:45,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 596 transitions, 1360 flow [2025-02-08 05:27:45,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 596 transitions, 1359 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:45,432 INFO L231 Difference]: Finished difference. Result has 605 places, 596 transitions, 1215 flow [2025-02-08 05:27:45,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1215, PETRI_PLACES=605, PETRI_TRANSITIONS=596} [2025-02-08 05:27:45,432 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -19 predicate places. [2025-02-08 05:27:45,433 INFO L471 AbstractCegarLoop]: Abstraction has has 605 places, 596 transitions, 1215 flow [2025-02-08 05:27:45,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 544.3) internal successors, (5443), 10 states have internal predecessors, (5443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:45,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:45,434 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:45,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:27:45,434 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:45,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:45,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1074791078, now seen corresponding path program 1 times [2025-02-08 05:27:45,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:45,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153942298] [2025-02-08 05:27:45,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:45,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:45,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-08 05:27:45,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-08 05:27:45,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:45,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:45,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:45,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:45,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153942298] [2025-02-08 05:27:45,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153942298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:45,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:45,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:45,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595923374] [2025-02-08 05:27:45,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:45,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:45,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:45,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:45,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:45,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 636 [2025-02-08 05:27:45,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 596 transitions, 1215 flow. Second operand has 3 states, 3 states have (on average 614.3333333333334) internal successors, (1843), 3 states have internal predecessors, (1843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:45,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:45,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 636 [2025-02-08 05:27:45,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:45,716 INFO L124 PetriNetUnfolderBase]: 12/861 cut-off events. [2025-02-08 05:27:45,717 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:27:45,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 861 events. 12/861 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1990 event pairs, 3 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 689. Up to 16 conditions per place. [2025-02-08 05:27:45,720 INFO L140 encePairwiseOnDemand]: 633/636 looper letters, 9 selfloop transitions, 2 changer transitions 0/595 dead transitions. [2025-02-08 05:27:45,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 595 transitions, 1235 flow [2025-02-08 05:27:45,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:45,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1851 transitions. [2025-02-08 05:27:45,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.970125786163522 [2025-02-08 05:27:45,723 INFO L175 Difference]: Start difference. First operand has 605 places, 596 transitions, 1215 flow. Second operand 3 states and 1851 transitions. [2025-02-08 05:27:45,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 595 transitions, 1235 flow [2025-02-08 05:27:45,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 595 transitions, 1217 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-02-08 05:27:45,729 INFO L231 Difference]: Finished difference. Result has 597 places, 595 transitions, 1199 flow [2025-02-08 05:27:45,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1199, PETRI_PLACES=597, PETRI_TRANSITIONS=595} [2025-02-08 05:27:45,730 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -27 predicate places. [2025-02-08 05:27:45,730 INFO L471 AbstractCegarLoop]: Abstraction has has 597 places, 595 transitions, 1199 flow [2025-02-08 05:27:45,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.3333333333334) internal successors, (1843), 3 states have internal predecessors, (1843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:45,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:45,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:45,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:27:45,731 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:45,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:45,731 INFO L85 PathProgramCache]: Analyzing trace with hash 604020429, now seen corresponding path program 1 times [2025-02-08 05:27:45,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:45,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132666335] [2025-02-08 05:27:45,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:45,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:45,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-08 05:27:45,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-08 05:27:45,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:45,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:45,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:45,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132666335] [2025-02-08 05:27:45,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132666335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:45,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:45,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:45,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857998070] [2025-02-08 05:27:45,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:45,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:45,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:45,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:45,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:45,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 636 [2025-02-08 05:27:45,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 595 transitions, 1199 flow. Second operand has 3 states, 3 states have (on average 614.0) internal successors, (1842), 3 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:45,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:45,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 636 [2025-02-08 05:27:45,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:45,916 INFO L124 PetriNetUnfolderBase]: 23/1230 cut-off events. [2025-02-08 05:27:45,916 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:27:45,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1269 conditions, 1230 events. 23/1230 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3870 event pairs, 8 based on Foata normal form. 0/1143 useless extension candidates. Maximal degree in co-relation 1063. Up to 25 conditions per place. [2025-02-08 05:27:45,922 INFO L140 encePairwiseOnDemand]: 632/636 looper letters, 9 selfloop transitions, 1 changer transitions 0/592 dead transitions. [2025-02-08 05:27:45,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 592 transitions, 1213 flow [2025-02-08 05:27:45,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:45,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2025-02-08 05:27:45,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9706498951781971 [2025-02-08 05:27:45,925 INFO L175 Difference]: Start difference. First operand has 597 places, 595 transitions, 1199 flow. Second operand 3 states and 1852 transitions. [2025-02-08 05:27:45,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 592 transitions, 1213 flow [2025-02-08 05:27:45,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 592 transitions, 1209 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:45,931 INFO L231 Difference]: Finished difference. Result has 594 places, 592 transitions, 1191 flow [2025-02-08 05:27:45,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=594, PETRI_TRANSITIONS=592} [2025-02-08 05:27:45,931 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -30 predicate places. [2025-02-08 05:27:45,932 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 592 transitions, 1191 flow [2025-02-08 05:27:45,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.0) internal successors, (1842), 3 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:45,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:45,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:45,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:27:45,933 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:45,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:45,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2070801707, now seen corresponding path program 1 times [2025-02-08 05:27:45,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:45,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436224307] [2025-02-08 05:27:45,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:45,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:45,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-08 05:27:45,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-08 05:27:45,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:45,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:46,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:46,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436224307] [2025-02-08 05:27:46,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436224307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:46,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:46,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:46,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038333549] [2025-02-08 05:27:46,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:46,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:46,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:46,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:46,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:46,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 636 [2025-02-08 05:27:46,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 592 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 620.6666666666666) internal successors, (1862), 3 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:46,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:46,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 636 [2025-02-08 05:27:46,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:46,104 INFO L124 PetriNetUnfolderBase]: 5/591 cut-off events. [2025-02-08 05:27:46,104 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:27:46,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 591 events. 5/591 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 505 event pairs, 0 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 398. Up to 5 conditions per place. [2025-02-08 05:27:46,107 INFO L140 encePairwiseOnDemand]: 634/636 looper letters, 4 selfloop transitions, 1 changer transitions 0/591 dead transitions. [2025-02-08 05:27:46,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 591 transitions, 1199 flow [2025-02-08 05:27:46,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:46,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:46,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1866 transitions. [2025-02-08 05:27:46,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9779874213836478 [2025-02-08 05:27:46,110 INFO L175 Difference]: Start difference. First operand has 594 places, 592 transitions, 1191 flow. Second operand 3 states and 1866 transitions. [2025-02-08 05:27:46,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 591 transitions, 1199 flow [2025-02-08 05:27:46,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 591 transitions, 1198 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:46,115 INFO L231 Difference]: Finished difference. Result has 594 places, 591 transitions, 1190 flow [2025-02-08 05:27:46,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1188, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1190, PETRI_PLACES=594, PETRI_TRANSITIONS=591} [2025-02-08 05:27:46,116 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -30 predicate places. [2025-02-08 05:27:46,116 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 591 transitions, 1190 flow [2025-02-08 05:27:46,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 620.6666666666666) internal successors, (1862), 3 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:46,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:46,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:46,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:27:46,117 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:46,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:46,118 INFO L85 PathProgramCache]: Analyzing trace with hash 233789283, now seen corresponding path program 1 times [2025-02-08 05:27:46,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:46,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258078836] [2025-02-08 05:27:46,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:46,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:46,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-02-08 05:27:46,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-02-08 05:27:46,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:46,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:46,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:46,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258078836] [2025-02-08 05:27:46,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258078836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:46,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:46,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:46,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782155204] [2025-02-08 05:27:46,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:46,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:46,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:46,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:46,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:46,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 610 out of 636 [2025-02-08 05:27:46,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 591 transitions, 1190 flow. Second operand has 3 states, 3 states have (on average 611.3333333333334) internal successors, (1834), 3 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:46,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:46,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 610 of 636 [2025-02-08 05:27:46,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:46,307 INFO L124 PetriNetUnfolderBase]: 18/947 cut-off events. [2025-02-08 05:27:46,307 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:27:46,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 947 events. 18/947 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2127 event pairs, 8 based on Foata normal form. 0/880 useless extension candidates. Maximal degree in co-relation 785. Up to 30 conditions per place. [2025-02-08 05:27:46,310 INFO L140 encePairwiseOnDemand]: 633/636 looper letters, 13 selfloop transitions, 2 changer transitions 0/590 dead transitions. [2025-02-08 05:27:46,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 590 transitions, 1218 flow [2025-02-08 05:27:46,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:46,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1846 transitions. [2025-02-08 05:27:46,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675052410901468 [2025-02-08 05:27:46,313 INFO L175 Difference]: Start difference. First operand has 594 places, 591 transitions, 1190 flow. Second operand 3 states and 1846 transitions. [2025-02-08 05:27:46,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 590 transitions, 1218 flow [2025-02-08 05:27:46,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 590 transitions, 1217 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:46,319 INFO L231 Difference]: Finished difference. Result has 594 places, 590 transitions, 1191 flow [2025-02-08 05:27:46,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=594, PETRI_TRANSITIONS=590} [2025-02-08 05:27:46,320 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -30 predicate places. [2025-02-08 05:27:46,321 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 590 transitions, 1191 flow [2025-02-08 05:27:46,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 611.3333333333334) internal successors, (1834), 3 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:46,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:46,321 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:46,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:27:46,322 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:46,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:46,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1334709363, now seen corresponding path program 1 times [2025-02-08 05:27:46,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:46,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736496930] [2025-02-08 05:27:46,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:46,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:46,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-02-08 05:27:46,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-02-08 05:27:46,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:46,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:46,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:46,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736496930] [2025-02-08 05:27:46,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736496930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:46,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:46,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:46,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78728890] [2025-02-08 05:27:46,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:46,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:46,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:46,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:46,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:46,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 636 [2025-02-08 05:27:46,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 590 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 607.0) internal successors, (1821), 3 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:46,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:46,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 636 [2025-02-08 05:27:46,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:46,598 INFO L124 PetriNetUnfolderBase]: 41/1441 cut-off events. [2025-02-08 05:27:46,598 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:27:46,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1534 conditions, 1441 events. 41/1441 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 5464 event pairs, 24 based on Foata normal form. 0/1340 useless extension candidates. Maximal degree in co-relation 1328. Up to 67 conditions per place. [2025-02-08 05:27:46,603 INFO L140 encePairwiseOnDemand]: 627/636 looper letters, 15 selfloop transitions, 4 changer transitions 0/589 dead transitions. [2025-02-08 05:27:46,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 589 transitions, 1230 flow [2025-02-08 05:27:46,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:46,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1842 transitions. [2025-02-08 05:27:46,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9654088050314465 [2025-02-08 05:27:46,606 INFO L175 Difference]: Start difference. First operand has 594 places, 590 transitions, 1191 flow. Second operand 3 states and 1842 transitions. [2025-02-08 05:27:46,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 589 transitions, 1230 flow [2025-02-08 05:27:46,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 589 transitions, 1226 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:46,615 INFO L231 Difference]: Finished difference. Result has 590 places, 587 transitions, 1197 flow [2025-02-08 05:27:46,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1197, PETRI_PLACES=590, PETRI_TRANSITIONS=587} [2025-02-08 05:27:46,616 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -34 predicate places. [2025-02-08 05:27:46,616 INFO L471 AbstractCegarLoop]: Abstraction has has 590 places, 587 transitions, 1197 flow [2025-02-08 05:27:46,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 607.0) internal successors, (1821), 3 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:46,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:46,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:46,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:27:46,617 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:46,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:46,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1072459015, now seen corresponding path program 1 times [2025-02-08 05:27:46,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:46,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115150756] [2025-02-08 05:27:46,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:46,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:46,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-02-08 05:27:46,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-02-08 05:27:46,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:46,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:46,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:46,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115150756] [2025-02-08 05:27:46,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115150756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:46,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:46,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:46,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520391829] [2025-02-08 05:27:46,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:46,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:46,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:46,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:46,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:46,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 636 [2025-02-08 05:27:46,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 587 transitions, 1197 flow. Second operand has 3 states, 3 states have (on average 613.0) internal successors, (1839), 3 states have internal predecessors, (1839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:46,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:46,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 636 [2025-02-08 05:27:46,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:46,813 INFO L124 PetriNetUnfolderBase]: 20/1068 cut-off events. [2025-02-08 05:27:46,813 INFO L125 PetriNetUnfolderBase]: For 15/16 co-relation queries the response was YES. [2025-02-08 05:27:46,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 1068 events. 20/1068 cut-off events. For 15/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2721 event pairs, 8 based on Foata normal form. 0/1004 useless extension candidates. Maximal degree in co-relation 931. Up to 35 conditions per place. [2025-02-08 05:27:46,817 INFO L140 encePairwiseOnDemand]: 633/636 looper letters, 15 selfloop transitions, 2 changer transitions 0/587 dead transitions. [2025-02-08 05:27:46,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 587 transitions, 1231 flow [2025-02-08 05:27:46,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:46,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1849 transitions. [2025-02-08 05:27:46,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9690775681341719 [2025-02-08 05:27:46,820 INFO L175 Difference]: Start difference. First operand has 590 places, 587 transitions, 1197 flow. Second operand 3 states and 1849 transitions. [2025-02-08 05:27:46,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 587 transitions, 1231 flow [2025-02-08 05:27:46,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 590 places, 587 transitions, 1227 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:46,829 INFO L231 Difference]: Finished difference. Result has 591 places, 587 transitions, 1201 flow [2025-02-08 05:27:46,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1201, PETRI_PLACES=591, PETRI_TRANSITIONS=587} [2025-02-08 05:27:46,829 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -33 predicate places. [2025-02-08 05:27:46,829 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 587 transitions, 1201 flow [2025-02-08 05:27:46,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 613.0) internal successors, (1839), 3 states have internal predecessors, (1839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:46,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:46,830 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:46,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:27:46,830 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:46,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:46,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1317530498, now seen corresponding path program 1 times [2025-02-08 05:27:46,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:46,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507164243] [2025-02-08 05:27:46,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:46,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:46,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-08 05:27:46,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-08 05:27:46,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:46,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:46,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:46,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:46,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507164243] [2025-02-08 05:27:46,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507164243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:46,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:46,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:46,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470979690] [2025-02-08 05:27:46,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:46,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:46,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:46,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:46,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:46,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 619 out of 636 [2025-02-08 05:27:46,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 587 transitions, 1201 flow. Second operand has 3 states, 3 states have (on average 620.3333333333334) internal successors, (1861), 3 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:46,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:46,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 619 of 636 [2025-02-08 05:27:46,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:47,023 INFO L124 PetriNetUnfolderBase]: 15/984 cut-off events. [2025-02-08 05:27:47,023 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:27:47,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 984 events. 15/984 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2578 event pairs, 1 based on Foata normal form. 0/932 useless extension candidates. Maximal degree in co-relation 829. Up to 13 conditions per place. [2025-02-08 05:27:47,028 INFO L140 encePairwiseOnDemand]: 634/636 looper letters, 6 selfloop transitions, 1 changer transitions 0/587 dead transitions. [2025-02-08 05:27:47,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 587 transitions, 1217 flow [2025-02-08 05:27:47,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:47,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:47,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1865 transitions. [2025-02-08 05:27:47,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9774633123689728 [2025-02-08 05:27:47,031 INFO L175 Difference]: Start difference. First operand has 591 places, 587 transitions, 1201 flow. Second operand 3 states and 1865 transitions. [2025-02-08 05:27:47,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 587 transitions, 1217 flow [2025-02-08 05:27:47,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 587 transitions, 1215 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:47,037 INFO L231 Difference]: Finished difference. Result has 591 places, 586 transitions, 1199 flow [2025-02-08 05:27:47,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1199, PETRI_PLACES=591, PETRI_TRANSITIONS=586} [2025-02-08 05:27:47,038 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -33 predicate places. [2025-02-08 05:27:47,038 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 586 transitions, 1199 flow [2025-02-08 05:27:47,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 620.3333333333334) internal successors, (1861), 3 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:47,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:47,039 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:47,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:27:47,039 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:47,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:47,040 INFO L85 PathProgramCache]: Analyzing trace with hash 868590463, now seen corresponding path program 1 times [2025-02-08 05:27:47,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:47,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974576973] [2025-02-08 05:27:47,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:47,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:47,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-02-08 05:27:47,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-02-08 05:27:47,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:47,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:47,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:47,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:47,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974576973] [2025-02-08 05:27:47,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974576973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:47,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:47,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:47,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323539810] [2025-02-08 05:27:47,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:47,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:47,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:47,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:47,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:47,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 636 [2025-02-08 05:27:47,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 586 transitions, 1199 flow. Second operand has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:47,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:47,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 636 [2025-02-08 05:27:47,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:47,276 INFO L124 PetriNetUnfolderBase]: 36/1636 cut-off events. [2025-02-08 05:27:47,276 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:27:47,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1722 conditions, 1636 events. 36/1636 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 6888 event pairs, 9 based on Foata normal form. 0/1545 useless extension candidates. Maximal degree in co-relation 1513. Up to 37 conditions per place. [2025-02-08 05:27:47,283 INFO L140 encePairwiseOnDemand]: 632/636 looper letters, 9 selfloop transitions, 2 changer transitions 0/587 dead transitions. [2025-02-08 05:27:47,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 587 transitions, 1225 flow [2025-02-08 05:27:47,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:47,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2025-02-08 05:27:47,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9753668763102725 [2025-02-08 05:27:47,286 INFO L175 Difference]: Start difference. First operand has 591 places, 586 transitions, 1199 flow. Second operand 3 states and 1861 transitions. [2025-02-08 05:27:47,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 587 transitions, 1225 flow [2025-02-08 05:27:47,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 590 places, 587 transitions, 1224 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:47,291 INFO L231 Difference]: Finished difference. Result has 591 places, 586 transitions, 1208 flow [2025-02-08 05:27:47,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1208, PETRI_PLACES=591, PETRI_TRANSITIONS=586} [2025-02-08 05:27:47,292 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -33 predicate places. [2025-02-08 05:27:47,292 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 586 transitions, 1208 flow [2025-02-08 05:27:47,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:47,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:47,293 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:47,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:27:47,293 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:47,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:47,294 INFO L85 PathProgramCache]: Analyzing trace with hash -337302378, now seen corresponding path program 1 times [2025-02-08 05:27:47,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:47,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760166560] [2025-02-08 05:27:47,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:47,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:47,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-08 05:27:47,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-08 05:27:47,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:47,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:47,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:47,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760166560] [2025-02-08 05:27:47,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760166560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:47,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:47,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:47,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482994319] [2025-02-08 05:27:47,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:47,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:47,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:47,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:47,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:47,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 619 out of 636 [2025-02-08 05:27:47,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 586 transitions, 1208 flow. Second operand has 3 states, 3 states have (on average 620.6666666666666) internal successors, (1862), 3 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:47,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:47,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 619 of 636 [2025-02-08 05:27:47,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:47,539 INFO L124 PetriNetUnfolderBase]: 18/1091 cut-off events. [2025-02-08 05:27:47,539 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-02-08 05:27:47,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 1091 events. 18/1091 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2671 event pairs, 3 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 940. Up to 10 conditions per place. [2025-02-08 05:27:47,544 INFO L140 encePairwiseOnDemand]: 634/636 looper letters, 6 selfloop transitions, 1 changer transitions 0/586 dead transitions. [2025-02-08 05:27:47,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 586 transitions, 1223 flow [2025-02-08 05:27:47,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:47,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1865 transitions. [2025-02-08 05:27:47,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9774633123689728 [2025-02-08 05:27:47,548 INFO L175 Difference]: Start difference. First operand has 591 places, 586 transitions, 1208 flow. Second operand 3 states and 1865 transitions. [2025-02-08 05:27:47,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 586 transitions, 1223 flow [2025-02-08 05:27:47,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 586 transitions, 1223 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:27:47,554 INFO L231 Difference]: Finished difference. Result has 592 places, 585 transitions, 1208 flow [2025-02-08 05:27:47,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=590, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1208, PETRI_PLACES=592, PETRI_TRANSITIONS=585} [2025-02-08 05:27:47,554 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -32 predicate places. [2025-02-08 05:27:47,554 INFO L471 AbstractCegarLoop]: Abstraction has has 592 places, 585 transitions, 1208 flow [2025-02-08 05:27:47,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 620.6666666666666) internal successors, (1862), 3 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:47,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:47,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:47,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:27:47,556 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:47,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:47,557 INFO L85 PathProgramCache]: Analyzing trace with hash -482018544, now seen corresponding path program 1 times [2025-02-08 05:27:47,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:47,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837491465] [2025-02-08 05:27:47,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:47,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:47,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-02-08 05:27:47,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-02-08 05:27:47,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:47,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:49,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:49,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:49,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837491465] [2025-02-08 05:27:49,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837491465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:49,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:49,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:27:49,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825981461] [2025-02-08 05:27:49,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:49,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:27:49,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:49,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:27:49,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:27:49,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 636 [2025-02-08 05:27:49,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 585 transitions, 1208 flow. Second operand has 10 states, 10 states have (on average 567.0) internal successors, (5670), 10 states have internal predecessors, (5670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:49,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:49,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 636 [2025-02-08 05:27:49,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:50,604 INFO L124 PetriNetUnfolderBase]: 660/4313 cut-off events. [2025-02-08 05:27:50,605 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:27:50,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5866 conditions, 4313 events. 660/4313 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 29177 event pairs, 120 based on Foata normal form. 0/4060 useless extension candidates. Maximal degree in co-relation 5657. Up to 964 conditions per place. [2025-02-08 05:27:50,619 INFO L140 encePairwiseOnDemand]: 596/636 looper letters, 74 selfloop transitions, 93 changer transitions 0/691 dead transitions. [2025-02-08 05:27:50,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 691 transitions, 1770 flow [2025-02-08 05:27:50,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:27:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:27:50,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5820 transitions. [2025-02-08 05:27:50,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9150943396226415 [2025-02-08 05:27:50,627 INFO L175 Difference]: Start difference. First operand has 592 places, 585 transitions, 1208 flow. Second operand 10 states and 5820 transitions. [2025-02-08 05:27:50,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 691 transitions, 1770 flow [2025-02-08 05:27:50,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 691 transitions, 1769 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:50,635 INFO L231 Difference]: Finished difference. Result has 609 places, 676 transitions, 1837 flow [2025-02-08 05:27:50,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=591, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1837, PETRI_PLACES=609, PETRI_TRANSITIONS=676} [2025-02-08 05:27:50,637 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, -15 predicate places. [2025-02-08 05:27:50,637 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 676 transitions, 1837 flow [2025-02-08 05:27:50,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 567.0) internal successors, (5670), 10 states have internal predecessors, (5670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:50,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:50,638 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:50,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 05:27:50,638 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:50,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:50,639 INFO L85 PathProgramCache]: Analyzing trace with hash 809593068, now seen corresponding path program 1 times [2025-02-08 05:27:50,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:50,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569497965] [2025-02-08 05:27:50,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:50,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:50,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-02-08 05:27:50,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-02-08 05:27:50,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:50,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:51,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:51,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569497965] [2025-02-08 05:27:51,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569497965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:51,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:51,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:27:51,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838322499] [2025-02-08 05:27:51,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:51,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:27:51,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:51,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:27:51,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:27:52,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 636 [2025-02-08 05:27:52,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 676 transitions, 1837 flow. Second operand has 10 states, 10 states have (on average 567.1) internal successors, (5671), 10 states have internal predecessors, (5671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:52,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:52,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 636 [2025-02-08 05:27:52,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:53,659 INFO L124 PetriNetUnfolderBase]: 1019/5357 cut-off events. [2025-02-08 05:27:53,660 INFO L125 PetriNetUnfolderBase]: For 1001/1057 co-relation queries the response was YES. [2025-02-08 05:27:53,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9555 conditions, 5357 events. 1019/5357 cut-off events. For 1001/1057 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 42417 event pairs, 195 based on Foata normal form. 3/5123 useless extension candidates. Maximal degree in co-relation 9338. Up to 1467 conditions per place. [2025-02-08 05:27:53,707 INFO L140 encePairwiseOnDemand]: 596/636 looper letters, 139 selfloop transitions, 109 changer transitions 0/798 dead transitions. [2025-02-08 05:27:53,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 798 transitions, 2667 flow [2025-02-08 05:27:53,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:27:53,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:27:53,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5820 transitions. [2025-02-08 05:27:53,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9150943396226415 [2025-02-08 05:27:53,713 INFO L175 Difference]: Start difference. First operand has 609 places, 676 transitions, 1837 flow. Second operand 10 states and 5820 transitions. [2025-02-08 05:27:53,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 798 transitions, 2667 flow [2025-02-08 05:27:53,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 798 transitions, 2667 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:27:53,729 INFO L231 Difference]: Finished difference. Result has 627 places, 783 transitions, 2663 flow [2025-02-08 05:27:53,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1837, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2663, PETRI_PLACES=627, PETRI_TRANSITIONS=783} [2025-02-08 05:27:53,730 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, 3 predicate places. [2025-02-08 05:27:53,731 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 783 transitions, 2663 flow [2025-02-08 05:27:53,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 567.1) internal successors, (5671), 10 states have internal predecessors, (5671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:53,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:53,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:53,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 05:27:53,732 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:53,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:53,733 INFO L85 PathProgramCache]: Analyzing trace with hash -650590099, now seen corresponding path program 1 times [2025-02-08 05:27:53,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:53,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419314359] [2025-02-08 05:27:53,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:53,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:53,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-02-08 05:27:53,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-02-08 05:27:53,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:53,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:55,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:55,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419314359] [2025-02-08 05:27:55,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419314359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:55,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:55,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:27:55,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094075024] [2025-02-08 05:27:55,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:55,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:27:55,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:55,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:27:55,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:27:55,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 636 [2025-02-08 05:27:55,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 783 transitions, 2663 flow. Second operand has 10 states, 10 states have (on average 544.9) internal successors, (5449), 10 states have internal predecessors, (5449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:55,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:55,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 636 [2025-02-08 05:27:55,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:58,623 INFO L124 PetriNetUnfolderBase]: 3200/11979 cut-off events. [2025-02-08 05:27:58,623 INFO L125 PetriNetUnfolderBase]: For 6336/6737 co-relation queries the response was YES. [2025-02-08 05:27:58,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28242 conditions, 11979 events. 3200/11979 cut-off events. For 6336/6737 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 106074 event pairs, 1314 based on Foata normal form. 44/11486 useless extension candidates. Maximal degree in co-relation 28016. Up to 5940 conditions per place. [2025-02-08 05:27:58,680 INFO L140 encePairwiseOnDemand]: 593/636 looper letters, 269 selfloop transitions, 320 changer transitions 7/1100 dead transitions. [2025-02-08 05:27:58,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 1100 transitions, 5271 flow [2025-02-08 05:27:58,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:27:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:27:58,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5769 transitions. [2025-02-08 05:27:58,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9070754716981132 [2025-02-08 05:27:58,684 INFO L175 Difference]: Start difference. First operand has 627 places, 783 transitions, 2663 flow. Second operand 10 states and 5769 transitions. [2025-02-08 05:27:58,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 1100 transitions, 5271 flow [2025-02-08 05:27:58,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 1100 transitions, 5271 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:27:58,726 INFO L231 Difference]: Finished difference. Result has 645 places, 1085 transitions, 5429 flow [2025-02-08 05:27:58,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=2663, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=783, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5429, PETRI_PLACES=645, PETRI_TRANSITIONS=1085} [2025-02-08 05:27:58,727 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, 21 predicate places. [2025-02-08 05:27:58,727 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 1085 transitions, 5429 flow [2025-02-08 05:27:58,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 544.9) internal successors, (5449), 10 states have internal predecessors, (5449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:58,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:58,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:58,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 05:27:58,729 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:27:58,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:58,730 INFO L85 PathProgramCache]: Analyzing trace with hash -340496190, now seen corresponding path program 1 times [2025-02-08 05:27:58,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:58,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823624850] [2025-02-08 05:27:58,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:58,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:58,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-02-08 05:27:58,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-02-08 05:27:58,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:58,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:00,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:00,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823624850] [2025-02-08 05:28:00,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823624850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:00,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:00,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:28:00,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18006435] [2025-02-08 05:28:00,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:00,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:28:00,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:00,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:28:00,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:28:00,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 636 [2025-02-08 05:28:00,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 1085 transitions, 5429 flow. Second operand has 10 states, 10 states have (on average 545.0) internal successors, (5450), 10 states have internal predecessors, (5450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:00,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:00,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 636 [2025-02-08 05:28:00,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:03,900 INFO L124 PetriNetUnfolderBase]: 3770/13220 cut-off events. [2025-02-08 05:28:03,900 INFO L125 PetriNetUnfolderBase]: For 11826/12169 co-relation queries the response was YES. [2025-02-08 05:28:03,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36209 conditions, 13220 events. 3770/13220 cut-off events. For 11826/12169 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 119266 event pairs, 1291 based on Foata normal form. 18/12681 useless extension candidates. Maximal degree in co-relation 35974. Up to 6785 conditions per place. [2025-02-08 05:28:04,011 INFO L140 encePairwiseOnDemand]: 593/636 looper letters, 545 selfloop transitions, 350 changer transitions 15/1416 dead transitions. [2025-02-08 05:28:04,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 1416 transitions, 8959 flow [2025-02-08 05:28:04,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:28:04,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:28:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5769 transitions. [2025-02-08 05:28:04,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9070754716981132 [2025-02-08 05:28:04,017 INFO L175 Difference]: Start difference. First operand has 645 places, 1085 transitions, 5429 flow. Second operand 10 states and 5769 transitions. [2025-02-08 05:28:04,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 1416 transitions, 8959 flow [2025-02-08 05:28:04,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 1416 transitions, 8507 flow, removed 226 selfloop flow, removed 0 redundant places. [2025-02-08 05:28:04,116 INFO L231 Difference]: Finished difference. Result has 663 places, 1401 transitions, 8193 flow [2025-02-08 05:28:04,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=4991, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1085, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=973, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8193, PETRI_PLACES=663, PETRI_TRANSITIONS=1401} [2025-02-08 05:28:04,117 INFO L279 CegarLoopForPetriNet]: 624 programPoint places, 39 predicate places. [2025-02-08 05:28:04,117 INFO L471 AbstractCegarLoop]: Abstraction has has 663 places, 1401 transitions, 8193 flow [2025-02-08 05:28:04,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 545.0) internal successors, (5450), 10 states have internal predecessors, (5450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:04,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:04,118 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:04,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 05:28:04,118 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:04,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:04,120 INFO L85 PathProgramCache]: Analyzing trace with hash -867444584, now seen corresponding path program 1 times [2025-02-08 05:28:04,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:04,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100450763] [2025-02-08 05:28:04,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:04,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:04,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-02-08 05:28:04,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-02-08 05:28:04,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:04,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:28:04,213 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:28:04,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-02-08 05:28:04,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-02-08 05:28:04,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:04,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:28:04,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:28:04,580 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:28:04,580 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE (66 of 67 remaining) [2025-02-08 05:28:04,581 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE (65 of 67 remaining) [2025-02-08 05:28:04,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE (64 of 67 remaining) [2025-02-08 05:28:04,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (63 of 67 remaining) [2025-02-08 05:28:04,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr6ASSERT_VIOLATIONDATA_RACE (62 of 67 remaining) [2025-02-08 05:28:04,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE (61 of 67 remaining) [2025-02-08 05:28:04,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE (60 of 67 remaining) [2025-02-08 05:28:04,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr3ASSERT_VIOLATIONDATA_RACE (59 of 67 remaining) [2025-02-08 05:28:04,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (58 of 67 remaining) [2025-02-08 05:28:04,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE (57 of 67 remaining) [2025-02-08 05:28:04,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE (56 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE (55 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE (54 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (53 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr6ASSERT_VIOLATIONDATA_RACE (52 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE (51 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr4ASSERT_VIOLATIONDATA_RACE (50 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr3ASSERT_VIOLATIONDATA_RACE (49 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (48 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE (47 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE (46 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (45 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (44 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (43 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (42 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (41 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (40 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (39 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (38 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (37 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (36 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (35 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (34 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (33 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (32 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (30 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (29 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 67 remaining) [2025-02-08 05:28:04,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE (18 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE (17 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (16 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr6ASSERT_VIOLATIONDATA_RACE (15 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE (14 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr3ASSERT_VIOLATIONDATA_RACE (13 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (12 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE (11 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE (10 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE (9 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE (8 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (7 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr6ASSERT_VIOLATIONDATA_RACE (6 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE (5 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr4ASSERT_VIOLATIONDATA_RACE (4 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr3ASSERT_VIOLATIONDATA_RACE (3 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (2 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE (1 of 67 remaining) [2025-02-08 05:28:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE (0 of 67 remaining) [2025-02-08 05:28:04,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 05:28:04,585 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:05,167 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:28:05,167 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:28:05,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:28:05 BasicIcfg [2025-02-08 05:28:05,172 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:28:05,172 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:28:05,173 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:28:05,173 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:28:05,173 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:27:37" (3/4) ... [2025-02-08 05:28:05,174 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 05:28:05,593 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 25. [2025-02-08 05:28:05,642 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:28:05,646 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:28:05,646 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:28:05,647 INFO L158 Benchmark]: Toolchain (without parser) took 33169.73ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 95.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-02-08 05:28:05,647 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:28:05,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3555.15ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 95.0MB in the beginning and 226.4MB in the end (delta: -131.4MB). Peak memory consumption was 208.7MB. Max. memory is 16.1GB. [2025-02-08 05:28:05,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 121.86ms. Allocated memory is still 310.4MB. Free memory was 226.4MB in the beginning and 210.2MB in the end (delta: 16.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:28:05,647 INFO L158 Benchmark]: Boogie Preprocessor took 44.94ms. Allocated memory is still 310.4MB. Free memory was 210.2MB in the beginning and 204.5MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:28:05,648 INFO L158 Benchmark]: IcfgBuilder took 810.04ms. Allocated memory is still 310.4MB. Free memory was 204.5MB in the beginning and 140.2MB in the end (delta: 64.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-08 05:28:05,648 INFO L158 Benchmark]: TraceAbstraction took 28159.27ms. Allocated memory was 310.4MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 140.2MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2025-02-08 05:28:05,648 INFO L158 Benchmark]: Witness Printer took 473.59ms. Allocated memory is still 2.4GB. Free memory was 1.6GB in the beginning and 1.1GB in the end (delta: 503.3MB). Peak memory consumption was 503.3MB. Max. memory is 16.1GB. [2025-02-08 05:28:05,650 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.18ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3555.15ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 95.0MB in the beginning and 226.4MB in the end (delta: -131.4MB). Peak memory consumption was 208.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 121.86ms. Allocated memory is still 310.4MB. Free memory was 226.4MB in the beginning and 210.2MB in the end (delta: 16.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.94ms. Allocated memory is still 310.4MB. Free memory was 210.2MB in the beginning and 204.5MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 810.04ms. Allocated memory is still 310.4MB. Free memory was 204.5MB in the beginning and 140.2MB in the end (delta: 64.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * TraceAbstraction took 28159.27ms. Allocated memory was 310.4MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 140.2MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 473.59ms. Allocated memory is still 2.4GB. Free memory was 1.6GB in the beginning and 1.1GB in the end (delta: 503.3MB). Peak memory consumption was 503.3MB. 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: - DataRaceFoundResult [Line: 6721]: Data race detected Data race detected The following path leads to a data race: [L247] 0 unsigned long jiffies; VAL [jiffies=0] [L6522] 0 const unsigned int default_alloc_size = 4; VAL [default_alloc_size=4, jiffies=0] [L6692] 0 static struct mutex nvram_mutex = { 1, 0 }; VAL [default_alloc_size=4, jiffies=0, nvram_mutex={7:0}] [L6693] 0 static ssize_t nvram_len; VAL [default_alloc_size=4, jiffies=0, nvram_len=0, nvram_mutex={7:0}] [L6768-L6774] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; VAL [default_alloc_size=4, jiffies=0, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}] [L6775-L6779] 0 static struct miscdevice nvram_dev = { 144, "nvram", &nvram_fops }; VAL [default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}] [L6798] 0 int (* _whoop_init)(void) = nvram_init; VAL [_whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}] [L6799] 0 void (* _whoop_exit)(void) = nvram_cleanup; VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}] [L6800] 0 struct inode *whoop_inode_0; VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_inode_0={0:0}] [L6801] 0 struct file *whoop_file_0; VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_file_0={0:0}, whoop_inode_0={0:0}] [L6802] 0 struct inode *whoop_inode_1; VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_file_0={0:0}, whoop_inode_0={0:0}, whoop_inode_1={0:0}] [L6803] 0 struct file *whoop_file_1; VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_file_0={0:0}, whoop_file_1={0:0}, whoop_inode_0={0:0}, whoop_inode_1={0:0}] [L6804] 0 struct inode *whoop_inode_2; VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_file_0={0:0}, whoop_file_1={0:0}, whoop_inode_0={0:0}, whoop_inode_1={0:0}, whoop_inode_2={0:0}] [L6805] 0 struct file *whoop_file_2; VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_file_0={0:0}, whoop_file_1={0:0}, whoop_file_2={0:0}, whoop_inode_0={0:0}, whoop_inode_1={0:0}, whoop_inode_2={0:0}] [L6806] 0 struct inode *whoop_inode_3; VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_file_0={0:0}, whoop_file_1={0:0}, whoop_file_2={0:0}, whoop_inode_0={0:0}, whoop_inode_1={0:0}, whoop_inode_2={0:0}, whoop_inode_3={0:0}] [L6807] 0 struct file *whoop_file_3; VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_file_0={0:0}, whoop_file_1={0:0}, whoop_file_2={0:0}, whoop_file_3={0:0}, whoop_inode_0={0:0}, whoop_inode_1={0:0}, whoop_inode_2={0:0}, whoop_inode_3={0:0}] [L6808] 0 struct inode *whoop_inode_4; VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_file_0={0:0}, whoop_file_1={0:0}, whoop_file_2={0:0}, whoop_file_3={0:0}, whoop_inode_0={0:0}, whoop_inode_1={0:0}, whoop_inode_2={0:0}, whoop_inode_3={0:0}, whoop_inode_4={0:0}] [L6809] 0 struct file *whoop_file_4; VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_file_0={0:0}, whoop_file_1={0:0}, whoop_file_2={0:0}, whoop_file_3={0:0}, whoop_file_4={0:0}, whoop_inode_0={0:0}, whoop_inode_1={0:0}, whoop_inode_2={0:0}, whoop_inode_3={0:0}, whoop_inode_4={0:0}] [L6810] 0 struct pci_dev *whoop_pci_dev; VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_file_0={0:0}, whoop_file_1={0:0}, whoop_file_2={0:0}, whoop_file_3={0:0}, whoop_file_4={0:0}, whoop_inode_0={0:0}, whoop_inode_1={0:0}, whoop_inode_2={0:0}, whoop_inode_3={0:0}, whoop_inode_4={0:0}, whoop_pci_dev={0:0}] [L6811] 0 char *whoop_buf; VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={0:0}, whoop_file_0={0:0}, whoop_file_1={0:0}, whoop_file_2={0:0}, whoop_file_3={0:0}, whoop_file_4={0:0}, whoop_inode_0={0:0}, whoop_inode_1={0:0}, whoop_inode_2={0:0}, whoop_inode_3={0:0}, whoop_inode_4={0:0}, whoop_pci_dev={0:0}] [L6812] 0 struct platform_device *whoop_platform_device; VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={0:0}, whoop_file_0={0:0}, whoop_file_1={0:0}, whoop_file_2={0:0}, whoop_file_3={0:0}, whoop_file_4={0:0}, whoop_inode_0={0:0}, whoop_inode_1={0:0}, whoop_inode_2={0:0}, whoop_inode_3={0:0}, whoop_inode_4={0:0}, whoop_pci_dev={0:0}, whoop_platform_device={0:0}] [L6813] 0 struct vm_area_struct *whoop_vm_area_struct; VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={0:0}, whoop_file_0={0:0}, whoop_file_1={0:0}, whoop_file_2={0:0}, whoop_file_3={0:0}, whoop_file_4={0:0}, whoop_inode_0={0:0}, whoop_inode_1={0:0}, whoop_inode_2={0:0}, whoop_inode_3={0:0}, whoop_inode_4={0:0}, whoop_pci_dev={0:0}, whoop_platform_device={0:0}, whoop_vm_area_struct={0:0}] [L6814] 0 struct cx_dev *whoop_cx_dev; VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={0:0}, whoop_cx_dev={0:0}, whoop_file_0={0:0}, whoop_file_1={0:0}, whoop_file_2={0:0}, whoop_file_3={0:0}, whoop_file_4={0:0}, whoop_inode_0={0:0}, whoop_inode_1={0:0}, whoop_inode_2={0:0}, whoop_inode_3={0:0}, whoop_inode_4={0:0}, whoop_pci_dev={0:0}, whoop_platform_device={0:0}, whoop_vm_area_struct={0:0}] [L6815] 0 poll_table *whoop_poll_table; VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={0:0}, whoop_cx_dev={0:0}, whoop_file_0={0:0}, whoop_file_1={0:0}, whoop_file_2={0:0}, whoop_file_3={0:0}, whoop_file_4={0:0}, whoop_inode_0={0:0}, whoop_inode_1={0:0}, whoop_inode_2={0:0}, whoop_inode_3={0:0}, whoop_inode_4={0:0}, whoop_pci_dev={0:0}, whoop_platform_device={0:0}, whoop_poll_table={0:0}, whoop_vm_area_struct={0:0}] [L6816] 0 loff_t *whoop_loff_t; VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={0:0}, whoop_cx_dev={0:0}, whoop_file_0={0:0}, whoop_file_1={0:0}, whoop_file_2={0:0}, whoop_file_3={0:0}, whoop_file_4={0:0}, whoop_inode_0={0:0}, whoop_inode_1={0:0}, whoop_inode_2={0:0}, whoop_inode_3={0:0}, whoop_inode_4={0:0}, whoop_loff_t={0:0}, whoop_pci_dev={0:0}, whoop_platform_device={0:0}, whoop_poll_table={0:0}, whoop_vm_area_struct={0:0}] [L6817] 0 int whoop_int; VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={0:0}, whoop_cx_dev={0:0}, whoop_file_0={0:0}, whoop_file_1={0:0}, whoop_file_2={0:0}, whoop_file_3={0:0}, whoop_file_4={0:0}, whoop_inode_0={0:0}, whoop_inode_1={0:0}, whoop_inode_2={0:0}, whoop_inode_3={0:0}, whoop_inode_4={0:0}, whoop_int=0, whoop_loff_t={0:0}, whoop_pci_dev={0:0}, whoop_platform_device={0:0}, whoop_poll_table={0:0}, whoop_vm_area_struct={0:0}] [L6845] 0 whoop_inode_0 = (struct inode *) malloc(sizeof(struct inode)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={0:0}, whoop_cx_dev={0:0}, whoop_file_0={0:0}, whoop_file_1={0:0}, whoop_file_2={0:0}, whoop_file_3={0:0}, whoop_file_4={0:0}, whoop_inode_0={-2:0}, whoop_inode_1={0:0}, whoop_inode_2={0:0}, whoop_inode_3={0:0}, whoop_inode_4={0:0}, whoop_int=0, whoop_loff_t={0:0}, whoop_pci_dev={0:0}, whoop_platform_device={0:0}, whoop_poll_table={0:0}, whoop_vm_area_struct={0:0}] [L6846] 0 whoop_file_0 = (struct file *) malloc(sizeof(struct file)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={0:0}, whoop_cx_dev={0:0}, whoop_file_0={-3:0}, whoop_file_1={0:0}, whoop_file_2={0:0}, whoop_file_3={0:0}, whoop_file_4={0:0}, whoop_inode_0={-2:0}, whoop_inode_1={0:0}, whoop_inode_2={0:0}, whoop_inode_3={0:0}, whoop_inode_4={0:0}, whoop_int=0, whoop_loff_t={0:0}, whoop_pci_dev={0:0}, whoop_platform_device={0:0}, whoop_poll_table={0:0}, whoop_vm_area_struct={0:0}] [L6847] 0 whoop_inode_1 = (struct inode *) malloc(sizeof(struct inode)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={0:0}, whoop_cx_dev={0:0}, whoop_file_0={-3:0}, whoop_file_1={0:0}, whoop_file_2={0:0}, whoop_file_3={0:0}, whoop_file_4={0:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={0:0}, whoop_inode_3={0:0}, whoop_inode_4={0:0}, whoop_int=0, whoop_loff_t={0:0}, whoop_pci_dev={0:0}, whoop_platform_device={0:0}, whoop_poll_table={0:0}, whoop_vm_area_struct={0:0}] [L6848] 0 whoop_file_1 = (struct file *) malloc(sizeof(struct file)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={0:0}, whoop_cx_dev={0:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={0:0}, whoop_file_3={0:0}, whoop_file_4={0:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={0:0}, whoop_inode_3={0:0}, whoop_inode_4={0:0}, whoop_int=0, whoop_loff_t={0:0}, whoop_pci_dev={0:0}, whoop_platform_device={0:0}, whoop_poll_table={0:0}, whoop_vm_area_struct={0:0}] [L6849] 0 whoop_inode_2 = (struct inode *) malloc(sizeof(struct inode)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={0:0}, whoop_cx_dev={0:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={0:0}, whoop_file_3={0:0}, whoop_file_4={0:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={0:0}, whoop_inode_4={0:0}, whoop_int=0, whoop_loff_t={0:0}, whoop_pci_dev={0:0}, whoop_platform_device={0:0}, whoop_poll_table={0:0}, whoop_vm_area_struct={0:0}] [L6850] 0 whoop_file_2 = (struct file *) malloc(sizeof(struct file)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={0:0}, whoop_cx_dev={0:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={0:0}, whoop_file_4={0:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={0:0}, whoop_inode_4={0:0}, whoop_int=0, whoop_loff_t={0:0}, whoop_pci_dev={0:0}, whoop_platform_device={0:0}, whoop_poll_table={0:0}, whoop_vm_area_struct={0:0}] [L6851] 0 whoop_inode_3 = (struct inode *) malloc(sizeof(struct inode)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={0:0}, whoop_cx_dev={0:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={0:0}, whoop_file_4={0:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={0:0}, whoop_int=0, whoop_loff_t={0:0}, whoop_pci_dev={0:0}, whoop_platform_device={0:0}, whoop_poll_table={0:0}, whoop_vm_area_struct={0:0}] [L6852] 0 whoop_file_3 = (struct file *) malloc(sizeof(struct file)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={0:0}, whoop_cx_dev={0:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={0:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={0:0}, whoop_int=0, whoop_loff_t={0:0}, whoop_pci_dev={0:0}, whoop_platform_device={0:0}, whoop_poll_table={0:0}, whoop_vm_area_struct={0:0}] [L6853] 0 whoop_inode_4 = (struct inode *) malloc(sizeof(struct inode)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={0:0}, whoop_cx_dev={0:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={0:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={0:0}, whoop_pci_dev={0:0}, whoop_platform_device={0:0}, whoop_poll_table={0:0}, whoop_vm_area_struct={0:0}] [L6854] 0 whoop_file_4 = (struct file *) malloc(sizeof(struct file)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={0:0}, whoop_cx_dev={0:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={0:0}, whoop_pci_dev={0:0}, whoop_platform_device={0:0}, whoop_poll_table={0:0}, whoop_vm_area_struct={0:0}] [L6855] 0 whoop_pci_dev = (struct pci_dev *) malloc(sizeof(struct pci_dev)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={0:0}, whoop_cx_dev={0:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={0:0}, whoop_pci_dev={-12:0}, whoop_platform_device={0:0}, whoop_poll_table={0:0}, whoop_vm_area_struct={0:0}] [L6856] 0 whoop_buf = (char *) malloc(sizeof(char)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={0:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={0:0}, whoop_pci_dev={-12:0}, whoop_platform_device={0:0}, whoop_poll_table={0:0}, whoop_vm_area_struct={0:0}] [L6857] 0 whoop_platform_device = (struct platform_device *) malloc(sizeof(struct platform_device)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={0:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={0:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={0:0}, whoop_vm_area_struct={0:0}] [L6858] 0 whoop_vm_area_struct = (struct vm_area_struct *) malloc(sizeof(struct vm_area_struct)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={0:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={0:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={0:0}, whoop_vm_area_struct={-15:0}] [L6859] 0 whoop_cx_dev = (struct cx_dev *) malloc(sizeof(struct cx_dev)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={0:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={0:0}, whoop_vm_area_struct={-15:0}] [L6860] 0 whoop_poll_table = (poll_table *) malloc(sizeof(poll_table)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={0:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6861] 0 whoop_loff_t = (loff_t *) malloc(sizeof(loff_t)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6862] EXPR 0 *whoop_loff_t VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6862] 0 *whoop_loff_t = __VERIFIER_nondet_longlong() VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6863] 0 whoop_int = __VERIFIER_nondet_int() VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6864] EXPR 0 whoop_int >= 0 VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6864] CALL 0 assume_abort_if_not(whoop_int >= 0) [L171] COND FALSE 0 !(!cond) VAL [\old()=1, _whoop_exit={-1:5}, _whoop_init={-1:4}, cond=1, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6864] RET 0 assume_abort_if_not(whoop_int >= 0) [L6865] EXPR 0 _whoop_init() VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6865] CALL, EXPR 0 _whoop_init() [L6782] 0 int ret = 0; VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, ret=0, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6783-L6784] CALL 0 printk("\001" "6" "Generic non-volatile memory driver v%s\n", "1.1") [L6650] 0 return __VERIFIER_nondet_int(); VAL [\old(arg0)={5:0}, \result=0, _whoop_exit={-1:5}, _whoop_init={-1:4}, arg0={5:0}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6783-L6784] RET 0 printk("\001" "6" "Generic non-volatile memory driver v%s\n", "1.1") [L6785] CALL, EXPR 0 misc_register(&nvram_dev) [L6624] 0 return __VERIFIER_nondet_int(); VAL [\old(arg0)={9:0}, \result=0, _whoop_exit={-1:5}, _whoop_init={-1:4}, arg0={9:0}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6785] RET, EXPR 0 misc_register(&nvram_dev) [L6785] 0 ret = misc_register(&nvram_dev) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, ret=0, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6786] COND FALSE 0 !(ret != 0) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, ret=0, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6788] CALL, EXPR 0 nvram_get_size() [L6632] 0 return __VERIFIER_nondet_long(); VAL [\result=1, _whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=0, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6788] RET, EXPR 0 nvram_get_size() [L6788] 0 nvram_len = nvram_get_size() VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, ret=0, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6789] 0 nvram_len < 0 VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, ret=0, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6789] COND FALSE 0 !(nvram_len < 0) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, ret=0, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6792] 0 return ret; VAL [\result=0, _whoop_exit={-1:5}, _whoop_init={-1:4}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, ret=0, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6865] RET, EXPR 0 _whoop_init() [L6865] 0 int _whoop_init_result = _whoop_init(); 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=1, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6866] 0 pthread_t pthread_t_write_nvram; 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=1, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6867] 0 pthread_t pthread_t_read_nvram; 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=1, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6868] 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=1, nvram_mutex={7:0}, pthread_t_write_nvram=-1, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6820] 1 write_nvram(whoop_file_0, whoop_buf, whoop_int, whoop_loff_t) VAL [\old(args)={0:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, args={0:0}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6820] 1 write_nvram(whoop_file_0, whoop_buf, whoop_int, whoop_loff_t) VAL [\old(args)={0:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, args={0:0}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6820] 1 write_nvram(whoop_file_0, whoop_buf, whoop_int, whoop_loff_t) VAL [\old(args)={0:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, args={0:0}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6820] 1 write_nvram(whoop_file_0, whoop_buf, whoop_int, whoop_loff_t) VAL [\old(args)={0:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, args={0:0}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6820] CALL 1 write_nvram(whoop_file_0, whoop_buf, whoop_int, whoop_loff_t) [L6733] 1 unsigned int i; VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-3:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, count=0, default_alloc_size=4, file={-3:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6734] 1 const char *p = buf; VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-3:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, count=0, default_alloc_size=4, file={-3:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6735] 1 char c = __VERIFIER_nondet_char(); VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-3:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, c=0, count=0, default_alloc_size=4, file={-3:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6736] CALL, EXPR 1 access_ok(0, buf, count) [L6551] 1 return __VERIFIER_nondet_int(); VAL [\old(arg0)=0, \old(arg1)={-13:0}, \old(arg2)=0, \result=1, _whoop_exit={-1:5}, _whoop_init={-1:4}, arg0=0, arg1={-13:0}, arg2=0, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6736] RET, EXPR 1 access_ok(0, buf, count) [L6736] COND FALSE 1 !(!access_ok(0, buf, count)) VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-3:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, c=0, count=0, default_alloc_size=4, file={-3:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6738] EXPR 1 \read(*ppos) VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-3:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, c=0, count=0, default_alloc_size=4, file={-3:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6738] 1 *ppos >= nvram_len VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-3:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, c=0, count=0, default_alloc_size=4, file={-3:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6869] 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=1, nvram_mutex={7:0}, pthread_t_read_nvram=0, pthread_t_write_nvram=-1, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6825] 2 read_nvram(whoop_file_1, whoop_buf, whoop_int, whoop_loff_t) VAL [\old(args)={0:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, args={0:0}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6825] 2 read_nvram(whoop_file_1, whoop_buf, whoop_int, whoop_loff_t) VAL [\old(args)={0:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, args={0:0}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6825] 2 read_nvram(whoop_file_1, whoop_buf, whoop_int, whoop_loff_t) VAL [\old(args)={0:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, args={0:0}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6825] 2 read_nvram(whoop_file_1, whoop_buf, whoop_int, whoop_loff_t) VAL [\old(args)={0:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, args={0:0}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6825] CALL 2 read_nvram(whoop_file_1, whoop_buf, whoop_int, whoop_loff_t) [L6717] 2 unsigned int i; VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-5:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, count=0, default_alloc_size=4, file={-5:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6718] 2 char *p = buf; VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-5:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, count=0, default_alloc_size=4, file={-5:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6719] CALL, EXPR 2 access_ok(1, buf, count) [L6551] 2 return __VERIFIER_nondet_int(); VAL [\old(arg0)=1, \old(arg1)={-13:0}, \old(arg2)=0, \result=1, \result=1, _whoop_exit={-1:5}, _whoop_init={-1:4}, arg0=1, arg1={-13:0}, arg2=0, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6719] RET, EXPR 2 access_ok(1, buf, count) [L6719] COND FALSE 2 !(!access_ok(1, buf, count)) VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-5:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, count=0, default_alloc_size=4, file={-5:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6721] EXPR 2 \read(*ppos) VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-5:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, count=0, default_alloc_size=4, file={-5:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6721] 2 *ppos >= nvram_len VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-5:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, count=0, default_alloc_size=4, file={-5:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6738] 1 *ppos >= nvram_len VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-3:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, c=0, count=0, default_alloc_size=4, file={-3:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6721] 2 *ppos >= nvram_len VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-5:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, count=0, default_alloc_size=4, file={-5:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6738] 1 *ppos >= nvram_len VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-3:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, c=0, count=0, default_alloc_size=4, file={-3:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6721] 2 *ppos >= nvram_len VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-5:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, count=0, default_alloc_size=4, file={-5:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6738] 1 *ppos >= nvram_len VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-3:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, c=0, count=0, default_alloc_size=4, file={-3:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6721] 2 *ppos >= nvram_len VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-5:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, count=0, default_alloc_size=4, file={-5:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6738] 1 *ppos >= nvram_len VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-3:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, c=0, count=0, default_alloc_size=4, file={-3:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6721] 2 *ppos >= nvram_len VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-5:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, count=0, default_alloc_size=4, file={-5:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6738] 1 *ppos >= nvram_len VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-3:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, c=0, count=0, default_alloc_size=4, file={-3:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6721] 2 *ppos >= nvram_len VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-5:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, count=0, default_alloc_size=4, file={-5:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6738] 1 *ppos >= nvram_len VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-3:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, c=0, count=0, default_alloc_size=4, file={-3:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6738] COND FALSE 1 !(*ppos >= nvram_len) VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-3:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, c=0, count=0, default_alloc_size=4, file={-3:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6740] EXPR 1 \read(*ppos) VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-3:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, c=0, count=0, default_alloc_size=4, file={-3:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6740] 1 i = *ppos VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-3:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, c=0, count=0, default_alloc_size=4, file={-3:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6721] 2 *ppos >= nvram_len VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-5:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, count=0, default_alloc_size=4, file={-5:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6740] 1 i = *ppos VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-3:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, c=0, count=0, default_alloc_size=4, file={-3:0}, i=0, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6740] COND TRUE 1 count > 0 && i < nvram_len [L6740] 1 count > 0 && i < nvram_len VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-3:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, c=0, count=0, default_alloc_size=4, file={-3:0}, i=0, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6740] COND FALSE 1 !(count > 0 && i < nvram_len) VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-3:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, c=0, count=0, default_alloc_size=4, file={-3:0}, i=0, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6745] 1 *ppos = i VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-3:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, c=0, count=0, default_alloc_size=4, file={-3:0}, i=0, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] [L6721] 2 *ppos >= nvram_len VAL [\old(buf)={-13:0}, \old(count)=0, \old(file)={-5:0}, \old(ppos)={-18:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-13:0}, count=0, default_alloc_size=4, file={-5:0}, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=1, nvram_mutex={7:0}, p={-13:0}, ppos={-18:0}, whoop_buf={-13:0}, whoop_cx_dev={-16:0}, whoop_file_0={-3:0}, whoop_file_1={-5:0}, whoop_file_2={-7:0}, whoop_file_3={-9:0}, whoop_file_4={-11:0}, whoop_inode_0={-2:0}, whoop_inode_1={-4:0}, whoop_inode_2={-6:0}, whoop_inode_3={-8:0}, whoop_inode_4={-10:0}, whoop_int=0, whoop_loff_t={-18:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-14:0}, whoop_poll_table={-17:0}, whoop_vm_area_struct={-15:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: *whoop_loff_t = __VERIFIER_nondet_longlong() [6862] * C: *whoop_loff_t = __VERIFIER_nondet_longlong() [6862] * C: whoop_cx_dev = (struct cx_dev *) malloc(sizeof(struct cx_dev)) [6859] * C: whoop_platform_device = (struct platform_device *) malloc(sizeof(struct platform_device)) [6857] * C: whoop_inode_1 = (struct inode *) malloc(sizeof(struct inode)) [6847] * C: whoop_buf = (char *) malloc(sizeof(char)) [6856] * C: whoop_file_0 = (struct file *) malloc(sizeof(struct file)) [6846] * C: *whoop_loff_t = __VERIFIER_nondet_longlong() [6862] * C: whoop_int = __VERIFIER_nondet_int() [6863] * C: *whoop_loff_t = __VERIFIER_nondet_longlong() [6862] * C: whoop_inode_3 = (struct inode *) malloc(sizeof(struct inode)) [6851] * C: whoop_inode_4 = (struct inode *) malloc(sizeof(struct inode)) [6853] * C: whoop_file_2 = (struct file *) malloc(sizeof(struct file)) [6850] * C: whoop_inode_0 = (struct inode *) malloc(sizeof(struct inode)) [6845] * C: *ppos = i [6745] * C: whoop_file_3 = (struct file *) malloc(sizeof(struct file)) [6852] * C: whoop_poll_table = (poll_table *) malloc(sizeof(poll_table)) [6860] * C: whoop_vm_area_struct = (struct vm_area_struct *) malloc(sizeof(struct vm_area_struct)) [6858] * C: whoop_loff_t = (loff_t *) malloc(sizeof(loff_t)) [6861] * C: whoop_file_1 = (struct file *) malloc(sizeof(struct file)) [6848] * C: *whoop_loff_t = __VERIFIER_nondet_longlong() [6862] * C: whoop_pci_dev = (struct pci_dev *) malloc(sizeof(struct pci_dev)) [6855] * C: whoop_inode_2 = (struct inode *) malloc(sizeof(struct inode)) [6849] * C: *whoop_loff_t = __VERIFIER_nondet_longlong() [6862] * C: nvram_len = nvram_get_size() [6788] * C: *whoop_loff_t = __VERIFIER_nondet_longlong() [6862] * C: *whoop_loff_t = __VERIFIER_nondet_longlong() [6862] * C: whoop_file_4 = (struct file *) malloc(sizeof(struct file)) [6854] and C: *ppos >= nvram_len [6721] - UnprovableResult [Line: 6825]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6825]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6825]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6825]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6726]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6727]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6820]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6820]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6820]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6820]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6740]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6740]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6745]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6746]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6845]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6846]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6851]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6854]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6855]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6856]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6857]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6858]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6859]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6860]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6861]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6862]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6862]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6863]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6864]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6865]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6788]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6789]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6790]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 6868]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 6869]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 901 locations, 67 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 27.4s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1475 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 864 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 875 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5571 IncrementalHoareTripleChecker+Invalid, 6446 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 875 mSolverCounterUnsat, 129 mSDtfsCounter, 5571 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8193occurred in iteration=32, InterpolantAutomatonStates: 131, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 7244 NumberOfCodeBlocks, 7244 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 6785 ConstructedInterpolants, 0 QuantifiedInterpolants, 8374 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-08 05:28:05,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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(DATA-RACE)