./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_nvram_unlocked_ioctl_write_nvram.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_nvram_unlocked_ioctl_write_nvram.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 e477555710806f589e2df4355d107ec5094f895ba0eeca2a28a6fd25b09e9340 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:00:16,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:00:16,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:00:16,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:00:16,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:00:16,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:00:16,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:00:16,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:00:16,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:00:16,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:00:16,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:00:16,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:00:16,624 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:00:16,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:00:16,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:00:16,624 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:00:16,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:00:16,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:00:16,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:00:16,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:00:16,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:00:16,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:00:16,624 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:00:16,624 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:00:16,624 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:00:16,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:00:16,626 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:00:16,626 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:00:16,626 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:00:16,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:00:16,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:00:16,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:00:16,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:00:16,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:00:16,627 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:00:16,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:00:16,627 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:00:16,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:00:16,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:00:16,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:00:16,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:00:16,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:00:16,627 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/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 -> e477555710806f589e2df4355d107ec5094f895ba0eeca2a28a6fd25b09e9340 [2025-03-17 11:00:16,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:00:16,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:00:16,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:00:16,874 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:00:16,874 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:00:16,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_nvram_unlocked_ioctl_write_nvram.i [2025-03-17 11:00:18,059 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d814cc4/d4c87a14ed4e48818acd6d19337efa2f/FLAGb8eff5c48 [2025-03-17 11:00:18,560 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:00:18,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_nvram_unlocked_ioctl_write_nvram.i [2025-03-17 11:00:18,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d814cc4/d4c87a14ed4e48818acd6d19337efa2f/FLAGb8eff5c48 [2025-03-17 11:00:18,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d814cc4/d4c87a14ed4e48818acd6d19337efa2f [2025-03-17 11:00:18,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:00:18,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:00:18,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:00:18,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:00:18,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:00:18,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:00:18" (1/1) ... [2025-03-17 11:00:18,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474b80d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:18, skipping insertion in model container [2025-03-17 11:00:18,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:00:18" (1/1) ... [2025-03-17 11:00:18,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:00:22,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:00:22,718 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:00:22,801 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "b %b0, %1\n" : "+q" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-03-17 11:00:22,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "w %w0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-03-17 11:00:22,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "l %0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-03-17 11:00:22,803 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "q %q0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-03-17 11:00:22,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] [2025-03-17 11:00:22,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:00:23,208 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:00:23,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:23 WrapperNode [2025-03-17 11:00:23,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:00:23,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:00:23,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:00:23,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:00:23,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:23" (1/1) ... [2025-03-17 11:00:23,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:23" (1/1) ... [2025-03-17 11:00:23,343 INFO L138 Inliner]: procedures = 1354, calls = 1464, calls flagged for inlining = 353, calls inlined = 20, statements flattened = 522 [2025-03-17 11:00:23,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:00:23,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:00:23,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:00:23,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:00:23,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:23" (1/1) ... [2025-03-17 11:00:23,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:23" (1/1) ... [2025-03-17 11:00:23,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:23" (1/1) ... [2025-03-17 11:00:23,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:23" (1/1) ... [2025-03-17 11:00:23,370 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:23" (1/1) ... [2025-03-17 11:00:23,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:23" (1/1) ... [2025-03-17 11:00:23,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:23" (1/1) ... [2025-03-17 11:00:23,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:23" (1/1) ... [2025-03-17 11:00:23,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:00:23,383 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:00:23,383 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:00:23,383 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:00:23,384 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:23" (1/1) ... [2025-03-17 11:00:23,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:00:23,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:00:23,461 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:00:23,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:00:23,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:00:23,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:00:23,485 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_nvram_unlocked_ioctl [2025-03-17 11:00:23,485 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_nvram_unlocked_ioctl [2025-03-17 11:00:23,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:00:23,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:00:23,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:00:23,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:00:23,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 11:00:23,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 11:00:23,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 11:00:23,486 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_write_nvram [2025-03-17 11:00:23,486 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_write_nvram [2025-03-17 11:00:23,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:00:23,487 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:00:23,836 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:00:23,838 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:00:24,060 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6551: havoc access_ok_#t~nondet1286#1; [2025-03-17 11:00:24,061 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6535: havoc __get_user_#t~nondet1282#1; [2025-03-17 11:00:24,319 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6632: havoc nvram_get_size_#t~nondet1301#1; [2025-03-17 11:00:24,319 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6650: havoc printk_#t~nondet1304#1; [2025-03-17 11:00:24,319 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6624: havoc misc_register_#t~nondet1299#1; [2025-03-17 11:00:24,388 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:00:24,389 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:00:24,464 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:00:24,464 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:00:24,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:00:24 BoogieIcfgContainer [2025-03-17 11:00:24,464 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:00:24,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:00:24,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:00:24,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:00:24,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:00:18" (1/3) ... [2025-03-17 11:00:24,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d69b112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:00:24, skipping insertion in model container [2025-03-17 11:00:24,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:00:23" (2/3) ... [2025-03-17 11:00:24,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d69b112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:00:24, skipping insertion in model container [2025-03-17 11:00:24,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:00:24" (3/3) ... [2025-03-17 11:00:24,474 INFO L128 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_nvram_unlocked_ioctl_write_nvram.i [2025-03-17 11:00:24,485 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:00:24,488 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG char_generic_nvram_nvram_unlocked_ioctl_write_nvram.i that has 3 procedures, 572 locations, 1 initial locations, 1 loop locations, and 41 error locations. [2025-03-17 11:00:24,488 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:00:24,614 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:00:24,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 578 places, 584 transitions, 1182 flow [2025-03-17 11:00:24,828 INFO L124 PetriNetUnfolderBase]: 13/582 cut-off events. [2025-03-17 11:00:24,830 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:00:24,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 582 events. 13/582 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 589 event pairs, 0 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 514. Up to 4 conditions per place. [2025-03-17 11:00:24,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 578 places, 584 transitions, 1182 flow [2025-03-17 11:00:24,848 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 572 places, 578 transitions, 1165 flow [2025-03-17 11:00:24,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:00:24,861 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;@e5146cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:00:24,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-03-17 11:00:24,880 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:00:24,883 INFO L124 PetriNetUnfolderBase]: 0/87 cut-off events. [2025-03-17 11:00:24,883 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:00:24,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:24,884 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-03-17 11:00:24,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:24,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:24,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2144702847, now seen corresponding path program 1 times [2025-03-17 11:00:24,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:24,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577816156] [2025-03-17 11:00:24,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:24,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:25,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 11:00:25,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 11:00:25,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:25,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:25,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:25,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577816156] [2025-03-17 11:00:25,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577816156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:25,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:25,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:25,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534615771] [2025-03-17 11:00:25,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:25,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:25,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:25,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:25,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:25,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 584 [2025-03-17 11:00:25,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 578 transitions, 1165 flow. Second operand has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:25,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:25,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 584 [2025-03-17 11:00:25,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:25,405 INFO L124 PetriNetUnfolderBase]: 13/609 cut-off events. [2025-03-17 11:00:25,406 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2025-03-17 11:00:25,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 609 events. 13/609 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 790 event pairs, 2 based on Foata normal form. 4/562 useless extension candidates. Maximal degree in co-relation 513. Up to 13 conditions per place. [2025-03-17 11:00:25,412 INFO L140 encePairwiseOnDemand]: 574/584 looper letters, 8 selfloop transitions, 2 changer transitions 1/568 dead transitions. [2025-03-17 11:00:25,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 568 transitions, 1165 flow [2025-03-17 11:00:25,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:25,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1707 transitions. [2025-03-17 11:00:25,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9743150684931506 [2025-03-17 11:00:25,436 INFO L175 Difference]: Start difference. First operand has 572 places, 578 transitions, 1165 flow. Second operand 3 states and 1707 transitions. [2025-03-17 11:00:25,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 568 transitions, 1165 flow [2025-03-17 11:00:25,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 568 transitions, 1160 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 11:00:25,456 INFO L231 Difference]: Finished difference. Result has 565 places, 567 transitions, 1142 flow [2025-03-17 11:00:25,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=565, PETRI_TRANSITIONS=567} [2025-03-17 11:00:25,465 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -7 predicate places. [2025-03-17 11:00:25,465 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 567 transitions, 1142 flow [2025-03-17 11:00:25,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:25,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:25,468 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-03-17 11:00:25,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:00:25,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:25,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:25,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1392482776, now seen corresponding path program 1 times [2025-03-17 11:00:25,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:25,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649086097] [2025-03-17 11:00:25,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:25,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:25,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 11:00:25,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 11:00:25,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:25,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:25,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:25,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:25,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649086097] [2025-03-17 11:00:25,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649086097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:25,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:25,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:25,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477866727] [2025-03-17 11:00:25,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:25,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:25,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:25,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:25,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:25,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 584 [2025-03-17 11:00:25,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 567 transitions, 1142 flow. Second operand has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:25,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:25,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 584 [2025-03-17 11:00:25,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:25,765 INFO L124 PetriNetUnfolderBase]: 29/1059 cut-off events. [2025-03-17 11:00:25,765 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:00:25,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1090 conditions, 1059 events. 29/1059 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2960 event pairs, 5 based on Foata normal form. 0/962 useless extension candidates. Maximal degree in co-relation 995. Up to 20 conditions per place. [2025-03-17 11:00:25,771 INFO L140 encePairwiseOnDemand]: 581/584 looper letters, 9 selfloop transitions, 2 changer transitions 0/566 dead transitions. [2025-03-17 11:00:25,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 566 transitions, 1162 flow [2025-03-17 11:00:25,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1698 transitions. [2025-03-17 11:00:25,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9691780821917808 [2025-03-17 11:00:25,778 INFO L175 Difference]: Start difference. First operand has 565 places, 567 transitions, 1142 flow. Second operand 3 states and 1698 transitions. [2025-03-17 11:00:25,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 566 transitions, 1162 flow [2025-03-17 11:00:25,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 566 transitions, 1158 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:25,784 INFO L231 Difference]: Finished difference. Result has 563 places, 566 transitions, 1140 flow [2025-03-17 11:00:25,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1140, PETRI_PLACES=563, PETRI_TRANSITIONS=566} [2025-03-17 11:00:25,785 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -9 predicate places. [2025-03-17 11:00:25,785 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 566 transitions, 1140 flow [2025-03-17 11:00:25,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:25,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:25,786 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-03-17 11:00:25,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:00:25,786 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:25,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:25,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2065023166, now seen corresponding path program 1 times [2025-03-17 11:00:25,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:25,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308968876] [2025-03-17 11:00:25,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:25,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:25,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 11:00:25,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 11:00:25,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:25,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:25,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:25,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308968876] [2025-03-17 11:00:25,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308968876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:25,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:25,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:25,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206299518] [2025-03-17 11:00:25,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:25,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:25,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:25,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:25,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:25,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 584 [2025-03-17 11:00:25,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 566 transitions, 1140 flow. Second operand has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:25,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:25,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 584 [2025-03-17 11:00:25,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:25,976 INFO L124 PetriNetUnfolderBase]: 13/606 cut-off events. [2025-03-17 11:00:25,976 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:25,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 606 events. 13/606 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 782 event pairs, 2 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 526. Up to 13 conditions per place. [2025-03-17 11:00:25,980 INFO L140 encePairwiseOnDemand]: 581/584 looper letters, 8 selfloop transitions, 2 changer transitions 0/565 dead transitions. [2025-03-17 11:00:25,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 565 transitions, 1158 flow [2025-03-17 11:00:25,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:25,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:25,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1700 transitions. [2025-03-17 11:00:25,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703196347031964 [2025-03-17 11:00:25,984 INFO L175 Difference]: Start difference. First operand has 563 places, 566 transitions, 1140 flow. Second operand 3 states and 1700 transitions. [2025-03-17 11:00:25,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 565 transitions, 1158 flow [2025-03-17 11:00:25,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 565 transitions, 1154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:25,991 INFO L231 Difference]: Finished difference. Result has 562 places, 565 transitions, 1138 flow [2025-03-17 11:00:25,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1138, PETRI_PLACES=562, PETRI_TRANSITIONS=565} [2025-03-17 11:00:25,993 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -10 predicate places. [2025-03-17 11:00:25,994 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 565 transitions, 1138 flow [2025-03-17 11:00:25,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:25,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:25,995 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-03-17 11:00:25,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:00:25,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:25,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:25,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2106875603, now seen corresponding path program 1 times [2025-03-17 11:00:25,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:25,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416921991] [2025-03-17 11:00:25,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:25,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:26,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 11:00:26,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 11:00:26,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:26,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:26,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:26,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416921991] [2025-03-17 11:00:26,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416921991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:26,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:26,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:26,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960391651] [2025-03-17 11:00:26,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:26,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:26,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:26,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:26,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:26,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 584 [2025-03-17 11:00:26,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 565 transitions, 1138 flow. Second operand has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:26,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:26,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 584 [2025-03-17 11:00:26,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:26,191 INFO L124 PetriNetUnfolderBase]: 13/605 cut-off events. [2025-03-17 11:00:26,191 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:26,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 605 events. 13/605 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 777 event pairs, 2 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 518. Up to 13 conditions per place. [2025-03-17 11:00:26,194 INFO L140 encePairwiseOnDemand]: 581/584 looper letters, 8 selfloop transitions, 2 changer transitions 0/564 dead transitions. [2025-03-17 11:00:26,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 564 transitions, 1156 flow [2025-03-17 11:00:26,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:26,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:26,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1700 transitions. [2025-03-17 11:00:26,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703196347031964 [2025-03-17 11:00:26,198 INFO L175 Difference]: Start difference. First operand has 562 places, 565 transitions, 1138 flow. Second operand 3 states and 1700 transitions. [2025-03-17 11:00:26,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 564 transitions, 1156 flow [2025-03-17 11:00:26,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 564 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:26,205 INFO L231 Difference]: Finished difference. Result has 561 places, 564 transitions, 1136 flow [2025-03-17 11:00:26,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1136, PETRI_PLACES=561, PETRI_TRANSITIONS=564} [2025-03-17 11:00:26,208 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -11 predicate places. [2025-03-17 11:00:26,209 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 564 transitions, 1136 flow [2025-03-17 11:00:26,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:26,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:26,210 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-03-17 11:00:26,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:00:26,210 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:26,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:26,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1459176022, now seen corresponding path program 1 times [2025-03-17 11:00:26,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:26,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798498640] [2025-03-17 11:00:26,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:26,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:26,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 11:00:26,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 11:00:26,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:26,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:26,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:26,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798498640] [2025-03-17 11:00:26,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798498640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:26,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:26,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:26,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899053019] [2025-03-17 11:00:26,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:26,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:26,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:26,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:26,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:26,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 584 [2025-03-17 11:00:26,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 564 transitions, 1136 flow. Second operand has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:26,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:26,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 584 [2025-03-17 11:00:26,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:26,380 INFO L124 PetriNetUnfolderBase]: 13/604 cut-off events. [2025-03-17 11:00:26,380 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:26,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 604 events. 13/604 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 770 event pairs, 2 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 510. Up to 13 conditions per place. [2025-03-17 11:00:26,384 INFO L140 encePairwiseOnDemand]: 581/584 looper letters, 8 selfloop transitions, 2 changer transitions 0/563 dead transitions. [2025-03-17 11:00:26,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 563 transitions, 1154 flow [2025-03-17 11:00:26,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1700 transitions. [2025-03-17 11:00:26,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703196347031964 [2025-03-17 11:00:26,392 INFO L175 Difference]: Start difference. First operand has 561 places, 564 transitions, 1136 flow. Second operand 3 states and 1700 transitions. [2025-03-17 11:00:26,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 563 transitions, 1154 flow [2025-03-17 11:00:26,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 563 transitions, 1150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:26,400 INFO L231 Difference]: Finished difference. Result has 560 places, 563 transitions, 1134 flow [2025-03-17 11:00:26,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1134, PETRI_PLACES=560, PETRI_TRANSITIONS=563} [2025-03-17 11:00:26,403 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -12 predicate places. [2025-03-17 11:00:26,404 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 563 transitions, 1134 flow [2025-03-17 11:00:26,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:26,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:26,405 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-03-17 11:00:26,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:00:26,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:26,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:26,406 INFO L85 PathProgramCache]: Analyzing trace with hash 433117579, now seen corresponding path program 1 times [2025-03-17 11:00:26,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:26,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611417805] [2025-03-17 11:00:26,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:26,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:26,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 11:00:26,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 11:00:26,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:26,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:26,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:26,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611417805] [2025-03-17 11:00:26,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611417805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:26,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:26,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:26,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390943017] [2025-03-17 11:00:26,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:26,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:26,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:26,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:26,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:26,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 584 [2025-03-17 11:00:26,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 563 transitions, 1134 flow. Second operand has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:26,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:26,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 584 [2025-03-17 11:00:26,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:26,633 INFO L124 PetriNetUnfolderBase]: 14/623 cut-off events. [2025-03-17 11:00:26,633 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-17 11:00:26,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 623 events. 14/623 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 882 event pairs, 3 based on Foata normal form. 0/574 useless extension candidates. Maximal degree in co-relation 525. Up to 16 conditions per place. [2025-03-17 11:00:26,667 INFO L140 encePairwiseOnDemand]: 581/584 looper letters, 9 selfloop transitions, 2 changer transitions 0/562 dead transitions. [2025-03-17 11:00:26,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 562 transitions, 1154 flow [2025-03-17 11:00:26,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1698 transitions. [2025-03-17 11:00:26,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9691780821917808 [2025-03-17 11:00:26,673 INFO L175 Difference]: Start difference. First operand has 560 places, 563 transitions, 1134 flow. Second operand 3 states and 1698 transitions. [2025-03-17 11:00:26,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 562 transitions, 1154 flow [2025-03-17 11:00:26,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 562 transitions, 1150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:26,684 INFO L231 Difference]: Finished difference. Result has 559 places, 562 transitions, 1132 flow [2025-03-17 11:00:26,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1132, PETRI_PLACES=559, PETRI_TRANSITIONS=562} [2025-03-17 11:00:26,690 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -13 predicate places. [2025-03-17 11:00:26,690 INFO L471 AbstractCegarLoop]: Abstraction has has 559 places, 562 transitions, 1132 flow [2025-03-17 11:00:26,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:26,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:26,692 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-03-17 11:00:26,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:00:26,693 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:26,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:26,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1393538222, now seen corresponding path program 1 times [2025-03-17 11:00:26,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:26,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073187792] [2025-03-17 11:00:26,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:26,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:26,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 11:00:26,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 11:00:26,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:26,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:26,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:26,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:26,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073187792] [2025-03-17 11:00:26,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073187792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:26,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:26,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:26,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074408071] [2025-03-17 11:00:26,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:26,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:26,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:26,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:26,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:26,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 584 [2025-03-17 11:00:26,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 562 transitions, 1132 flow. Second operand has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:26,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:26,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 584 [2025-03-17 11:00:26,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:26,884 INFO L124 PetriNetUnfolderBase]: 13/602 cut-off events. [2025-03-17 11:00:26,885 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:26,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 602 events. 13/602 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 764 event pairs, 2 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 494. Up to 13 conditions per place. [2025-03-17 11:00:26,887 INFO L140 encePairwiseOnDemand]: 581/584 looper letters, 8 selfloop transitions, 2 changer transitions 0/561 dead transitions. [2025-03-17 11:00:26,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 561 transitions, 1150 flow [2025-03-17 11:00:26,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1700 transitions. [2025-03-17 11:00:26,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703196347031964 [2025-03-17 11:00:26,890 INFO L175 Difference]: Start difference. First operand has 559 places, 562 transitions, 1132 flow. Second operand 3 states and 1700 transitions. [2025-03-17 11:00:26,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 561 transitions, 1150 flow [2025-03-17 11:00:26,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 561 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:26,896 INFO L231 Difference]: Finished difference. Result has 558 places, 561 transitions, 1130 flow [2025-03-17 11:00:26,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1130, PETRI_PLACES=558, PETRI_TRANSITIONS=561} [2025-03-17 11:00:26,897 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -14 predicate places. [2025-03-17 11:00:26,897 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 561 transitions, 1130 flow [2025-03-17 11:00:26,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:26,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:26,898 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-03-17 11:00:26,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:00:26,899 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:26,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:26,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1013267005, now seen corresponding path program 1 times [2025-03-17 11:00:26,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:26,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902774545] [2025-03-17 11:00:26,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:26,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:26,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 11:00:26,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 11:00:26,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:26,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:26,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:26,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:26,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902774545] [2025-03-17 11:00:26,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902774545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:26,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:26,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:26,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801259172] [2025-03-17 11:00:26,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:26,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:26,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:26,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:26,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:26,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 584 [2025-03-17 11:00:26,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 561 transitions, 1130 flow. Second operand has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:26,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:26,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 584 [2025-03-17 11:00:26,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:27,020 INFO L124 PetriNetUnfolderBase]: 13/601 cut-off events. [2025-03-17 11:00:27,021 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:27,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 601 events. 13/601 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 755 event pairs, 2 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 486. Up to 13 conditions per place. [2025-03-17 11:00:27,023 INFO L140 encePairwiseOnDemand]: 581/584 looper letters, 8 selfloop transitions, 2 changer transitions 0/560 dead transitions. [2025-03-17 11:00:27,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 560 transitions, 1148 flow [2025-03-17 11:00:27,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:27,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1700 transitions. [2025-03-17 11:00:27,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703196347031964 [2025-03-17 11:00:27,026 INFO L175 Difference]: Start difference. First operand has 558 places, 561 transitions, 1130 flow. Second operand 3 states and 1700 transitions. [2025-03-17 11:00:27,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 560 transitions, 1148 flow [2025-03-17 11:00:27,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 560 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:27,032 INFO L231 Difference]: Finished difference. Result has 557 places, 560 transitions, 1128 flow [2025-03-17 11:00:27,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1128, PETRI_PLACES=557, PETRI_TRANSITIONS=560} [2025-03-17 11:00:27,034 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -15 predicate places. [2025-03-17 11:00:27,034 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 560 transitions, 1128 flow [2025-03-17 11:00:27,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:27,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:27,035 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-03-17 11:00:27,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:00:27,035 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:27,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:27,035 INFO L85 PathProgramCache]: Analyzing trace with hash 213365134, now seen corresponding path program 1 times [2025-03-17 11:00:27,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:27,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786801332] [2025-03-17 11:00:27,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:27,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:27,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 11:00:27,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 11:00:27,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:27,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:27,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:27,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786801332] [2025-03-17 11:00:27,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786801332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:27,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:27,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:27,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503927005] [2025-03-17 11:00:27,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:27,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:27,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:27,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:27,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:27,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 584 [2025-03-17 11:00:27,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 560 transitions, 1128 flow. Second operand has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:27,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:27,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 584 [2025-03-17 11:00:27,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:27,183 INFO L124 PetriNetUnfolderBase]: 13/600 cut-off events. [2025-03-17 11:00:27,183 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:27,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 600 events. 13/600 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 753 event pairs, 2 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 478. Up to 13 conditions per place. [2025-03-17 11:00:27,187 INFO L140 encePairwiseOnDemand]: 581/584 looper letters, 8 selfloop transitions, 2 changer transitions 0/559 dead transitions. [2025-03-17 11:00:27,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 559 transitions, 1146 flow [2025-03-17 11:00:27,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1700 transitions. [2025-03-17 11:00:27,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703196347031964 [2025-03-17 11:00:27,190 INFO L175 Difference]: Start difference. First operand has 557 places, 560 transitions, 1128 flow. Second operand 3 states and 1700 transitions. [2025-03-17 11:00:27,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 559 transitions, 1146 flow [2025-03-17 11:00:27,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 559 transitions, 1142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:27,196 INFO L231 Difference]: Finished difference. Result has 556 places, 559 transitions, 1126 flow [2025-03-17 11:00:27,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1126, PETRI_PLACES=556, PETRI_TRANSITIONS=559} [2025-03-17 11:00:27,198 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -16 predicate places. [2025-03-17 11:00:27,198 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 559 transitions, 1126 flow [2025-03-17 11:00:27,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:27,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:27,199 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-03-17 11:00:27,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:00:27,199 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:27,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:27,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1330389549, now seen corresponding path program 1 times [2025-03-17 11:00:27,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:27,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144346991] [2025-03-17 11:00:27,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:27,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:27,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 11:00:27,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 11:00:27,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:27,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:27,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:27,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144346991] [2025-03-17 11:00:27,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144346991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:27,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:27,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:27,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413274357] [2025-03-17 11:00:27,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:27,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:27,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:27,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:27,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:27,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 584 [2025-03-17 11:00:27,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 559 transitions, 1126 flow. Second operand has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:27,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:27,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 584 [2025-03-17 11:00:27,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:27,349 INFO L124 PetriNetUnfolderBase]: 13/599 cut-off events. [2025-03-17 11:00:27,349 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:27,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 599 events. 13/599 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 752 event pairs, 2 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 470. Up to 13 conditions per place. [2025-03-17 11:00:27,352 INFO L140 encePairwiseOnDemand]: 581/584 looper letters, 8 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2025-03-17 11:00:27,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 558 transitions, 1144 flow [2025-03-17 11:00:27,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:27,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1700 transitions. [2025-03-17 11:00:27,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703196347031964 [2025-03-17 11:00:27,355 INFO L175 Difference]: Start difference. First operand has 556 places, 559 transitions, 1126 flow. Second operand 3 states and 1700 transitions. [2025-03-17 11:00:27,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 558 transitions, 1144 flow [2025-03-17 11:00:27,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 558 transitions, 1140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:27,361 INFO L231 Difference]: Finished difference. Result has 555 places, 558 transitions, 1124 flow [2025-03-17 11:00:27,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1124, PETRI_PLACES=555, PETRI_TRANSITIONS=558} [2025-03-17 11:00:27,362 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -17 predicate places. [2025-03-17 11:00:27,362 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 558 transitions, 1124 flow [2025-03-17 11:00:27,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:27,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:27,363 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-03-17 11:00:27,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:00:27,364 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:27,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:27,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1671345271, now seen corresponding path program 1 times [2025-03-17 11:00:27,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:27,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497024040] [2025-03-17 11:00:27,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:27,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:27,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 11:00:27,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 11:00:27,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:27,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:27,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:27,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:27,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497024040] [2025-03-17 11:00:27,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497024040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:27,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:27,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:27,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765161366] [2025-03-17 11:00:27,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:27,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:27,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:27,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:27,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:27,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 584 [2025-03-17 11:00:27,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 558 transitions, 1124 flow. Second operand has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:27,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:27,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 584 [2025-03-17 11:00:27,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:27,534 INFO L124 PetriNetUnfolderBase]: 13/598 cut-off events. [2025-03-17 11:00:27,535 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:27,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 598 events. 13/598 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 749 event pairs, 2 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 462. Up to 13 conditions per place. [2025-03-17 11:00:27,538 INFO L140 encePairwiseOnDemand]: 581/584 looper letters, 8 selfloop transitions, 2 changer transitions 0/557 dead transitions. [2025-03-17 11:00:27,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 557 transitions, 1142 flow [2025-03-17 11:00:27,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:27,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1700 transitions. [2025-03-17 11:00:27,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703196347031964 [2025-03-17 11:00:27,542 INFO L175 Difference]: Start difference. First operand has 555 places, 558 transitions, 1124 flow. Second operand 3 states and 1700 transitions. [2025-03-17 11:00:27,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 557 transitions, 1142 flow [2025-03-17 11:00:27,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 557 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:27,551 INFO L231 Difference]: Finished difference. Result has 554 places, 557 transitions, 1122 flow [2025-03-17 11:00:27,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1122, PETRI_PLACES=554, PETRI_TRANSITIONS=557} [2025-03-17 11:00:27,552 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -18 predicate places. [2025-03-17 11:00:27,552 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 557 transitions, 1122 flow [2025-03-17 11:00:27,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:27,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:27,553 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-03-17 11:00:27,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:00:27,554 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:27,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:27,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1372364464, now seen corresponding path program 1 times [2025-03-17 11:00:27,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:27,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835760540] [2025-03-17 11:00:27,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:27,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:27,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 11:00:27,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 11:00:27,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:27,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:27,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:27,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835760540] [2025-03-17 11:00:27,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835760540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:27,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:27,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:27,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843316413] [2025-03-17 11:00:27,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:27,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:27,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:27,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:27,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:27,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 584 [2025-03-17 11:00:27,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 557 transitions, 1122 flow. Second operand has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:27,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:27,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 584 [2025-03-17 11:00:27,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:27,772 INFO L124 PetriNetUnfolderBase]: 29/1040 cut-off events. [2025-03-17 11:00:27,772 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:00:27,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 1040 events. 29/1040 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2880 event pairs, 5 based on Foata normal form. 0/956 useless extension candidates. Maximal degree in co-relation 906. Up to 20 conditions per place. [2025-03-17 11:00:27,778 INFO L140 encePairwiseOnDemand]: 581/584 looper letters, 9 selfloop transitions, 2 changer transitions 0/556 dead transitions. [2025-03-17 11:00:27,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 556 transitions, 1142 flow [2025-03-17 11:00:27,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:27,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1698 transitions. [2025-03-17 11:00:27,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9691780821917808 [2025-03-17 11:00:27,780 INFO L175 Difference]: Start difference. First operand has 554 places, 557 transitions, 1122 flow. Second operand 3 states and 1698 transitions. [2025-03-17 11:00:27,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 556 transitions, 1142 flow [2025-03-17 11:00:27,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 556 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:27,787 INFO L231 Difference]: Finished difference. Result has 553 places, 556 transitions, 1120 flow [2025-03-17 11:00:27,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1120, PETRI_PLACES=553, PETRI_TRANSITIONS=556} [2025-03-17 11:00:27,789 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -19 predicate places. [2025-03-17 11:00:27,789 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 556 transitions, 1120 flow [2025-03-17 11:00:27,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:27,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:27,790 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-03-17 11:00:27,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:00:27,790 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:27,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:27,791 INFO L85 PathProgramCache]: Analyzing trace with hash -640030244, now seen corresponding path program 1 times [2025-03-17 11:00:27,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:27,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781419761] [2025-03-17 11:00:27,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:27,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:27,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 11:00:27,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 11:00:27,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:27,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:27,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:27,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781419761] [2025-03-17 11:00:27,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781419761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:27,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:27,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:27,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845957240] [2025-03-17 11:00:27,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:27,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:27,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:27,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:27,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:27,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 584 [2025-03-17 11:00:27,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 556 transitions, 1120 flow. Second operand has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:27,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:27,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 584 [2025-03-17 11:00:27,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:27,957 INFO L124 PetriNetUnfolderBase]: 13/596 cut-off events. [2025-03-17 11:00:27,958 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:27,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 596 events. 13/596 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 744 event pairs, 2 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 446. Up to 13 conditions per place. [2025-03-17 11:00:27,961 INFO L140 encePairwiseOnDemand]: 581/584 looper letters, 8 selfloop transitions, 2 changer transitions 0/555 dead transitions. [2025-03-17 11:00:27,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 555 transitions, 1138 flow [2025-03-17 11:00:27,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:27,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1700 transitions. [2025-03-17 11:00:27,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703196347031964 [2025-03-17 11:00:27,964 INFO L175 Difference]: Start difference. First operand has 553 places, 556 transitions, 1120 flow. Second operand 3 states and 1700 transitions. [2025-03-17 11:00:27,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 555 transitions, 1138 flow [2025-03-17 11:00:27,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 555 transitions, 1134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:27,970 INFO L231 Difference]: Finished difference. Result has 552 places, 555 transitions, 1118 flow [2025-03-17 11:00:27,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=552, PETRI_TRANSITIONS=555} [2025-03-17 11:00:27,971 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -20 predicate places. [2025-03-17 11:00:27,972 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 555 transitions, 1118 flow [2025-03-17 11:00:27,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:27,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:27,973 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-03-17 11:00:27,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:00:27,973 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:27,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:27,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1103885108, now seen corresponding path program 1 times [2025-03-17 11:00:27,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:27,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354783317] [2025-03-17 11:00:27,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:27,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:27,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 11:00:28,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 11:00:28,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:28,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:28,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:28,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:28,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354783317] [2025-03-17 11:00:28,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354783317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:28,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:28,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:28,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710392141] [2025-03-17 11:00:28,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:28,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:28,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:28,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:28,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:28,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 584 [2025-03-17 11:00:28,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 555 transitions, 1118 flow. Second operand has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:28,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:28,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 584 [2025-03-17 11:00:28,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:28,186 INFO L124 PetriNetUnfolderBase]: 13/595 cut-off events. [2025-03-17 11:00:28,186 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:28,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 595 events. 13/595 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 743 event pairs, 2 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 438. Up to 13 conditions per place. [2025-03-17 11:00:28,189 INFO L140 encePairwiseOnDemand]: 581/584 looper letters, 8 selfloop transitions, 2 changer transitions 0/554 dead transitions. [2025-03-17 11:00:28,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 554 transitions, 1136 flow [2025-03-17 11:00:28,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:28,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1700 transitions. [2025-03-17 11:00:28,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703196347031964 [2025-03-17 11:00:28,192 INFO L175 Difference]: Start difference. First operand has 552 places, 555 transitions, 1118 flow. Second operand 3 states and 1700 transitions. [2025-03-17 11:00:28,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 554 transitions, 1136 flow [2025-03-17 11:00:28,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 554 transitions, 1132 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:28,197 INFO L231 Difference]: Finished difference. Result has 551 places, 554 transitions, 1116 flow [2025-03-17 11:00:28,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1116, PETRI_PLACES=551, PETRI_TRANSITIONS=554} [2025-03-17 11:00:28,199 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -21 predicate places. [2025-03-17 11:00:28,199 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 554 transitions, 1116 flow [2025-03-17 11:00:28,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:28,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:28,201 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-03-17 11:00:28,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:00:28,201 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:28,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:28,202 INFO L85 PathProgramCache]: Analyzing trace with hash -486492859, now seen corresponding path program 1 times [2025-03-17 11:00:28,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:28,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518428459] [2025-03-17 11:00:28,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:28,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:28,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 11:00:28,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 11:00:28,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:28,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:28,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:28,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518428459] [2025-03-17 11:00:28,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518428459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:28,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:28,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:28,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942709990] [2025-03-17 11:00:28,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:28,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:28,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:28,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:28,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:28,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 584 [2025-03-17 11:00:28,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 554 transitions, 1116 flow. Second operand has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:28,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:28,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 584 [2025-03-17 11:00:28,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:28,357 INFO L124 PetriNetUnfolderBase]: 13/594 cut-off events. [2025-03-17 11:00:28,357 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:28,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 594 events. 13/594 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 745 event pairs, 2 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 430. Up to 13 conditions per place. [2025-03-17 11:00:28,360 INFO L140 encePairwiseOnDemand]: 581/584 looper letters, 8 selfloop transitions, 2 changer transitions 0/553 dead transitions. [2025-03-17 11:00:28,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 553 transitions, 1134 flow [2025-03-17 11:00:28,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:28,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1700 transitions. [2025-03-17 11:00:28,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703196347031964 [2025-03-17 11:00:28,363 INFO L175 Difference]: Start difference. First operand has 551 places, 554 transitions, 1116 flow. Second operand 3 states and 1700 transitions. [2025-03-17 11:00:28,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 553 transitions, 1134 flow [2025-03-17 11:00:28,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 553 transitions, 1130 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:28,369 INFO L231 Difference]: Finished difference. Result has 550 places, 553 transitions, 1114 flow [2025-03-17 11:00:28,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=548, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1114, PETRI_PLACES=550, PETRI_TRANSITIONS=553} [2025-03-17 11:00:28,370 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -22 predicate places. [2025-03-17 11:00:28,370 INFO L471 AbstractCegarLoop]: Abstraction has has 550 places, 553 transitions, 1114 flow [2025-03-17 11:00:28,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:28,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:28,371 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-03-17 11:00:28,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:00:28,371 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:28,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash -782628820, now seen corresponding path program 1 times [2025-03-17 11:00:28,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:28,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500260697] [2025-03-17 11:00:28,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:28,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 11:00:28,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 11:00:28,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:28,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:28,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:28,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500260697] [2025-03-17 11:00:28,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500260697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:28,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:28,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:28,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984533652] [2025-03-17 11:00:28,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:28,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:28,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:28,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:28,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:28,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 584 [2025-03-17 11:00:28,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 553 transitions, 1114 flow. Second operand has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:28,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:28,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 584 [2025-03-17 11:00:28,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:28,541 INFO L124 PetriNetUnfolderBase]: 13/593 cut-off events. [2025-03-17 11:00:28,541 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:28,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 593 events. 13/593 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 743 event pairs, 2 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 422. Up to 13 conditions per place. [2025-03-17 11:00:28,545 INFO L140 encePairwiseOnDemand]: 581/584 looper letters, 8 selfloop transitions, 2 changer transitions 0/552 dead transitions. [2025-03-17 11:00:28,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 552 transitions, 1132 flow [2025-03-17 11:00:28,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1700 transitions. [2025-03-17 11:00:28,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703196347031964 [2025-03-17 11:00:28,548 INFO L175 Difference]: Start difference. First operand has 550 places, 553 transitions, 1114 flow. Second operand 3 states and 1700 transitions. [2025-03-17 11:00:28,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 552 transitions, 1132 flow [2025-03-17 11:00:28,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 552 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:28,555 INFO L231 Difference]: Finished difference. Result has 549 places, 552 transitions, 1112 flow [2025-03-17 11:00:28,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1112, PETRI_PLACES=549, PETRI_TRANSITIONS=552} [2025-03-17 11:00:28,557 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -23 predicate places. [2025-03-17 11:00:28,557 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 552 transitions, 1112 flow [2025-03-17 11:00:28,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.3333333333334) internal successors, (1693), 3 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:28,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:28,558 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-03-17 11:00:28,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:00:28,559 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:28,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:28,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1201600113, now seen corresponding path program 1 times [2025-03-17 11:00:28,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:28,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695657216] [2025-03-17 11:00:28,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:28,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:28,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 11:00:28,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 11:00:28,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:28,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:28,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:28,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695657216] [2025-03-17 11:00:28,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695657216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:28,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:28,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:28,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492181603] [2025-03-17 11:00:28,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:28,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:28,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:28,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:28,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:28,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 561 out of 584 [2025-03-17 11:00:28,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 552 transitions, 1112 flow. Second operand has 3 states, 3 states have (on average 562.3333333333334) internal successors, (1687), 3 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:28,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:28,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 561 of 584 [2025-03-17 11:00:28,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:28,746 INFO L124 PetriNetUnfolderBase]: 18/657 cut-off events. [2025-03-17 11:00:28,746 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:28,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 657 events. 18/657 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1068 event pairs, 5 based on Foata normal form. 0/617 useless extension candidates. Maximal degree in co-relation 489. Up to 21 conditions per place. [2025-03-17 11:00:28,749 INFO L140 encePairwiseOnDemand]: 581/584 looper letters, 10 selfloop transitions, 2 changer transitions 0/551 dead transitions. [2025-03-17 11:00:28,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 551 transitions, 1134 flow [2025-03-17 11:00:28,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:28,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:28,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1696 transitions. [2025-03-17 11:00:28,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9680365296803652 [2025-03-17 11:00:28,752 INFO L175 Difference]: Start difference. First operand has 549 places, 552 transitions, 1112 flow. Second operand 3 states and 1696 transitions. [2025-03-17 11:00:28,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 551 transitions, 1134 flow [2025-03-17 11:00:28,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 551 transitions, 1130 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:28,758 INFO L231 Difference]: Finished difference. Result has 548 places, 551 transitions, 1110 flow [2025-03-17 11:00:28,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1106, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1110, PETRI_PLACES=548, PETRI_TRANSITIONS=551} [2025-03-17 11:00:28,759 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -24 predicate places. [2025-03-17 11:00:28,759 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 551 transitions, 1110 flow [2025-03-17 11:00:28,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 562.3333333333334) internal successors, (1687), 3 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:28,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:28,761 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-03-17 11:00:28,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:00:28,761 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:28,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:28,762 INFO L85 PathProgramCache]: Analyzing trace with hash -622559582, now seen corresponding path program 1 times [2025-03-17 11:00:28,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:28,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555927237] [2025-03-17 11:00:28,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:28,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:28,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 11:00:28,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 11:00:28,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:28,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:28,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:28,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:28,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555927237] [2025-03-17 11:00:28,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555927237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:28,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:28,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:28,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487905248] [2025-03-17 11:00:28,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:28,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:28,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:28,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:28,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:28,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 584 [2025-03-17 11:00:28,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 551 transitions, 1110 flow. Second operand has 3 states, 3 states have (on average 564.0) internal successors, (1692), 3 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:28,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:28,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 584 [2025-03-17 11:00:28,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:29,035 INFO L124 PetriNetUnfolderBase]: 34/1074 cut-off events. [2025-03-17 11:00:29,036 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:00:29,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 1074 events. 34/1074 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3159 event pairs, 8 based on Foata normal form. 0/1001 useless extension candidates. Maximal degree in co-relation 905. Up to 25 conditions per place. [2025-03-17 11:00:29,046 INFO L140 encePairwiseOnDemand]: 581/584 looper letters, 9 selfloop transitions, 1 changer transitions 0/549 dead transitions. [2025-03-17 11:00:29,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 549 transitions, 1126 flow [2025-03-17 11:00:29,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:29,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:29,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1701 transitions. [2025-03-17 11:00:29,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9708904109589042 [2025-03-17 11:00:29,053 INFO L175 Difference]: Start difference. First operand has 548 places, 551 transitions, 1110 flow. Second operand 3 states and 1701 transitions. [2025-03-17 11:00:29,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 549 transitions, 1126 flow [2025-03-17 11:00:29,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 549 transitions, 1122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:29,066 INFO L231 Difference]: Finished difference. Result has 546 places, 549 transitions, 1104 flow [2025-03-17 11:00:29,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1104, PETRI_PLACES=546, PETRI_TRANSITIONS=549} [2025-03-17 11:00:29,067 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -26 predicate places. [2025-03-17 11:00:29,067 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 549 transitions, 1104 flow [2025-03-17 11:00:29,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.0) internal successors, (1692), 3 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:29,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:29,072 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-03-17 11:00:29,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:00:29,072 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:29,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:29,072 INFO L85 PathProgramCache]: Analyzing trace with hash -935705842, now seen corresponding path program 1 times [2025-03-17 11:00:29,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:29,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557991566] [2025-03-17 11:00:29,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:29,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:29,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-17 11:00:29,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 11:00:29,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:29,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:30,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:30,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557991566] [2025-03-17 11:00:30,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557991566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:30,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:30,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:00:30,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242702756] [2025-03-17 11:00:30,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:30,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:00:30,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:30,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:00:30,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:00:31,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 522 out of 584 [2025-03-17 11:00:31,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 549 transitions, 1104 flow. Second operand has 10 states, 10 states have (on average 523.3) internal successors, (5233), 10 states have internal predecessors, (5233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:31,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:31,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 522 of 584 [2025-03-17 11:00:31,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:31,225 INFO L124 PetriNetUnfolderBase]: 126/1098 cut-off events. [2025-03-17 11:00:31,226 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-17 11:00:31,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 1098 events. 126/1098 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5014 event pairs, 98 based on Foata normal form. 0/1002 useless extension candidates. Maximal degree in co-relation 1210. Up to 242 conditions per place. [2025-03-17 11:00:31,233 INFO L140 encePairwiseOnDemand]: 574/584 looper letters, 42 selfloop transitions, 9 changer transitions 0/548 dead transitions. [2025-03-17 11:00:31,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 548 transitions, 1204 flow [2025-03-17 11:00:31,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:00:31,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:00:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5272 transitions. [2025-03-17 11:00:31,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9027397260273973 [2025-03-17 11:00:31,244 INFO L175 Difference]: Start difference. First operand has 546 places, 549 transitions, 1104 flow. Second operand 10 states and 5272 transitions. [2025-03-17 11:00:31,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 548 transitions, 1204 flow [2025-03-17 11:00:31,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 548 transitions, 1203 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:00:31,252 INFO L231 Difference]: Finished difference. Result has 553 places, 548 transitions, 1119 flow [2025-03-17 11:00:31,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1119, PETRI_PLACES=553, PETRI_TRANSITIONS=548} [2025-03-17 11:00:31,253 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -19 predicate places. [2025-03-17 11:00:31,253 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 548 transitions, 1119 flow [2025-03-17 11:00:31,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 523.3) internal successors, (5233), 10 states have internal predecessors, (5233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:31,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:31,258 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-03-17 11:00:31,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:00:31,258 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:31,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:31,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1554941624, now seen corresponding path program 1 times [2025-03-17 11:00:31,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:31,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472147460] [2025-03-17 11:00:31,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:31,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:31,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-17 11:00:31,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-17 11:00:31,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:31,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:31,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:31,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:31,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472147460] [2025-03-17 11:00:31,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472147460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:31,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:31,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:31,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354422353] [2025-03-17 11:00:31,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:31,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:31,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:31,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:31,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:31,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 584 [2025-03-17 11:00:31,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 548 transitions, 1119 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:31,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:31,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 584 [2025-03-17 11:00:31,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:31,446 INFO L124 PetriNetUnfolderBase]: 22/673 cut-off events. [2025-03-17 11:00:31,446 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-17 11:00:31,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 673 events. 22/673 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1231 event pairs, 9 based on Foata normal form. 0/634 useless extension candidates. Maximal degree in co-relation 516. Up to 31 conditions per place. [2025-03-17 11:00:31,449 INFO L140 encePairwiseOnDemand]: 581/584 looper letters, 12 selfloop transitions, 2 changer transitions 0/547 dead transitions. [2025-03-17 11:00:31,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 547 transitions, 1145 flow [2025-03-17 11:00:31,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:31,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1692 transitions. [2025-03-17 11:00:31,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9657534246575342 [2025-03-17 11:00:31,453 INFO L175 Difference]: Start difference. First operand has 553 places, 548 transitions, 1119 flow. Second operand 3 states and 1692 transitions. [2025-03-17 11:00:31,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 547 transitions, 1145 flow [2025-03-17 11:00:31,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 547 transitions, 1127 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-17 11:00:31,459 INFO L231 Difference]: Finished difference. Result has 545 places, 547 transitions, 1103 flow [2025-03-17 11:00:31,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1103, PETRI_PLACES=545, PETRI_TRANSITIONS=547} [2025-03-17 11:00:31,460 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -27 predicate places. [2025-03-17 11:00:31,460 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 547 transitions, 1103 flow [2025-03-17 11:00:31,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:31,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:31,461 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-03-17 11:00:31,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:00:31,461 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:31,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:31,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1050347691, now seen corresponding path program 1 times [2025-03-17 11:00:31,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:31,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448180938] [2025-03-17 11:00:31,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:31,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:31,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-17 11:00:31,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-17 11:00:31,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:31,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:00:31,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:31,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448180938] [2025-03-17 11:00:31,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448180938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:31,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:31,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:31,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575697221] [2025-03-17 11:00:31,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:31,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:31,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:31,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:31,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:31,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 584 [2025-03-17 11:00:31,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 547 transitions, 1103 flow. Second operand has 3 states, 3 states have (on average 558.0) internal successors, (1674), 3 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:31,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:31,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 584 [2025-03-17 11:00:31,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:31,707 INFO L124 PetriNetUnfolderBase]: 45/1034 cut-off events. [2025-03-17 11:00:31,707 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-17 11:00:31,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 1034 events. 45/1034 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3492 event pairs, 20 based on Foata normal form. 0/974 useless extension candidates. Maximal degree in co-relation 895. Up to 53 conditions per place. [2025-03-17 11:00:31,710 INFO L140 encePairwiseOnDemand]: 579/584 looper letters, 13 selfloop transitions, 1 changer transitions 0/543 dead transitions. [2025-03-17 11:00:31,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 543 transitions, 1123 flow [2025-03-17 11:00:31,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:31,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1689 transitions. [2025-03-17 11:00:31,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.964041095890411 [2025-03-17 11:00:31,716 INFO L175 Difference]: Start difference. First operand has 545 places, 547 transitions, 1103 flow. Second operand 3 states and 1689 transitions. [2025-03-17 11:00:31,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 543 transitions, 1123 flow [2025-03-17 11:00:31,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 543 transitions, 1119 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:31,729 INFO L231 Difference]: Finished difference. Result has 541 places, 543 transitions, 1093 flow [2025-03-17 11:00:31,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1093, PETRI_PLACES=541, PETRI_TRANSITIONS=543} [2025-03-17 11:00:31,730 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -31 predicate places. [2025-03-17 11:00:31,730 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 543 transitions, 1093 flow [2025-03-17 11:00:31,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 558.0) internal successors, (1674), 3 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:31,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:31,730 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-03-17 11:00:31,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:00:31,731 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:31,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:31,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1016082401, now seen corresponding path program 1 times [2025-03-17 11:00:31,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:31,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236402618] [2025-03-17 11:00:31,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:31,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:31,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-17 11:00:31,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-17 11:00:31,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:31,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:31,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:00:31,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:31,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236402618] [2025-03-17 11:00:31,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236402618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:31,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:31,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:31,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476069901] [2025-03-17 11:00:31,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:31,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:31,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:31,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:31,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:31,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 584 [2025-03-17 11:00:31,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 543 transitions, 1093 flow. Second operand has 3 states, 3 states have (on average 567.6666666666666) internal successors, (1703), 3 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:31,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:31,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 584 [2025-03-17 11:00:31,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:31,938 INFO L124 PetriNetUnfolderBase]: 13/583 cut-off events. [2025-03-17 11:00:31,938 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:31,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 583 events. 13/583 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 730 event pairs, 2 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 396. Up to 11 conditions per place. [2025-03-17 11:00:31,941 INFO L140 encePairwiseOnDemand]: 582/584 looper letters, 6 selfloop transitions, 1 changer transitions 0/542 dead transitions. [2025-03-17 11:00:31,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 542 transitions, 1105 flow [2025-03-17 11:00:31,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:31,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:31,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-17 11:00:31,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9754566210045662 [2025-03-17 11:00:31,944 INFO L175 Difference]: Start difference. First operand has 541 places, 543 transitions, 1093 flow. Second operand 3 states and 1709 transitions. [2025-03-17 11:00:31,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 542 transitions, 1105 flow [2025-03-17 11:00:31,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 542 transitions, 1104 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:00:31,949 INFO L231 Difference]: Finished difference. Result has 541 places, 542 transitions, 1092 flow [2025-03-17 11:00:31,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1092, PETRI_PLACES=541, PETRI_TRANSITIONS=542} [2025-03-17 11:00:31,950 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -31 predicate places. [2025-03-17 11:00:31,950 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 542 transitions, 1092 flow [2025-03-17 11:00:31,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.6666666666666) internal successors, (1703), 3 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:31,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:31,950 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-03-17 11:00:31,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:00:31,950 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:31,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:31,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1482307944, now seen corresponding path program 1 times [2025-03-17 11:00:31,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:31,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486521223] [2025-03-17 11:00:31,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:31,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:31,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-17 11:00:31,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-17 11:00:31,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:31,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:00:32,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:32,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486521223] [2025-03-17 11:00:32,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486521223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:32,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:32,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:32,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353966444] [2025-03-17 11:00:32,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:32,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:32,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:32,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:32,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:32,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 584 [2025-03-17 11:00:32,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 542 transitions, 1092 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:32,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:32,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 584 [2025-03-17 11:00:32,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:32,125 INFO L124 PetriNetUnfolderBase]: 23/708 cut-off events. [2025-03-17 11:00:32,125 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:00:32,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 708 events. 23/708 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1525 event pairs, 8 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 546. Up to 30 conditions per place. [2025-03-17 11:00:32,130 INFO L140 encePairwiseOnDemand]: 581/584 looper letters, 13 selfloop transitions, 2 changer transitions 0/541 dead transitions. [2025-03-17 11:00:32,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 541 transitions, 1120 flow [2025-03-17 11:00:32,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1693 transitions. [2025-03-17 11:00:32,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966324200913242 [2025-03-17 11:00:32,132 INFO L175 Difference]: Start difference. First operand has 541 places, 542 transitions, 1092 flow. Second operand 3 states and 1693 transitions. [2025-03-17 11:00:32,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 541 transitions, 1120 flow [2025-03-17 11:00:32,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 541 transitions, 1119 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:00:32,138 INFO L231 Difference]: Finished difference. Result has 541 places, 541 transitions, 1093 flow [2025-03-17 11:00:32,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1093, PETRI_PLACES=541, PETRI_TRANSITIONS=541} [2025-03-17 11:00:32,139 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -31 predicate places. [2025-03-17 11:00:32,139 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 541 transitions, 1093 flow [2025-03-17 11:00:32,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:32,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:32,140 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-03-17 11:00:32,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:00:32,140 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:32,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:32,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1027531512, now seen corresponding path program 1 times [2025-03-17 11:00:32,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:32,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984528650] [2025-03-17 11:00:32,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:32,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:32,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-17 11:00:32,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-17 11:00:32,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:32,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:32,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:00:32,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:32,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984528650] [2025-03-17 11:00:32,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984528650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:32,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:32,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:32,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698845136] [2025-03-17 11:00:32,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:32,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:32,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:32,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:32,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:32,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 584 [2025-03-17 11:00:32,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 541 transitions, 1093 flow. Second operand has 3 states, 3 states have (on average 560.0) internal successors, (1680), 3 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:32,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:32,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 584 [2025-03-17 11:00:32,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:32,359 INFO L124 PetriNetUnfolderBase]: 44/1059 cut-off events. [2025-03-17 11:00:32,360 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-17 11:00:32,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 1059 events. 44/1059 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3396 event pairs, 2 based on Foata normal form. 0/1001 useless extension candidates. Maximal degree in co-relation 961. Up to 43 conditions per place. [2025-03-17 11:00:32,367 INFO L140 encePairwiseOnDemand]: 578/584 looper letters, 16 selfloop transitions, 3 changer transitions 0/544 dead transitions. [2025-03-17 11:00:32,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 544 transitions, 1141 flow [2025-03-17 11:00:32,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1699 transitions. [2025-03-17 11:00:32,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9697488584474886 [2025-03-17 11:00:32,369 INFO L175 Difference]: Start difference. First operand has 541 places, 541 transitions, 1093 flow. Second operand 3 states and 1699 transitions. [2025-03-17 11:00:32,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 544 transitions, 1141 flow [2025-03-17 11:00:32,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 544 transitions, 1137 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:00:32,378 INFO L231 Difference]: Finished difference. Result has 539 places, 539 transitions, 1096 flow [2025-03-17 11:00:32,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1083, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1096, PETRI_PLACES=539, PETRI_TRANSITIONS=539} [2025-03-17 11:00:32,379 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -33 predicate places. [2025-03-17 11:00:32,379 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 539 transitions, 1096 flow [2025-03-17 11:00:32,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 560.0) internal successors, (1680), 3 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:32,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:32,380 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] [2025-03-17 11:00:32,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:00:32,381 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:32,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:32,381 INFO L85 PathProgramCache]: Analyzing trace with hash -69339505, now seen corresponding path program 1 times [2025-03-17 11:00:32,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:32,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433135231] [2025-03-17 11:00:32,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:32,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:32,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-17 11:00:32,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-17 11:00:32,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:32,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:00:32,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:32,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433135231] [2025-03-17 11:00:32,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433135231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:32,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:32,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:32,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891085668] [2025-03-17 11:00:32,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:32,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:32,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:32,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:32,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:32,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 584 [2025-03-17 11:00:32,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 539 transitions, 1096 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:32,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:32,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 584 [2025-03-17 11:00:32,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:32,680 INFO L124 PetriNetUnfolderBase]: 45/1353 cut-off events. [2025-03-17 11:00:32,680 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 11:00:32,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 1353 events. 45/1353 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5400 event pairs, 0 based on Foata normal form. 0/1282 useless extension candidates. Maximal degree in co-relation 1228. Up to 38 conditions per place. [2025-03-17 11:00:32,686 INFO L140 encePairwiseOnDemand]: 582/584 looper letters, 10 selfloop transitions, 1 changer transitions 0/541 dead transitions. [2025-03-17 11:00:32,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 541 transitions, 1124 flow [2025-03-17 11:00:32,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1710 transitions. [2025-03-17 11:00:32,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.976027397260274 [2025-03-17 11:00:32,688 INFO L175 Difference]: Start difference. First operand has 539 places, 539 transitions, 1096 flow. Second operand 3 states and 1710 transitions. [2025-03-17 11:00:32,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 541 transitions, 1124 flow [2025-03-17 11:00:32,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 541 transitions, 1121 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:00:32,695 INFO L231 Difference]: Finished difference. Result has 539 places, 538 transitions, 1093 flow [2025-03-17 11:00:32,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1093, PETRI_PLACES=539, PETRI_TRANSITIONS=538} [2025-03-17 11:00:32,695 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -33 predicate places. [2025-03-17 11:00:32,695 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 538 transitions, 1093 flow [2025-03-17 11:00:32,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:32,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:32,696 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-03-17 11:00:32,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:00:32,696 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:32,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:32,697 INFO L85 PathProgramCache]: Analyzing trace with hash -353809408, now seen corresponding path program 1 times [2025-03-17 11:00:32,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:32,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829986305] [2025-03-17 11:00:32,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:32,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:32,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-17 11:00:32,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-17 11:00:32,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:32,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:32,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:00:32,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:32,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829986305] [2025-03-17 11:00:32,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829986305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:32,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:32,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:32,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863867101] [2025-03-17 11:00:32,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:32,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:32,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:32,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:32,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:32,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 560 out of 584 [2025-03-17 11:00:32,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 538 transitions, 1093 flow. Second operand has 3 states, 3 states have (on average 562.0) internal successors, (1686), 3 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:32,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:32,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 560 of 584 [2025-03-17 11:00:32,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:32,889 INFO L124 PetriNetUnfolderBase]: 30/858 cut-off events. [2025-03-17 11:00:32,889 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-03-17 11:00:32,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 858 events. 30/858 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2440 event pairs, 10 based on Foata normal form. 0/818 useless extension candidates. Maximal degree in co-relation 725. Up to 44 conditions per place. [2025-03-17 11:00:32,894 INFO L140 encePairwiseOnDemand]: 581/584 looper letters, 14 selfloop transitions, 2 changer transitions 0/538 dead transitions. [2025-03-17 11:00:32,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 538 transitions, 1125 flow [2025-03-17 11:00:32,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:32,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1696 transitions. [2025-03-17 11:00:32,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9680365296803652 [2025-03-17 11:00:32,896 INFO L175 Difference]: Start difference. First operand has 539 places, 538 transitions, 1093 flow. Second operand 3 states and 1696 transitions. [2025-03-17 11:00:32,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 538 transitions, 1125 flow [2025-03-17 11:00:32,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 538 transitions, 1124 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:00:32,902 INFO L231 Difference]: Finished difference. Result has 540 places, 538 transitions, 1100 flow [2025-03-17 11:00:32,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1100, PETRI_PLACES=540, PETRI_TRANSITIONS=538} [2025-03-17 11:00:32,903 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -32 predicate places. [2025-03-17 11:00:32,903 INFO L471 AbstractCegarLoop]: Abstraction has has 540 places, 538 transitions, 1100 flow [2025-03-17 11:00:32,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 562.0) internal successors, (1686), 3 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:32,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:32,903 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] [2025-03-17 11:00:32,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:00:32,903 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:32,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:32,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2084251664, now seen corresponding path program 1 times [2025-03-17 11:00:32,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:32,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694988670] [2025-03-17 11:00:32,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:32,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:32,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-17 11:00:32,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-17 11:00:32,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:32,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:32,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:00:32,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:32,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694988670] [2025-03-17 11:00:32,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694988670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:32,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:32,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:32,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130270673] [2025-03-17 11:00:32,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:32,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:32,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:32,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:32,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:32,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 584 [2025-03-17 11:00:32,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 538 transitions, 1100 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:32,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:32,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 584 [2025-03-17 11:00:32,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:33,209 INFO L124 PetriNetUnfolderBase]: 49/1449 cut-off events. [2025-03-17 11:00:33,209 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-17 11:00:33,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1535 conditions, 1449 events. 49/1449 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 6237 event pairs, 10 based on Foata normal form. 0/1381 useless extension candidates. Maximal degree in co-relation 1521. Up to 38 conditions per place. [2025-03-17 11:00:33,216 INFO L140 encePairwiseOnDemand]: 582/584 looper letters, 10 selfloop transitions, 1 changer transitions 0/540 dead transitions. [2025-03-17 11:00:33,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 540 transitions, 1128 flow [2025-03-17 11:00:33,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:33,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1710 transitions. [2025-03-17 11:00:33,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.976027397260274 [2025-03-17 11:00:33,219 INFO L175 Difference]: Start difference. First operand has 540 places, 538 transitions, 1100 flow. Second operand 3 states and 1710 transitions. [2025-03-17 11:00:33,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 540 transitions, 1128 flow [2025-03-17 11:00:33,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 540 transitions, 1126 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:00:33,226 INFO L231 Difference]: Finished difference. Result has 540 places, 537 transitions, 1098 flow [2025-03-17 11:00:33,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1098, PETRI_PLACES=540, PETRI_TRANSITIONS=537} [2025-03-17 11:00:33,227 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -32 predicate places. [2025-03-17 11:00:33,227 INFO L471 AbstractCegarLoop]: Abstraction has has 540 places, 537 transitions, 1098 flow [2025-03-17 11:00:33,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:33,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:33,228 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] [2025-03-17 11:00:33,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:00:33,228 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting whoop_wrapper_nvram_unlocked_ioctlErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:33,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:33,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1439434563, now seen corresponding path program 1 times [2025-03-17 11:00:33,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:33,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347701617] [2025-03-17 11:00:33,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:33,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:33,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-17 11:00:33,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-17 11:00:33,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:33,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:33,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:00:33,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:33,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347701617] [2025-03-17 11:00:33,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347701617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:33,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:33,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:00:33,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339472027] [2025-03-17 11:00:33,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:33,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:00:33,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:33,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:00:33,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:00:33,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 584 [2025-03-17 11:00:33,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 537 transitions, 1098 flow. Second operand has 3 states, 3 states have (on average 567.6666666666666) internal successors, (1703), 3 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:33,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:33,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 584 [2025-03-17 11:00:33,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:33,423 INFO L124 PetriNetUnfolderBase]: 23/798 cut-off events. [2025-03-17 11:00:33,423 INFO L125 PetriNetUnfolderBase]: For 11/13 co-relation queries the response was YES. [2025-03-17 11:00:33,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 798 events. 23/798 cut-off events. For 11/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2001 event pairs, 6 based on Foata normal form. 0/771 useless extension candidates. Maximal degree in co-relation 646. Up to 24 conditions per place. [2025-03-17 11:00:33,427 INFO L140 encePairwiseOnDemand]: 582/584 looper letters, 7 selfloop transitions, 1 changer transitions 1/537 dead transitions. [2025-03-17 11:00:33,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 537 transitions, 1117 flow [2025-03-17 11:00:33,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:00:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:00:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1708 transitions. [2025-03-17 11:00:33,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9748858447488584 [2025-03-17 11:00:33,452 INFO L175 Difference]: Start difference. First operand has 540 places, 537 transitions, 1098 flow. Second operand 3 states and 1708 transitions. [2025-03-17 11:00:33,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 537 transitions, 1117 flow [2025-03-17 11:00:33,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 537 transitions, 1116 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:00:33,459 INFO L231 Difference]: Finished difference. Result has 540 places, 536 transitions, 1097 flow [2025-03-17 11:00:33,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1097, PETRI_PLACES=540, PETRI_TRANSITIONS=536} [2025-03-17 11:00:33,460 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -32 predicate places. [2025-03-17 11:00:33,461 INFO L471 AbstractCegarLoop]: Abstraction has has 540 places, 536 transitions, 1097 flow [2025-03-17 11:00:33,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.6666666666666) internal successors, (1703), 3 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:33,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:33,461 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] [2025-03-17 11:00:33,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:00:33,461 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:33,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:33,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1586416409, now seen corresponding path program 1 times [2025-03-17 11:00:33,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:33,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577734160] [2025-03-17 11:00:33,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:33,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:33,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-17 11:00:33,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-17 11:00:33,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:33,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:00:35,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:35,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577734160] [2025-03-17 11:00:35,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577734160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:35,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:35,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:00:35,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759542304] [2025-03-17 11:00:35,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:35,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:00:35,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:35,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:00:35,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:00:35,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 520 out of 584 [2025-03-17 11:00:35,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 536 transitions, 1097 flow. Second operand has 10 states, 10 states have (on average 522.0) internal successors, (5220), 10 states have internal predecessors, (5220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:35,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:35,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 520 of 584 [2025-03-17 11:00:35,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:36,049 INFO L124 PetriNetUnfolderBase]: 303/2807 cut-off events. [2025-03-17 11:00:36,049 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 11:00:36,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3476 conditions, 2807 events. 303/2807 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 21370 event pairs, 47 based on Foata normal form. 0/2659 useless extension candidates. Maximal degree in co-relation 3268. Up to 323 conditions per place. [2025-03-17 11:00:36,061 INFO L140 encePairwiseOnDemand]: 550/584 looper letters, 67 selfloop transitions, 45 changer transitions 6/594 dead transitions. [2025-03-17 11:00:36,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 594 transitions, 1455 flow [2025-03-17 11:00:36,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:00:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:00:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5316 transitions. [2025-03-17 11:00:36,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9102739726027397 [2025-03-17 11:00:36,070 INFO L175 Difference]: Start difference. First operand has 540 places, 536 transitions, 1097 flow. Second operand 10 states and 5316 transitions. [2025-03-17 11:00:36,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 594 transitions, 1455 flow [2025-03-17 11:00:36,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 594 transitions, 1454 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:00:36,076 INFO L231 Difference]: Finished difference. Result has 557 places, 573 transitions, 1413 flow [2025-03-17 11:00:36,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1413, PETRI_PLACES=557, PETRI_TRANSITIONS=573} [2025-03-17 11:00:36,077 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, -15 predicate places. [2025-03-17 11:00:36,077 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 573 transitions, 1413 flow [2025-03-17 11:00:36,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 522.0) internal successors, (5220), 10 states have internal predecessors, (5220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:36,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:36,078 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] [2025-03-17 11:00:36,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 11:00:36,078 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:36,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:36,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2096152809, now seen corresponding path program 1 times [2025-03-17 11:00:36,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:36,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233465768] [2025-03-17 11:00:36,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:00:36,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:36,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-17 11:00:36,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-17 11:00:36,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:00:36,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:00:41,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:41,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233465768] [2025-03-17 11:00:41,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233465768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:41,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:41,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2025-03-17 11:00:41,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309133388] [2025-03-17 11:00:41,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:41,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-17 11:00:41,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:41,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-17 11:00:41,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1024, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 11:00:45,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 584 [2025-03-17 11:00:45,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 573 transitions, 1413 flow. Second operand has 35 states, 35 states have (on average 477.22857142857146) internal successors, (16703), 35 states have internal predecessors, (16703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:45,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:45,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 584 [2025-03-17 11:00:45,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:00:48,589 INFO L124 PetriNetUnfolderBase]: 840/4631 cut-off events. [2025-03-17 11:00:48,590 INFO L125 PetriNetUnfolderBase]: For 675/743 co-relation queries the response was YES. [2025-03-17 11:00:48,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7645 conditions, 4631 events. 840/4631 cut-off events. For 675/743 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 38989 event pairs, 29 based on Foata normal form. 74/4513 useless extension candidates. Maximal degree in co-relation 7392. Up to 548 conditions per place. [2025-03-17 11:00:48,614 INFO L140 encePairwiseOnDemand]: 511/584 looper letters, 186 selfloop transitions, 103 changer transitions 0/722 dead transitions. [2025-03-17 11:00:48,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 722 transitions, 2569 flow [2025-03-17 11:00:48,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-17 11:00:48,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-17 11:00:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 15451 transitions. [2025-03-17 11:00:48,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.826787243150685 [2025-03-17 11:00:48,622 INFO L175 Difference]: Start difference. First operand has 557 places, 573 transitions, 1413 flow. Second operand 32 states and 15451 transitions. [2025-03-17 11:00:48,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 722 transitions, 2569 flow [2025-03-17 11:00:48,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 582 places, 722 transitions, 2569 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:00:48,635 INFO L231 Difference]: Finished difference. Result has 593 places, 607 transitions, 1977 flow [2025-03-17 11:00:48,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1413, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1977, PETRI_PLACES=593, PETRI_TRANSITIONS=607} [2025-03-17 11:00:48,636 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, 21 predicate places. [2025-03-17 11:00:48,636 INFO L471 AbstractCegarLoop]: Abstraction has has 593 places, 607 transitions, 1977 flow [2025-03-17 11:00:48,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 477.22857142857146) internal successors, (16703), 35 states have internal predecessors, (16703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:48,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:00:48,640 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] [2025-03-17 11:00:48,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 11:00:48,640 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:00:48,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:00:48,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1418166343, now seen corresponding path program 2 times [2025-03-17 11:00:48,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:00:48,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188211341] [2025-03-17 11:00:48,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:00:48,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:00:48,666 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 360 statements into 2 equivalence classes. [2025-03-17 11:00:48,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 357 of 360 statements. [2025-03-17 11:00:48,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:00:48,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:00:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:00:53,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:00:53,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188211341] [2025-03-17 11:00:53,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188211341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:00:53,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:00:53,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2025-03-17 11:00:53,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725897796] [2025-03-17 11:00:53,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:00:53,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-17 11:00:53,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:00:53,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-17 11:00:53,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 11:00:57,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 584 [2025-03-17 11:00:57,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 607 transitions, 1977 flow. Second operand has 35 states, 35 states have (on average 477.22857142857146) internal successors, (16703), 35 states have internal predecessors, (16703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:00:57,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:00:57,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 584 [2025-03-17 11:00:57,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:01:00,206 INFO L124 PetriNetUnfolderBase]: 1169/6565 cut-off events. [2025-03-17 11:01:00,207 INFO L125 PetriNetUnfolderBase]: For 4417/5028 co-relation queries the response was YES. [2025-03-17 11:01:00,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12428 conditions, 6565 events. 1169/6565 cut-off events. For 4417/5028 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 60843 event pairs, 114 based on Foata normal form. 175/6425 useless extension candidates. Maximal degree in co-relation 12130. Up to 608 conditions per place. [2025-03-17 11:01:00,240 INFO L140 encePairwiseOnDemand]: 519/584 looper letters, 350 selfloop transitions, 147 changer transitions 0/930 dead transitions. [2025-03-17 11:01:00,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 930 transitions, 5129 flow [2025-03-17 11:01:00,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-17 11:01:00,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-17 11:01:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 16922 transitions. [2025-03-17 11:01:00,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8278864970645793 [2025-03-17 11:01:00,249 INFO L175 Difference]: Start difference. First operand has 593 places, 607 transitions, 1977 flow. Second operand 35 states and 16922 transitions. [2025-03-17 11:01:00,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 930 transitions, 5129 flow [2025-03-17 11:01:00,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 930 transitions, 5037 flow, removed 0 selfloop flow, removed 20 redundant places. [2025-03-17 11:01:00,273 INFO L231 Difference]: Finished difference. Result has 623 places, 706 transitions, 3290 flow [2025-03-17 11:01:00,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=3290, PETRI_PLACES=623, PETRI_TRANSITIONS=706} [2025-03-17 11:01:00,274 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, 51 predicate places. [2025-03-17 11:01:00,274 INFO L471 AbstractCegarLoop]: Abstraction has has 623 places, 706 transitions, 3290 flow [2025-03-17 11:01:00,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 477.22857142857146) internal successors, (16703), 35 states have internal predecessors, (16703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:01:00,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:01:00,277 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] [2025-03-17 11:01:00,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 11:01:00,277 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:01:00,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:01:00,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1917963737, now seen corresponding path program 3 times [2025-03-17 11:01:00,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:01:00,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121927421] [2025-03-17 11:01:00,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:01:00,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:01:00,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 360 statements into 3 equivalence classes. [2025-03-17 11:01:00,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 357 of 360 statements. [2025-03-17 11:01:00,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 11:01:00,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:01:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:01:04,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:01:04,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121927421] [2025-03-17 11:01:04,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121927421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:01:04,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:01:04,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2025-03-17 11:01:04,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632729207] [2025-03-17 11:01:04,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:01:04,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-17 11:01:04,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:01:04,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-17 11:01:04,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 11:01:07,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 584 [2025-03-17 11:01:07,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 706 transitions, 3290 flow. Second operand has 35 states, 35 states have (on average 477.22857142857146) internal successors, (16703), 35 states have internal predecessors, (16703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:01:07,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:01:07,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 584 [2025-03-17 11:01:07,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:01:11,755 INFO L124 PetriNetUnfolderBase]: 1773/8370 cut-off events. [2025-03-17 11:01:11,755 INFO L125 PetriNetUnfolderBase]: For 14901/15635 co-relation queries the response was YES. [2025-03-17 11:01:11,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21130 conditions, 8370 events. 1773/8370 cut-off events. For 14901/15635 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 80636 event pairs, 98 based on Foata normal form. 184/8166 useless extension candidates. Maximal degree in co-relation 20801. Up to 1395 conditions per place. [2025-03-17 11:01:11,805 INFO L140 encePairwiseOnDemand]: 511/584 looper letters, 385 selfloop transitions, 216 changer transitions 0/1034 dead transitions. [2025-03-17 11:01:11,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 1034 transitions, 7338 flow [2025-03-17 11:01:11,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 11:01:11,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-17 11:01:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 15952 transitions. [2025-03-17 11:01:11,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8277293482772935 [2025-03-17 11:01:11,814 INFO L175 Difference]: Start difference. First operand has 623 places, 706 transitions, 3290 flow. Second operand 33 states and 15952 transitions. [2025-03-17 11:01:11,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 1034 transitions, 7338 flow [2025-03-17 11:01:11,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 1034 transitions, 7279 flow, removed 12 selfloop flow, removed 18 redundant places. [2025-03-17 11:01:11,890 INFO L231 Difference]: Finished difference. Result has 649 places, 850 transitions, 5713 flow [2025-03-17 11:01:11,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=3233, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=706, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=5713, PETRI_PLACES=649, PETRI_TRANSITIONS=850} [2025-03-17 11:01:11,892 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, 77 predicate places. [2025-03-17 11:01:11,892 INFO L471 AbstractCegarLoop]: Abstraction has has 649 places, 850 transitions, 5713 flow [2025-03-17 11:01:11,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 477.22857142857146) internal successors, (16703), 35 states have internal predecessors, (16703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:01:11,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:01:11,895 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] [2025-03-17 11:01:11,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 11:01:11,896 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:01:11,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:01:11,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2018315861, now seen corresponding path program 4 times [2025-03-17 11:01:11,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:01:11,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021839876] [2025-03-17 11:01:11,897 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:01:11,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:01:11,921 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 360 statements into 2 equivalence classes. [2025-03-17 11:01:11,968 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 360 of 360 statements. [2025-03-17 11:01:11,968 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:01:11,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:01:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:01:16,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:01:16,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021839876] [2025-03-17 11:01:16,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021839876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:01:16,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:01:16,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-03-17 11:01:16,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77798850] [2025-03-17 11:01:16,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:01:16,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 11:01:16,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:01:16,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 11:01:16,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2025-03-17 11:01:19,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 489 out of 584 [2025-03-17 11:01:19,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 850 transitions, 5713 flow. Second operand has 27 states, 27 states have (on average 491.037037037037) internal successors, (13258), 27 states have internal predecessors, (13258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:01:19,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:01:19,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 489 of 584 [2025-03-17 11:01:19,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:01:24,632 INFO L124 PetriNetUnfolderBase]: 2614/11864 cut-off events. [2025-03-17 11:01:24,632 INFO L125 PetriNetUnfolderBase]: For 36181/37123 co-relation queries the response was YES. [2025-03-17 11:01:24,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34193 conditions, 11864 events. 2614/11864 cut-off events. For 36181/37123 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 122153 event pairs, 215 based on Foata normal form. 375/11730 useless extension candidates. Maximal degree in co-relation 33852. Up to 1173 conditions per place. [2025-03-17 11:01:24,723 INFO L140 encePairwiseOnDemand]: 534/584 looper letters, 650 selfloop transitions, 418 changer transitions 0/1515 dead transitions. [2025-03-17 11:01:24,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 1515 transitions, 14379 flow [2025-03-17 11:01:24,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-17 11:01:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-03-17 11:01:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 24491 transitions. [2025-03-17 11:01:24,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8558498741962538 [2025-03-17 11:01:24,735 INFO L175 Difference]: Start difference. First operand has 649 places, 850 transitions, 5713 flow. Second operand 49 states and 24491 transitions. [2025-03-17 11:01:24,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 1515 transitions, 14379 flow [2025-03-17 11:01:24,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 1515 transitions, 14264 flow, removed 40 selfloop flow, removed 18 redundant places. [2025-03-17 11:01:24,895 INFO L231 Difference]: Finished difference. Result has 713 places, 1139 transitions, 10940 flow [2025-03-17 11:01:24,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=584, PETRI_DIFFERENCE_MINUEND_FLOW=5636, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=850, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=10940, PETRI_PLACES=713, PETRI_TRANSITIONS=1139} [2025-03-17 11:01:24,896 INFO L279 CegarLoopForPetriNet]: 572 programPoint places, 141 predicate places. [2025-03-17 11:01:24,897 INFO L471 AbstractCegarLoop]: Abstraction has has 713 places, 1139 transitions, 10940 flow [2025-03-17 11:01:24,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 491.037037037037) internal successors, (13258), 27 states have internal predecessors, (13258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:01:24,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:01:24,898 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] [2025-03-17 11:01:24,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 11:01:24,898 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-17 11:01:24,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:01:24,901 INFO L85 PathProgramCache]: Analyzing trace with hash 2032342231, now seen corresponding path program 5 times [2025-03-17 11:01:24,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:01:24,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83183187] [2025-03-17 11:01:24,901 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:01:24,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:01:24,927 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 360 statements into 3 equivalence classes. [2025-03-17 11:01:24,991 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 360 of 360 statements. [2025-03-17 11:01:24,991 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 11:01:24,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:01:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:01:28,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:01:28,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83183187] [2025-03-17 11:01:28,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83183187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:01:28,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138516417] [2025-03-17 11:01:28,692 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:01:28,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:01:28,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:01:28,694 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:01:28,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:01:28,913 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 360 statements into 3 equivalence classes. [2025-03-17 11:01:29,046 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 360 of 360 statements. [2025-03-17 11:01:29,046 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 11:01:29,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:01:29,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-03-17 11:01:29,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:01:29,230 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 11:01:29,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 11:01:29,276 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 11:01:29,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 11:01:29,405 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-17 11:01:29,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-17 11:01:29,481 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-17 11:01:29,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-03-17 11:01:29,660 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-17 11:01:29,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-03-17 11:01:29,779 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-17 11:01:29,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-03-17 11:01:29,883 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-17 11:01:29,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-03-17 11:01:29,996 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-17 11:01:29,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-03-17 11:01:30,101 INFO L349 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2025-03-17 11:01:30,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2025-03-17 11:01:30,248 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-17 11:01:30,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-03-17 11:01:30,472 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-17 11:01:30,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-17 11:01:30,626 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-17 11:01:30,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-17 11:01:30,795 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-17 11:01:30,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-17 11:01:30,963 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-17 11:01:30,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-17 11:01:31,116 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-17 11:01:31,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-03-17 11:01:31,341 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-17 11:01:31,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-17 11:01:31,506 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2025-03-17 11:01:31,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2025-03-17 11:01:31,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:01:31,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 11:01:32,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:01:32,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-17 11:01:32,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:01:32,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-17 11:01:32,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:01:32,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2025-03-17 11:01:32,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:01:32,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-03-17 11:01:32,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:01:32,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2025-03-17 11:01:32,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:01:32,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 75 treesize of output 92 [2025-03-17 11:01:32,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 60 [2025-03-17 11:01:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:01:32,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:01:32,735 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1498 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)))) (forall ((v_ArrVal_1498 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)))) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 7 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|))) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0))) is different from false [2025-03-17 11:01:32,756 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base| (store (select |c_#race| |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= 0 (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)))) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset| 1)) 0))))) is different from false [2025-03-17 11:01:32,775 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base| (store (select |c_#race| |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_#in~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_#in~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_#in~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_#in~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_#in~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_#in~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_#in~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork0_mutex_lock_#in~lock#1.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0))))) is different from false [2025-03-17 11:01:32,808 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base| (store (select |c_#race| |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0))))) is different from false [2025-03-17 11:01:33,006 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) (.cse2 (+ 7 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base| (store (store (select |c_#race| |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse2) 0))))) is different from false [2025-03-17 11:01:33,026 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 5 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) (.cse1 (+ 6 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) (.cse2 (+ 7 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base| (store (store (store (select |c_#race| |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse3 0) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse2) 0)) (forall ((v_ArrVal_1498 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1498) |c_whoop_wrapper_write_nvramThread1of1ForFork1_write_nvram_~ppos#1.base|) .cse3) 0))))) is different from false [2025-03-17 11:01:33,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:01:33,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 91 [2025-03-17 11:01:33,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:01:33,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 104 treesize of output 52 [2025-03-17 11:01:33,898 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-17 11:01:33,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2025-03-17 11:01:33,903 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-17 11:01:33,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 1 [2025-03-17 11:01:33,908 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-17 11:01:33,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2025-03-17 11:01:33,913 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-17 11:01:33,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2025-03-17 11:01:33,919 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-17 11:01:33,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2025-03-17 11:01:33,925 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-17 11:01:33,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2025-03-17 11:01:33,929 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-17 11:01:33,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1