./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 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_read_nvram_nvram_unlocked_ioctl.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 3cf9a63e6b69549a73ec0cdf90051f21ab19a39a485979f4709a706d3ba6e298 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:41:19,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:41:19,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:41:19,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:41:19,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:41:19,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:41:19,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:41:19,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:41:19,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:41:19,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:41:19,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:41:19,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:41:19,221 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:41:19,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:41:19,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:41:19,221 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:41:19,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:41:19,221 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:41:19,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:41:19,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:41:19,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:41:19,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:41:19,221 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:41:19,221 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:41:19,223 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:41:19,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:41:19,223 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:41:19,223 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:41:19,223 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:41:19,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:41:19,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:41:19,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:41:19,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:41:19,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:41:19,224 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:41:19,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:41:19,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:41:19,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:41:19,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:41:19,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:41:19,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:41:19,224 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:41:19,224 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 -> 3cf9a63e6b69549a73ec0cdf90051f21ab19a39a485979f4709a706d3ba6e298 [2025-03-04 06:41:19,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:41:19,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:41:19,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:41:19,447 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:41:19,447 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:41:19,448 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_read_nvram_nvram_unlocked_ioctl.i [2025-03-04 06:41:20,570 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1be59b57/31ba81b6f7394eb1b7901a02c4a73d80/FLAGd1570ba00 [2025-03-04 06:41:21,101 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:41:21,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i [2025-03-04 06:41:21,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1be59b57/31ba81b6f7394eb1b7901a02c4a73d80/FLAGd1570ba00 [2025-03-04 06:41:21,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1be59b57/31ba81b6f7394eb1b7901a02c4a73d80 [2025-03-04 06:41:21,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:41:21,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:41:21,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:41:21,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:41:21,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:41:21,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:41:21" (1/1) ... [2025-03-04 06:41:21,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20dec34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:41:21, skipping insertion in model container [2025-03-04 06:41:21,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:41:21" (1/1) ... [2025-03-04 06:41:21,728 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:41:27,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:41:27,086 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:41:27,181 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-04 06:41:27,183 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-04 06:41:27,183 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-04 06:41:27,183 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-04 06:41:27,312 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] [2025-03-04 06:41:27,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:41:27,644 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:41:27,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:41:27 WrapperNode [2025-03-04 06:41:27,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:41:27,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:41:27,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:41:27,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:41:27,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:41:27" (1/1) ... [2025-03-04 06:41:27,761 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:41:27" (1/1) ... [2025-03-04 06:41:27,814 INFO L138 Inliner]: procedures = 1354, calls = 1464, calls flagged for inlining = 353, calls inlined = 20, statements flattened = 523 [2025-03-04 06:41:27,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:41:27,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:41:27,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:41:27,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:41:27,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:41:27" (1/1) ... [2025-03-04 06:41:27,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:41:27" (1/1) ... [2025-03-04 06:41:27,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:41:27" (1/1) ... [2025-03-04 06:41:27,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:41:27" (1/1) ... [2025-03-04 06:41:27,858 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:41:27" (1/1) ... [2025-03-04 06:41:27,860 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:41:27" (1/1) ... [2025-03-04 06:41:27,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:41:27" (1/1) ... [2025-03-04 06:41:27,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:41:27" (1/1) ... [2025-03-04 06:41:27,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:41:27,877 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:41:27,877 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:41:27,877 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:41:27,878 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:41:27" (1/1) ... [2025-03-04 06:41:27,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:41:27,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:41:27,910 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-04 06:41:27,913 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-04 06:41:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:41:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:41:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_nvram_unlocked_ioctl [2025-03-04 06:41:27,932 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_nvram_unlocked_ioctl [2025-03-04 06:41:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:41:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:41:27,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:41:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:41:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_read_nvram [2025-03-04 06:41:27,932 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_read_nvram [2025-03-04 06:41:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:41:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:41:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 06:41:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:41:27,934 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:41:28,265 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:41:28,267 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:41:28,487 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6551: havoc access_ok_#t~nondet1286#1; [2025-03-04 06:41:28,487 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543: havoc __put_user_#t~nondet1284#1; [2025-03-04 06:41:28,487 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6636: havoc nvram_read_byte_#t~nondet1302#1; [2025-03-04 06:41:28,735 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6632: havoc nvram_get_size_#t~nondet1301#1; [2025-03-04 06:41:28,735 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6650: havoc printk_#t~nondet1304#1; [2025-03-04 06:41:28,735 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6624: havoc misc_register_#t~nondet1299#1; [2025-03-04 06:41:28,806 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:41:28,806 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:41:28,866 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:41:28,866 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:41:28,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:41:28 BoogieIcfgContainer [2025-03-04 06:41:28,867 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:41:28,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:41:28,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:41:28,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:41:28,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:41:21" (1/3) ... [2025-03-04 06:41:28,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16578667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:41:28, skipping insertion in model container [2025-03-04 06:41:28,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:41:27" (2/3) ... [2025-03-04 06:41:28,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16578667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:41:28, skipping insertion in model container [2025-03-04 06:41:28,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:41:28" (3/3) ... [2025-03-04 06:41:28,875 INFO L128 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i [2025-03-04 06:41:28,886 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:41:28,888 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i that has 3 procedures, 575 locations, 1 initial locations, 1 loop locations, and 41 error locations. [2025-03-04 06:41:28,889 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:41:29,002 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:41:29,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 581 places, 587 transitions, 1188 flow [2025-03-04 06:41:29,217 INFO L124 PetriNetUnfolderBase]: 13/585 cut-off events. [2025-03-04 06:41:29,218 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:41:29,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 585 events. 13/585 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 617 event pairs, 0 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 516. Up to 4 conditions per place. [2025-03-04 06:41:29,224 INFO L82 GeneralOperation]: Start removeDead. Operand has 581 places, 587 transitions, 1188 flow [2025-03-04 06:41:29,229 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 575 places, 581 transitions, 1171 flow [2025-03-04 06:41:29,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:41:29,248 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;@5ec000c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:41:29,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-03-04 06:41:29,266 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:41:29,267 INFO L124 PetriNetUnfolderBase]: 0/87 cut-off events. [2025-03-04 06:41:29,267 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:41:29,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:29,268 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-04 06:41:29,268 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:29,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:29,273 INFO L85 PathProgramCache]: Analyzing trace with hash 166177313, now seen corresponding path program 1 times [2025-03-04 06:41:29,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:29,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861912162] [2025-03-04 06:41:29,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:29,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:29,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 06:41:29,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 06:41:29,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:29,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:41:29,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:29,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861912162] [2025-03-04 06:41:29,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861912162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:29,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:29,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:29,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366511793] [2025-03-04 06:41:29,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:29,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:29,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:29,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:29,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:29,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-04 06:41:29,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 581 transitions, 1171 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-04 06:41:29,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:29,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-04 06:41:29,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:29,781 INFO L124 PetriNetUnfolderBase]: 13/613 cut-off events. [2025-03-04 06:41:29,782 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-03-04 06:41:29,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 613 events. 13/613 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 835 event pairs, 2 based on Foata normal form. 4/566 useless extension candidates. Maximal degree in co-relation 515. Up to 13 conditions per place. [2025-03-04 06:41:29,788 INFO L140 encePairwiseOnDemand]: 577/587 looper letters, 8 selfloop transitions, 2 changer transitions 1/571 dead transitions. [2025-03-04 06:41:29,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 571 transitions, 1171 flow [2025-03-04 06:41:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:29,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1716 transitions. [2025-03-04 06:41:29,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9744463373083475 [2025-03-04 06:41:29,807 INFO L175 Difference]: Start difference. First operand has 575 places, 581 transitions, 1171 flow. Second operand 3 states and 1716 transitions. [2025-03-04 06:41:29,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 571 transitions, 1171 flow [2025-03-04 06:41:29,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 571 transitions, 1166 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 06:41:29,830 INFO L231 Difference]: Finished difference. Result has 568 places, 570 transitions, 1148 flow [2025-03-04 06:41:29,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1148, PETRI_PLACES=568, PETRI_TRANSITIONS=570} [2025-03-04 06:41:29,836 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -7 predicate places. [2025-03-04 06:41:29,837 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 570 transitions, 1148 flow [2025-03-04 06:41:29,838 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-04 06:41:29,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:29,839 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-04 06:41:29,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:41:29,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:29,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:29,841 INFO L85 PathProgramCache]: Analyzing trace with hash 744000344, now seen corresponding path program 1 times [2025-03-04 06:41:29,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:29,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536889690] [2025-03-04 06:41:29,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:29,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:29,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 06:41:29,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 06:41:29,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:29,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:29,983 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-04 06:41:29,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:29,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536889690] [2025-03-04 06:41:29,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536889690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:29,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:29,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:29,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206796118] [2025-03-04 06:41:29,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:29,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:29,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:29,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:29,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:29,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-04 06:41:30,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 570 transitions, 1148 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-04 06:41:30,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:30,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-04 06:41:30,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:30,092 INFO L124 PetriNetUnfolderBase]: 13/611 cut-off events. [2025-03-04 06:41:30,092 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-04 06:41:30,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 611 events. 13/611 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 831 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 538. Up to 13 conditions per place. [2025-03-04 06:41:30,096 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/569 dead transitions. [2025-03-04 06:41:30,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 569 transitions, 1166 flow [2025-03-04 06:41:30,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-04 06:41:30,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-04 06:41:30,100 INFO L175 Difference]: Start difference. First operand has 568 places, 570 transitions, 1148 flow. Second operand 3 states and 1709 transitions. [2025-03-04 06:41:30,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 569 transitions, 1166 flow [2025-03-04 06:41:30,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 569 transitions, 1162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:30,107 INFO L231 Difference]: Finished difference. Result has 566 places, 569 transitions, 1146 flow [2025-03-04 06:41:30,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1146, PETRI_PLACES=566, PETRI_TRANSITIONS=569} [2025-03-04 06:41:30,108 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -9 predicate places. [2025-03-04 06:41:30,108 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 569 transitions, 1146 flow [2025-03-04 06:41:30,109 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-04 06:41:30,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:30,110 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-04 06:41:30,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:41:30,110 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:30,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:30,110 INFO L85 PathProgramCache]: Analyzing trace with hash 784792730, now seen corresponding path program 1 times [2025-03-04 06:41:30,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:30,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699244781] [2025-03-04 06:41:30,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:30,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:30,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 06:41:30,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 06:41:30,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:30,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:30,215 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-04 06:41:30,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:30,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699244781] [2025-03-04 06:41:30,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699244781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:30,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:30,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:30,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476605350] [2025-03-04 06:41:30,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:30,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:30,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:30,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:30,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:30,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-04 06:41:30,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 569 transitions, 1146 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-04 06:41:30,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:30,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-04 06:41:30,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:30,302 INFO L124 PetriNetUnfolderBase]: 13/610 cut-off events. [2025-03-04 06:41:30,303 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-04 06:41:30,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 610 events. 13/610 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 828 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 530. Up to 13 conditions per place. [2025-03-04 06:41:30,307 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/568 dead transitions. [2025-03-04 06:41:30,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 568 transitions, 1164 flow [2025-03-04 06:41:30,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:30,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-04 06:41:30,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-04 06:41:30,312 INFO L175 Difference]: Start difference. First operand has 566 places, 569 transitions, 1146 flow. Second operand 3 states and 1709 transitions. [2025-03-04 06:41:30,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 568 transitions, 1164 flow [2025-03-04 06:41:30,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 568 transitions, 1160 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:30,320 INFO L231 Difference]: Finished difference. Result has 565 places, 568 transitions, 1144 flow [2025-03-04 06:41:30,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, 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=1144, PETRI_PLACES=565, PETRI_TRANSITIONS=568} [2025-03-04 06:41:30,322 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -10 predicate places. [2025-03-04 06:41:30,322 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 568 transitions, 1144 flow [2025-03-04 06:41:30,323 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-04 06:41:30,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:30,323 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-04 06:41:30,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:41:30,324 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:30,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:30,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1895695037, now seen corresponding path program 1 times [2025-03-04 06:41:30,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:30,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970867216] [2025-03-04 06:41:30,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:30,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:30,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 06:41:30,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 06:41:30,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:30,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:41:30,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:30,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970867216] [2025-03-04 06:41:30,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970867216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:30,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:30,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:30,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313723426] [2025-03-04 06:41:30,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:30,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:30,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:30,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:30,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:30,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 587 [2025-03-04 06:41:30,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 568 transitions, 1144 flow. Second operand has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 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-04 06:41:30,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:30,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 587 [2025-03-04 06:41:30,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:30,613 INFO L124 PetriNetUnfolderBase]: 29/1066 cut-off events. [2025-03-04 06:41:30,614 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:41:30,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 1066 events. 29/1066 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3022 event pairs, 5 based on Foata normal form. 0/971 useless extension candidates. Maximal degree in co-relation 988. Up to 20 conditions per place. [2025-03-04 06:41:30,618 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 9 selfloop transitions, 2 changer transitions 0/567 dead transitions. [2025-03-04 06:41:30,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 567 transitions, 1164 flow [2025-03-04 06:41:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:30,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1707 transitions. [2025-03-04 06:41:30,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969335604770017 [2025-03-04 06:41:30,621 INFO L175 Difference]: Start difference. First operand has 565 places, 568 transitions, 1144 flow. Second operand 3 states and 1707 transitions. [2025-03-04 06:41:30,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 567 transitions, 1164 flow [2025-03-04 06:41:30,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 567 transitions, 1160 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:30,630 INFO L231 Difference]: Finished difference. Result has 564 places, 567 transitions, 1142 flow [2025-03-04 06:41:30,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=564, PETRI_TRANSITIONS=567} [2025-03-04 06:41:30,632 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -11 predicate places. [2025-03-04 06:41:30,632 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 567 transitions, 1142 flow [2025-03-04 06:41:30,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 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-04 06:41:30,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:30,633 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-04 06:41:30,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:41:30,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:30,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:30,634 INFO L85 PathProgramCache]: Analyzing trace with hash 19953635, now seen corresponding path program 1 times [2025-03-04 06:41:30,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:30,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973026402] [2025-03-04 06:41:30,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:30,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:30,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 06:41:30,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 06:41:30,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:30,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:30,719 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-04 06:41:30,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:30,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973026402] [2025-03-04 06:41:30,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973026402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:30,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:30,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:30,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668224682] [2025-03-04 06:41:30,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:30,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:30,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:30,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:30,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:30,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-04 06:41:30,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 567 transitions, 1142 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-04 06:41:30,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:30,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-04 06:41:30,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:30,797 INFO L124 PetriNetUnfolderBase]: 13/608 cut-off events. [2025-03-04 06:41:30,798 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-04 06:41:30,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 608 events. 13/608 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 816 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 514. Up to 13 conditions per place. [2025-03-04 06:41:30,801 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/566 dead transitions. [2025-03-04 06:41:30,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 566 transitions, 1160 flow [2025-03-04 06:41:30,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:30,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:30,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-04 06:41:30,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-04 06:41:30,808 INFO L175 Difference]: Start difference. First operand has 564 places, 567 transitions, 1142 flow. Second operand 3 states and 1709 transitions. [2025-03-04 06:41:30,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 566 transitions, 1160 flow [2025-03-04 06:41:30,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 566 transitions, 1156 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:30,815 INFO L231 Difference]: Finished difference. Result has 563 places, 566 transitions, 1140 flow [2025-03-04 06:41:30,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, 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-04 06:41:30,816 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -12 predicate places. [2025-03-04 06:41:30,817 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 566 transitions, 1140 flow [2025-03-04 06:41:30,818 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-04 06:41:30,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:30,818 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-04 06:41:30,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:41:30,819 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:30,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:30,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1195549601, now seen corresponding path program 1 times [2025-03-04 06:41:30,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:30,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139642511] [2025-03-04 06:41:30,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:30,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:30,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 06:41:30,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 06:41:30,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:30,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:30,884 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-04 06:41:30,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:30,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139642511] [2025-03-04 06:41:30,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139642511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:30,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:30,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:30,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185236420] [2025-03-04 06:41:30,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:30,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:30,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:30,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:30,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:30,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 587 [2025-03-04 06:41:30,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 566 transitions, 1140 flow. Second operand has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 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-04 06:41:30,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:30,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 587 [2025-03-04 06:41:30,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:30,992 INFO L124 PetriNetUnfolderBase]: 14/627 cut-off events. [2025-03-04 06:41:30,993 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-04 06:41:30,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 627 events. 14/627 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 924 event pairs, 3 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 529. Up to 16 conditions per place. [2025-03-04 06:41:30,997 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 9 selfloop transitions, 2 changer transitions 0/565 dead transitions. [2025-03-04 06:41:30,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 565 transitions, 1160 flow [2025-03-04 06:41:31,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1707 transitions. [2025-03-04 06:41:31,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969335604770017 [2025-03-04 06:41:31,005 INFO L175 Difference]: Start difference. First operand has 563 places, 566 transitions, 1140 flow. Second operand 3 states and 1707 transitions. [2025-03-04 06:41:31,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 565 transitions, 1160 flow [2025-03-04 06:41:31,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 565 transitions, 1156 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:31,012 INFO L231 Difference]: Finished difference. Result has 562 places, 565 transitions, 1138 flow [2025-03-04 06:41:31,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, 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-04 06:41:31,014 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -13 predicate places. [2025-03-04 06:41:31,015 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 565 transitions, 1138 flow [2025-03-04 06:41:31,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 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-04 06:41:31,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:31,016 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-04 06:41:31,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:41:31,017 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:31,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:31,018 INFO L85 PathProgramCache]: Analyzing trace with hash -382944156, now seen corresponding path program 1 times [2025-03-04 06:41:31,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:31,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034687886] [2025-03-04 06:41:31,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:31,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:31,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 06:41:31,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 06:41:31,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:31,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:31,151 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-04 06:41:31,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:31,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034687886] [2025-03-04 06:41:31,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034687886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:31,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:31,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:31,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352412427] [2025-03-04 06:41:31,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:31,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:31,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:31,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:31,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:31,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-04 06:41:31,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 565 transitions, 1138 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-04 06:41:31,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:31,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-04 06:41:31,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:31,227 INFO L124 PetriNetUnfolderBase]: 13/606 cut-off events. [2025-03-04 06:41:31,227 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-04 06:41:31,230 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 6. Compared 813 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 498. Up to 13 conditions per place. [2025-03-04 06:41:31,232 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/564 dead transitions. [2025-03-04 06:41:31,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 564 transitions, 1156 flow [2025-03-04 06:41:31,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:31,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:31,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-04 06:41:31,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-04 06:41:31,237 INFO L175 Difference]: Start difference. First operand has 562 places, 565 transitions, 1138 flow. Second operand 3 states and 1709 transitions. [2025-03-04 06:41:31,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 564 transitions, 1156 flow [2025-03-04 06:41:31,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 564 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:31,244 INFO L231 Difference]: Finished difference. Result has 561 places, 564 transitions, 1136 flow [2025-03-04 06:41:31,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, 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-04 06:41:31,246 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -14 predicate places. [2025-03-04 06:41:31,246 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 564 transitions, 1136 flow [2025-03-04 06:41:31,247 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-04 06:41:31,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:31,247 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-04 06:41:31,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:41:31,248 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:31,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:31,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1940042161, now seen corresponding path program 1 times [2025-03-04 06:41:31,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:31,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305837521] [2025-03-04 06:41:31,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:31,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:31,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 06:41:31,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 06:41:31,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:31,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:31,313 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-04 06:41:31,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:31,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305837521] [2025-03-04 06:41:31,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305837521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:31,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:31,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:31,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947244476] [2025-03-04 06:41:31,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:31,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:31,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:31,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:31,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:31,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-04 06:41:31,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 564 transitions, 1136 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-04 06:41:31,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:31,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-04 06:41:31,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:31,406 INFO L124 PetriNetUnfolderBase]: 13/605 cut-off events. [2025-03-04 06:41:31,406 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-04 06:41:31,413 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 6. Compared 803 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 490. Up to 13 conditions per place. [2025-03-04 06:41:31,414 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/563 dead transitions. [2025-03-04 06:41:31,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 563 transitions, 1154 flow [2025-03-04 06:41:31,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:31,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:31,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-04 06:41:31,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-04 06:41:31,417 INFO L175 Difference]: Start difference. First operand has 561 places, 564 transitions, 1136 flow. Second operand 3 states and 1709 transitions. [2025-03-04 06:41:31,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 563 transitions, 1154 flow [2025-03-04 06:41:31,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 563 transitions, 1150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:31,424 INFO L231 Difference]: Finished difference. Result has 560 places, 563 transitions, 1134 flow [2025-03-04 06:41:31,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, 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-04 06:41:31,425 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -15 predicate places. [2025-03-04 06:41:31,425 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 563 transitions, 1134 flow [2025-03-04 06:41:31,426 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-04 06:41:31,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:31,426 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-04 06:41:31,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:41:31,426 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:31,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:31,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1944956659, now seen corresponding path program 1 times [2025-03-04 06:41:31,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:31,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964027350] [2025-03-04 06:41:31,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:31,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:31,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 06:41:31,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 06:41:31,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:31,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:31,508 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-04 06:41:31,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:31,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964027350] [2025-03-04 06:41:31,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964027350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:31,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:31,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:31,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074537388] [2025-03-04 06:41:31,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:31,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:31,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:31,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:31,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:31,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-04 06:41:31,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 563 transitions, 1134 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-04 06:41:31,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:31,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-04 06:41:31,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:31,603 INFO L124 PetriNetUnfolderBase]: 13/604 cut-off events. [2025-03-04 06:41:31,603 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-04 06:41:31,606 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 6. Compared 802 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 482. Up to 13 conditions per place. [2025-03-04 06:41:31,607 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/562 dead transitions. [2025-03-04 06:41:31,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 562 transitions, 1152 flow [2025-03-04 06:41:31,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:31,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-04 06:41:31,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-04 06:41:31,611 INFO L175 Difference]: Start difference. First operand has 560 places, 563 transitions, 1134 flow. Second operand 3 states and 1709 transitions. [2025-03-04 06:41:31,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 562 transitions, 1152 flow [2025-03-04 06:41:31,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 562 transitions, 1148 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:31,617 INFO L231 Difference]: Finished difference. Result has 559 places, 562 transitions, 1132 flow [2025-03-04 06:41:31,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, 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-04 06:41:31,619 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -16 predicate places. [2025-03-04 06:41:31,619 INFO L471 AbstractCegarLoop]: Abstraction has has 559 places, 562 transitions, 1132 flow [2025-03-04 06:41:31,621 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-04 06:41:31,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:31,621 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-04 06:41:31,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:41:31,621 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:31,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:31,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1310971171, now seen corresponding path program 1 times [2025-03-04 06:41:31,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:31,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222654412] [2025-03-04 06:41:31,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:31,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:31,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 06:41:31,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 06:41:31,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:31,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:31,700 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-04 06:41:31,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:31,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222654412] [2025-03-04 06:41:31,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222654412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:31,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:31,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:31,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943931419] [2025-03-04 06:41:31,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:31,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:31,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:31,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:31,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:31,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-04 06:41:31,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 562 transitions, 1132 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-04 06:41:31,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:31,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-04 06:41:31,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:31,773 INFO L124 PetriNetUnfolderBase]: 13/603 cut-off events. [2025-03-04 06:41:31,774 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-04 06:41:31,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 603 events. 13/603 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 799 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 474. Up to 13 conditions per place. [2025-03-04 06:41:31,777 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/561 dead transitions. [2025-03-04 06:41:31,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 561 transitions, 1150 flow [2025-03-04 06:41:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-04 06:41:31,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-04 06:41:31,780 INFO L175 Difference]: Start difference. First operand has 559 places, 562 transitions, 1132 flow. Second operand 3 states and 1709 transitions. [2025-03-04 06:41:31,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 561 transitions, 1150 flow [2025-03-04 06:41:31,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 561 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:31,787 INFO L231 Difference]: Finished difference. Result has 558 places, 561 transitions, 1130 flow [2025-03-04 06:41:31,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, 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-04 06:41:31,788 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -17 predicate places. [2025-03-04 06:41:31,789 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 561 transitions, 1130 flow [2025-03-04 06:41:31,790 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-04 06:41:31,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:31,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] [2025-03-04 06:41:31,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:41:31,790 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:31,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:31,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1511149240, now seen corresponding path program 1 times [2025-03-04 06:41:31,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:31,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591250048] [2025-03-04 06:41:31,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:31,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:31,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 06:41:31,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 06:41:31,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:31,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:31,857 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-04 06:41:31,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:31,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591250048] [2025-03-04 06:41:31,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591250048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:31,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:31,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:31,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646537234] [2025-03-04 06:41:31,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:31,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:31,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:31,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:31,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:31,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-04 06:41:31,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 561 transitions, 1130 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-04 06:41:31,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:31,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-04 06:41:31,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:31,963 INFO L124 PetriNetUnfolderBase]: 13/602 cut-off events. [2025-03-04 06:41:31,963 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-04 06:41:31,965 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 6. Compared 797 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 466. Up to 13 conditions per place. [2025-03-04 06:41:31,966 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/560 dead transitions. [2025-03-04 06:41:31,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 560 transitions, 1148 flow [2025-03-04 06:41:31,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-04 06:41:31,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-04 06:41:31,969 INFO L175 Difference]: Start difference. First operand has 558 places, 561 transitions, 1130 flow. Second operand 3 states and 1709 transitions. [2025-03-04 06:41:31,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 560 transitions, 1148 flow [2025-03-04 06:41:31,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 560 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:31,975 INFO L231 Difference]: Finished difference. Result has 557 places, 560 transitions, 1128 flow [2025-03-04 06:41:31,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, 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-04 06:41:31,977 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -18 predicate places. [2025-03-04 06:41:31,977 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 560 transitions, 1128 flow [2025-03-04 06:41:31,977 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-04 06:41:31,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:31,978 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-04 06:41:31,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:41:31,978 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:31,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:31,978 INFO L85 PathProgramCache]: Analyzing trace with hash 317152258, now seen corresponding path program 1 times [2025-03-04 06:41:31,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:31,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338540985] [2025-03-04 06:41:31,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:31,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:31,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 06:41:32,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 06:41:32,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:32,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:32,048 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-04 06:41:32,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:32,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338540985] [2025-03-04 06:41:32,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338540985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:32,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:32,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:32,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511477320] [2025-03-04 06:41:32,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:32,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:32,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:32,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:32,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:32,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 587 [2025-03-04 06:41:32,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 560 transitions, 1128 flow. Second operand has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 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-04 06:41:32,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:32,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 587 [2025-03-04 06:41:32,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:32,169 INFO L124 PetriNetUnfolderBase]: 29/1049 cut-off events. [2025-03-04 06:41:32,169 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:41:32,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 1049 events. 29/1049 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2948 event pairs, 5 based on Foata normal form. 0/965 useless extension candidates. Maximal degree in co-relation 915. Up to 20 conditions per place. [2025-03-04 06:41:32,175 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 9 selfloop transitions, 2 changer transitions 0/559 dead transitions. [2025-03-04 06:41:32,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 559 transitions, 1148 flow [2025-03-04 06:41:32,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:32,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:32,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1707 transitions. [2025-03-04 06:41:32,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969335604770017 [2025-03-04 06:41:32,178 INFO L175 Difference]: Start difference. First operand has 557 places, 560 transitions, 1128 flow. Second operand 3 states and 1707 transitions. [2025-03-04 06:41:32,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 559 transitions, 1148 flow [2025-03-04 06:41:32,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 559 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:32,186 INFO L231 Difference]: Finished difference. Result has 556 places, 559 transitions, 1126 flow [2025-03-04 06:41:32,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, 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-04 06:41:32,189 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -19 predicate places. [2025-03-04 06:41:32,189 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 559 transitions, 1126 flow [2025-03-04 06:41:32,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 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-04 06:41:32,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:32,191 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-04 06:41:32,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:41:32,191 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:32,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:32,192 INFO L85 PathProgramCache]: Analyzing trace with hash -22390167, now seen corresponding path program 1 times [2025-03-04 06:41:32,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:32,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342708390] [2025-03-04 06:41:32,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:32,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:32,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 06:41:32,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 06:41:32,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:32,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:32,269 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-04 06:41:32,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:32,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342708390] [2025-03-04 06:41:32,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342708390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:32,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:32,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:32,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722611070] [2025-03-04 06:41:32,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:32,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:32,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:32,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:32,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:32,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-04 06:41:32,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 559 transitions, 1126 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-04 06:41:32,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:32,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-04 06:41:32,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:32,347 INFO L124 PetriNetUnfolderBase]: 13/600 cut-off events. [2025-03-04 06:41:32,348 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-04 06:41:32,350 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 6. Compared 792 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 450. Up to 13 conditions per place. [2025-03-04 06:41:32,351 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2025-03-04 06:41:32,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 558 transitions, 1144 flow [2025-03-04 06:41:32,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-04 06:41:32,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-04 06:41:32,355 INFO L175 Difference]: Start difference. First operand has 556 places, 559 transitions, 1126 flow. Second operand 3 states and 1709 transitions. [2025-03-04 06:41:32,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 558 transitions, 1144 flow [2025-03-04 06:41:32,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 558 transitions, 1140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:32,362 INFO L231 Difference]: Finished difference. Result has 555 places, 558 transitions, 1124 flow [2025-03-04 06:41:32,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, 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-04 06:41:32,364 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -20 predicate places. [2025-03-04 06:41:32,364 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 558 transitions, 1124 flow [2025-03-04 06:41:32,365 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-04 06:41:32,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:32,365 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-04 06:41:32,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:41:32,366 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:32,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:32,366 INFO L85 PathProgramCache]: Analyzing trace with hash -859840092, now seen corresponding path program 1 times [2025-03-04 06:41:32,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:32,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255171288] [2025-03-04 06:41:32,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:32,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:32,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 06:41:32,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 06:41:32,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:32,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:32,534 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-04 06:41:32,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:32,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255171288] [2025-03-04 06:41:32,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255171288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:32,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:32,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:32,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027353450] [2025-03-04 06:41:32,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:32,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:32,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:32,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:32,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:32,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-04 06:41:32,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 558 transitions, 1124 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-04 06:41:32,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:32,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-04 06:41:32,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:32,617 INFO L124 PetriNetUnfolderBase]: 13/599 cut-off events. [2025-03-04 06:41:32,621 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-04 06:41:32,623 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 6. Compared 788 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 442. Up to 13 conditions per place. [2025-03-04 06:41:32,627 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/557 dead transitions. [2025-03-04 06:41:32,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 557 transitions, 1142 flow [2025-03-04 06:41:32,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:32,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:32,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-04 06:41:32,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-04 06:41:32,630 INFO L175 Difference]: Start difference. First operand has 555 places, 558 transitions, 1124 flow. Second operand 3 states and 1709 transitions. [2025-03-04 06:41:32,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 557 transitions, 1142 flow [2025-03-04 06:41:32,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 557 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:32,637 INFO L231 Difference]: Finished difference. Result has 554 places, 557 transitions, 1122 flow [2025-03-04 06:41:32,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, 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-04 06:41:32,639 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -21 predicate places. [2025-03-04 06:41:32,639 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 557 transitions, 1122 flow [2025-03-04 06:41:32,640 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-04 06:41:32,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:32,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] [2025-03-04 06:41:32,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:41:32,641 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:32,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:32,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1020474100, now seen corresponding path program 1 times [2025-03-04 06:41:32,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:32,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097403519] [2025-03-04 06:41:32,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:32,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:32,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 06:41:32,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 06:41:32,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:32,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:32,729 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-04 06:41:32,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:32,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097403519] [2025-03-04 06:41:32,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097403519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:32,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:32,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:32,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136076170] [2025-03-04 06:41:32,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:32,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:32,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:32,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:32,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:32,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-04 06:41:32,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 557 transitions, 1122 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-04 06:41:32,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:32,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-04 06:41:32,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:32,823 INFO L124 PetriNetUnfolderBase]: 13/598 cut-off events. [2025-03-04 06:41:32,823 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-04 06:41:32,825 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 6. Compared 788 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 434. Up to 13 conditions per place. [2025-03-04 06:41:32,826 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/556 dead transitions. [2025-03-04 06:41:32,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 556 transitions, 1140 flow [2025-03-04 06:41:32,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:32,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-04 06:41:32,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-04 06:41:32,830 INFO L175 Difference]: Start difference. First operand has 554 places, 557 transitions, 1122 flow. Second operand 3 states and 1709 transitions. [2025-03-04 06:41:32,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 556 transitions, 1140 flow [2025-03-04 06:41:32,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 556 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:32,836 INFO L231 Difference]: Finished difference. Result has 553 places, 556 transitions, 1120 flow [2025-03-04 06:41:32,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, 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-04 06:41:32,837 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -22 predicate places. [2025-03-04 06:41:32,837 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 556 transitions, 1120 flow [2025-03-04 06:41:32,838 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-04 06:41:32,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:32,838 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-04 06:41:32,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:41:32,839 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:32,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:32,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1474964243, now seen corresponding path program 1 times [2025-03-04 06:41:32,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:32,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572478775] [2025-03-04 06:41:32,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:32,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:32,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 06:41:32,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 06:41:32,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:32,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:41:32,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:32,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572478775] [2025-03-04 06:41:32,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572478775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:32,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:32,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:32,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257398858] [2025-03-04 06:41:32,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:32,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:32,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:32,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:32,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:32,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-04 06:41:32,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 556 transitions, 1120 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-04 06:41:32,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:32,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-04 06:41:32,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:33,011 INFO L124 PetriNetUnfolderBase]: 13/597 cut-off events. [2025-03-04 06:41:33,012 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-04 06:41:33,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 597 events. 13/597 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 786 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 426. Up to 13 conditions per place. [2025-03-04 06:41:33,017 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/555 dead transitions. [2025-03-04 06:41:33,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 555 transitions, 1138 flow [2025-03-04 06:41:33,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:33,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-04 06:41:33,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2025-03-04 06:41:33,020 INFO L175 Difference]: Start difference. First operand has 553 places, 556 transitions, 1120 flow. Second operand 3 states and 1709 transitions. [2025-03-04 06:41:33,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 555 transitions, 1138 flow [2025-03-04 06:41:33,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 555 transitions, 1134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:33,027 INFO L231 Difference]: Finished difference. Result has 552 places, 555 transitions, 1118 flow [2025-03-04 06:41:33,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, 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-04 06:41:33,029 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -23 predicate places. [2025-03-04 06:41:33,029 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 555 transitions, 1118 flow [2025-03-04 06:41:33,030 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-04 06:41:33,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:33,030 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-04 06:41:33,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:41:33,030 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:33,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:33,031 INFO L85 PathProgramCache]: Analyzing trace with hash -787753335, now seen corresponding path program 1 times [2025-03-04 06:41:33,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:33,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624359912] [2025-03-04 06:41:33,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:33,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:33,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-04 06:41:33,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-04 06:41:33,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:33,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:33,107 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-04 06:41:33,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:33,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624359912] [2025-03-04 06:41:33,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624359912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:33,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:33,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:33,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854397001] [2025-03-04 06:41:33,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:33,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:33,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:33,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:33,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:33,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 587 [2025-03-04 06:41:33,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 555 transitions, 1118 flow. Second operand has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 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-04 06:41:33,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:33,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 587 [2025-03-04 06:41:33,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:33,206 INFO L124 PetriNetUnfolderBase]: 18/662 cut-off events. [2025-03-04 06:41:33,207 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-04 06:41:33,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 662 events. 18/662 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1124 event pairs, 5 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 494. Up to 21 conditions per place. [2025-03-04 06:41:33,212 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 10 selfloop transitions, 2 changer transitions 0/554 dead transitions. [2025-03-04 06:41:33,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 554 transitions, 1140 flow [2025-03-04 06:41:33,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:33,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:33,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1705 transitions. [2025-03-04 06:41:33,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681998864281658 [2025-03-04 06:41:33,215 INFO L175 Difference]: Start difference. First operand has 552 places, 555 transitions, 1118 flow. Second operand 3 states and 1705 transitions. [2025-03-04 06:41:33,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 554 transitions, 1140 flow [2025-03-04 06:41:33,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 554 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:33,222 INFO L231 Difference]: Finished difference. Result has 551 places, 554 transitions, 1116 flow [2025-03-04 06:41:33,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, 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-04 06:41:33,223 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -24 predicate places. [2025-03-04 06:41:33,223 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 554 transitions, 1116 flow [2025-03-04 06:41:33,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 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-04 06:41:33,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:33,224 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-04 06:41:33,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:41:33,224 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:33,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:33,225 INFO L85 PathProgramCache]: Analyzing trace with hash 607817619, now seen corresponding path program 1 times [2025-03-04 06:41:33,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:33,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138786679] [2025-03-04 06:41:33,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:33,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:33,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-04 06:41:33,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-04 06:41:33,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:33,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:33,296 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-04 06:41:33,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:33,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138786679] [2025-03-04 06:41:33,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138786679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:33,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:33,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:33,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833877739] [2025-03-04 06:41:33,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:33,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:33,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:33,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:33,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:33,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2025-03-04 06:41:33,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 554 transitions, 1116 flow. Second operand has 3 states, 3 states have (on average 567.0) internal successors, (1701), 3 states have internal predecessors, (1701), 0 states have call successors, (0), 0 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-04 06:41:33,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:33,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2025-03-04 06:41:33,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:33,438 INFO L124 PetriNetUnfolderBase]: 34/1084 cut-off events. [2025-03-04 06:41:33,438 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:41:33,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 1084 events. 34/1084 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3226 event pairs, 8 based on Foata normal form. 0/1011 useless extension candidates. Maximal degree in co-relation 915. Up to 25 conditions per place. [2025-03-04 06:41:33,446 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 9 selfloop transitions, 1 changer transitions 0/552 dead transitions. [2025-03-04 06:41:33,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 552 transitions, 1132 flow [2025-03-04 06:41:33,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:33,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1710 transitions. [2025-03-04 06:41:33,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9710391822827938 [2025-03-04 06:41:33,453 INFO L175 Difference]: Start difference. First operand has 551 places, 554 transitions, 1116 flow. Second operand 3 states and 1710 transitions. [2025-03-04 06:41:33,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 552 transitions, 1132 flow [2025-03-04 06:41:33,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 552 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:33,459 INFO L231 Difference]: Finished difference. Result has 549 places, 552 transitions, 1110 flow [2025-03-04 06:41:33,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1110, PETRI_PLACES=549, PETRI_TRANSITIONS=552} [2025-03-04 06:41:33,461 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -26 predicate places. [2025-03-04 06:41:33,461 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 552 transitions, 1110 flow [2025-03-04 06:41:33,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.0) internal successors, (1701), 3 states have internal predecessors, (1701), 0 states have call successors, (0), 0 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-04 06:41:33,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:33,462 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-04 06:41:33,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:41:33,462 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:33,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:33,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2091354257, now seen corresponding path program 1 times [2025-03-04 06:41:33,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:33,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128058734] [2025-03-04 06:41:33,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:33,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:33,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-04 06:41:33,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-04 06:41:33,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:33,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:35,527 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-04 06:41:35,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:35,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128058734] [2025-03-04 06:41:35,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128058734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:35,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:35,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:41:35,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999598210] [2025-03-04 06:41:35,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:35,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:41:35,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:35,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:41:35,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:41:35,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 587 [2025-03-04 06:41:35,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 552 transitions, 1110 flow. Second operand has 10 states, 10 states have (on average 526.3) internal successors, (5263), 10 states have internal predecessors, (5263), 0 states have call successors, (0), 0 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-04 06:41:35,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:35,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 587 [2025-03-04 06:41:35,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:36,017 INFO L124 PetriNetUnfolderBase]: 126/1121 cut-off events. [2025-03-04 06:41:36,018 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-04 06:41:36,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 1121 events. 126/1121 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5216 event pairs, 98 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1233. Up to 242 conditions per place. [2025-03-04 06:41:36,024 INFO L140 encePairwiseOnDemand]: 577/587 looper letters, 42 selfloop transitions, 9 changer transitions 0/551 dead transitions. [2025-03-04 06:41:36,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 551 transitions, 1210 flow [2025-03-04 06:41:36,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:41:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 06:41:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5302 transitions. [2025-03-04 06:41:36,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.903236797274276 [2025-03-04 06:41:36,034 INFO L175 Difference]: Start difference. First operand has 549 places, 552 transitions, 1110 flow. Second operand 10 states and 5302 transitions. [2025-03-04 06:41:36,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 551 transitions, 1210 flow [2025-03-04 06:41:36,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 551 transitions, 1209 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:41:36,040 INFO L231 Difference]: Finished difference. Result has 556 places, 551 transitions, 1125 flow [2025-03-04 06:41:36,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1125, PETRI_PLACES=556, PETRI_TRANSITIONS=551} [2025-03-04 06:41:36,040 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -19 predicate places. [2025-03-04 06:41:36,041 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 551 transitions, 1125 flow [2025-03-04 06:41:36,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 526.3) internal successors, (5263), 10 states have internal predecessors, (5263), 0 states have call successors, (0), 0 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-04 06:41:36,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:36,046 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-04 06:41:36,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:41:36,046 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:36,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:36,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1711547455, now seen corresponding path program 1 times [2025-03-04 06:41:36,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:36,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047660543] [2025-03-04 06:41:36,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:36,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:36,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-04 06:41:36,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-04 06:41:36,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:36,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:36,132 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-04 06:41:36,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:36,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047660543] [2025-03-04 06:41:36,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047660543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:36,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:36,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:36,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779389708] [2025-03-04 06:41:36,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:36,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:36,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:36,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:36,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:36,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 587 [2025-03-04 06:41:36,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 551 transitions, 1125 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-04 06:41:36,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:36,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 587 [2025-03-04 06:41:36,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:36,300 INFO L124 PetriNetUnfolderBase]: 43/1348 cut-off events. [2025-03-04 06:41:36,301 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 06:41:36,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1398 conditions, 1348 events. 43/1348 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5334 event pairs, 9 based on Foata normal form. 0/1254 useless extension candidates. Maximal degree in co-relation 1191. Up to 31 conditions per place. [2025-03-04 06:41:36,308 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 12 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2025-03-04 06:41:36,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 550 transitions, 1151 flow [2025-03-04 06:41:36,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1701 transitions. [2025-03-04 06:41:36,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659284497444633 [2025-03-04 06:41:36,312 INFO L175 Difference]: Start difference. First operand has 556 places, 551 transitions, 1125 flow. Second operand 3 states and 1701 transitions. [2025-03-04 06:41:36,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 550 transitions, 1151 flow [2025-03-04 06:41:36,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 550 transitions, 1133 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-04 06:41:36,318 INFO L231 Difference]: Finished difference. Result has 548 places, 550 transitions, 1109 flow [2025-03-04 06:41:36,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1109, PETRI_PLACES=548, PETRI_TRANSITIONS=550} [2025-03-04 06:41:36,319 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -27 predicate places. [2025-03-04 06:41:36,319 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 550 transitions, 1109 flow [2025-03-04 06:41:36,320 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-04 06:41:36,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:36,320 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-04 06:41:36,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:41:36,320 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:36,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:36,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1048763303, now seen corresponding path program 1 times [2025-03-04 06:41:36,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:36,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102249084] [2025-03-04 06:41:36,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:36,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:36,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-04 06:41:36,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-04 06:41:36,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:36,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:36,396 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-04 06:41:36,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:36,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102249084] [2025-03-04 06:41:36,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102249084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:36,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:36,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:36,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125863743] [2025-03-04 06:41:36,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:36,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:36,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:36,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:36,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:36,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 560 out of 587 [2025-03-04 06:41:36,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 550 transitions, 1109 flow. Second operand has 3 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 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-04 06:41:36,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:36,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 560 of 587 [2025-03-04 06:41:36,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:36,590 INFO L124 PetriNetUnfolderBase]: 45/1038 cut-off events. [2025-03-04 06:41:36,590 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 06:41:36,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 1038 events. 45/1038 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3569 event pairs, 20 based on Foata normal form. 0/981 useless extension candidates. Maximal degree in co-relation 899. Up to 53 conditions per place. [2025-03-04 06:41:36,596 INFO L140 encePairwiseOnDemand]: 582/587 looper letters, 13 selfloop transitions, 1 changer transitions 0/546 dead transitions. [2025-03-04 06:41:36,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 546 transitions, 1129 flow [2025-03-04 06:41:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:36,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1698 transitions. [2025-03-04 06:41:36,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9642248722316865 [2025-03-04 06:41:36,600 INFO L175 Difference]: Start difference. First operand has 548 places, 550 transitions, 1109 flow. Second operand 3 states and 1698 transitions. [2025-03-04 06:41:36,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 546 transitions, 1129 flow [2025-03-04 06:41:36,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 546 transitions, 1125 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:36,608 INFO L231 Difference]: Finished difference. Result has 544 places, 546 transitions, 1099 flow [2025-03-04 06:41:36,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1099, PETRI_PLACES=544, PETRI_TRANSITIONS=546} [2025-03-04 06:41:36,609 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -31 predicate places. [2025-03-04 06:41:36,610 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 546 transitions, 1099 flow [2025-03-04 06:41:36,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 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-04 06:41:36,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:36,610 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-04 06:41:36,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:41:36,611 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:36,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:36,611 INFO L85 PathProgramCache]: Analyzing trace with hash 994640436, now seen corresponding path program 1 times [2025-03-04 06:41:36,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:36,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341180317] [2025-03-04 06:41:36,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:36,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:36,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-04 06:41:36,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-04 06:41:36,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:36,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:36,725 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-04 06:41:36,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:36,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341180317] [2025-03-04 06:41:36,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341180317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:36,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:36,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:36,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264190600] [2025-03-04 06:41:36,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:36,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:36,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:36,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:36,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:36,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 570 out of 587 [2025-03-04 06:41:36,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 546 transitions, 1099 flow. Second operand has 3 states, 3 states have (on average 570.6666666666666) internal successors, (1712), 3 states have internal predecessors, (1712), 0 states have call successors, (0), 0 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-04 06:41:36,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:36,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 570 of 587 [2025-03-04 06:41:36,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:36,786 INFO L124 PetriNetUnfolderBase]: 13/587 cut-off events. [2025-03-04 06:41:36,786 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-04 06:41:36,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 587 events. 13/587 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 771 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 400. Up to 11 conditions per place. [2025-03-04 06:41:36,791 INFO L140 encePairwiseOnDemand]: 585/587 looper letters, 6 selfloop transitions, 1 changer transitions 0/545 dead transitions. [2025-03-04 06:41:36,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 545 transitions, 1111 flow [2025-03-04 06:41:36,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:36,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1718 transitions. [2025-03-04 06:41:36,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9755820556501987 [2025-03-04 06:41:36,809 INFO L175 Difference]: Start difference. First operand has 544 places, 546 transitions, 1099 flow. Second operand 3 states and 1718 transitions. [2025-03-04 06:41:36,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 545 transitions, 1111 flow [2025-03-04 06:41:36,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 545 transitions, 1110 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:41:36,816 INFO L231 Difference]: Finished difference. Result has 544 places, 545 transitions, 1098 flow [2025-03-04 06:41:36,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1098, PETRI_PLACES=544, PETRI_TRANSITIONS=545} [2025-03-04 06:41:36,817 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -31 predicate places. [2025-03-04 06:41:36,817 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 545 transitions, 1098 flow [2025-03-04 06:41:36,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.6666666666666) internal successors, (1712), 3 states have internal predecessors, (1712), 0 states have call successors, (0), 0 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-04 06:41:36,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:36,818 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-04 06:41:36,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 06:41:36,818 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:36,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:36,820 INFO L85 PathProgramCache]: Analyzing trace with hash 344169928, now seen corresponding path program 1 times [2025-03-04 06:41:36,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:36,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838433127] [2025-03-04 06:41:36,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:36,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:36,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-04 06:41:36,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-04 06:41:36,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:36,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:36,905 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-04 06:41:36,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:36,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838433127] [2025-03-04 06:41:36,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838433127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:36,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:36,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:36,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648348080] [2025-03-04 06:41:36,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:36,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:36,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:36,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:36,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:36,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 587 [2025-03-04 06:41:36,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 545 transitions, 1098 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-04 06:41:36,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:36,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 587 [2025-03-04 06:41:36,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:37,006 INFO L124 PetriNetUnfolderBase]: 23/714 cut-off events. [2025-03-04 06:41:37,006 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-04 06:41:37,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 714 events. 23/714 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1573 event pairs, 8 based on Foata normal form. 0/681 useless extension candidates. Maximal degree in co-relation 552. Up to 30 conditions per place. [2025-03-04 06:41:37,010 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 13 selfloop transitions, 2 changer transitions 0/544 dead transitions. [2025-03-04 06:41:37,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 544 transitions, 1126 flow [2025-03-04 06:41:37,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:37,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:37,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1702 transitions. [2025-03-04 06:41:37,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966496308915389 [2025-03-04 06:41:37,014 INFO L175 Difference]: Start difference. First operand has 544 places, 545 transitions, 1098 flow. Second operand 3 states and 1702 transitions. [2025-03-04 06:41:37,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 544 transitions, 1126 flow [2025-03-04 06:41:37,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 544 transitions, 1125 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:41:37,020 INFO L231 Difference]: Finished difference. Result has 544 places, 544 transitions, 1099 flow [2025-03-04 06:41:37,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1099, PETRI_PLACES=544, PETRI_TRANSITIONS=544} [2025-03-04 06:41:37,021 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -31 predicate places. [2025-03-04 06:41:37,022 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 544 transitions, 1099 flow [2025-03-04 06:41:37,022 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-04 06:41:37,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:37,022 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-04 06:41:37,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 06:41:37,023 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:37,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:37,024 INFO L85 PathProgramCache]: Analyzing trace with hash -872231578, now seen corresponding path program 1 times [2025-03-04 06:41:37,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:37,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845003336] [2025-03-04 06:41:37,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:37,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:37,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-04 06:41:37,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-04 06:41:37,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:37,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:37,125 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-04 06:41:37,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:37,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845003336] [2025-03-04 06:41:37,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845003336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:37,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:37,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:37,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065651131] [2025-03-04 06:41:37,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:37,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:37,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:37,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:37,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:37,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 587 [2025-03-04 06:41:37,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 544 transitions, 1099 flow. Second operand has 3 states, 3 states have (on average 563.0) internal successors, (1689), 3 states have internal predecessors, (1689), 0 states have call successors, (0), 0 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-04 06:41:37,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:37,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 587 [2025-03-04 06:41:37,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:37,258 INFO L124 PetriNetUnfolderBase]: 44/1078 cut-off events. [2025-03-04 06:41:37,258 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-04 06:41:37,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 1078 events. 44/1078 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3631 event pairs, 2 based on Foata normal form. 0/1022 useless extension candidates. Maximal degree in co-relation 983. Up to 43 conditions per place. [2025-03-04 06:41:37,264 INFO L140 encePairwiseOnDemand]: 581/587 looper letters, 16 selfloop transitions, 3 changer transitions 0/547 dead transitions. [2025-03-04 06:41:37,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 547 transitions, 1147 flow [2025-03-04 06:41:37,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:37,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1708 transitions. [2025-03-04 06:41:37,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9699034639409426 [2025-03-04 06:41:37,267 INFO L175 Difference]: Start difference. First operand has 544 places, 544 transitions, 1099 flow. Second operand 3 states and 1708 transitions. [2025-03-04 06:41:37,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 547 transitions, 1147 flow [2025-03-04 06:41:37,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 547 transitions, 1143 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:37,277 INFO L231 Difference]: Finished difference. Result has 542 places, 542 transitions, 1102 flow [2025-03-04 06:41:37,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, 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=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1102, PETRI_PLACES=542, PETRI_TRANSITIONS=542} [2025-03-04 06:41:37,278 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -33 predicate places. [2025-03-04 06:41:37,278 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 542 transitions, 1102 flow [2025-03-04 06:41:37,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.0) internal successors, (1689), 3 states have internal predecessors, (1689), 0 states have call successors, (0), 0 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-04 06:41:37,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:37,279 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-04 06:41:37,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 06:41:37,279 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:37,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:37,280 INFO L85 PathProgramCache]: Analyzing trace with hash 448301061, now seen corresponding path program 1 times [2025-03-04 06:41:37,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:37,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459644433] [2025-03-04 06:41:37,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:37,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:37,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-04 06:41:37,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-04 06:41:37,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:37,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:37,416 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-04 06:41:37,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:37,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459644433] [2025-03-04 06:41:37,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459644433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:37,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:37,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:37,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059857156] [2025-03-04 06:41:37,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:37,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:37,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:37,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:37,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:37,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 587 [2025-03-04 06:41:37,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 542 transitions, 1102 flow. Second operand has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 0 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-04 06:41:37,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:37,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 587 [2025-03-04 06:41:37,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:37,633 INFO L124 PetriNetUnfolderBase]: 49/1463 cut-off events. [2025-03-04 06:41:37,633 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 06:41:37,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 1463 events. 49/1463 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 6341 event pairs, 10 based on Foata normal form. 0/1386 useless extension candidates. Maximal degree in co-relation 1338. Up to 38 conditions per place. [2025-03-04 06:41:37,642 INFO L140 encePairwiseOnDemand]: 585/587 looper letters, 10 selfloop transitions, 1 changer transitions 0/544 dead transitions. [2025-03-04 06:41:37,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 544 transitions, 1130 flow [2025-03-04 06:41:37,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1719 transitions. [2025-03-04 06:41:37,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9761499148211243 [2025-03-04 06:41:37,647 INFO L175 Difference]: Start difference. First operand has 542 places, 542 transitions, 1102 flow. Second operand 3 states and 1719 transitions. [2025-03-04 06:41:37,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 544 transitions, 1130 flow [2025-03-04 06:41:37,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 544 transitions, 1127 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:41:37,653 INFO L231 Difference]: Finished difference. Result has 542 places, 541 transitions, 1099 flow [2025-03-04 06:41:37,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1099, PETRI_PLACES=542, PETRI_TRANSITIONS=541} [2025-03-04 06:41:37,655 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -33 predicate places. [2025-03-04 06:41:37,655 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 541 transitions, 1099 flow [2025-03-04 06:41:37,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 0 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-04 06:41:37,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:37,656 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-04 06:41:37,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 06:41:37,657 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:37,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:37,657 INFO L85 PathProgramCache]: Analyzing trace with hash 679079126, now seen corresponding path program 1 times [2025-03-04 06:41:37,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:37,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467996929] [2025-03-04 06:41:37,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:37,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:37,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-04 06:41:37,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-04 06:41:37,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:37,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:37,755 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-04 06:41:37,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:37,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467996929] [2025-03-04 06:41:37,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467996929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:37,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:37,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:37,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032790774] [2025-03-04 06:41:37,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:37,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:37,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:37,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:37,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:37,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 587 [2025-03-04 06:41:37,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 541 transitions, 1099 flow. Second operand has 3 states, 3 states have (on average 565.0) internal successors, (1695), 3 states have internal predecessors, (1695), 0 states have call successors, (0), 0 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-04 06:41:37,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:37,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 587 [2025-03-04 06:41:37,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:37,874 INFO L124 PetriNetUnfolderBase]: 30/861 cut-off events. [2025-03-04 06:41:37,875 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-03-04 06:41:37,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 861 events. 30/861 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2466 event pairs, 10 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 728. Up to 44 conditions per place. [2025-03-04 06:41:37,883 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 14 selfloop transitions, 2 changer transitions 0/541 dead transitions. [2025-03-04 06:41:37,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 541 transitions, 1131 flow [2025-03-04 06:41:37,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1705 transitions. [2025-03-04 06:41:37,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681998864281658 [2025-03-04 06:41:37,887 INFO L175 Difference]: Start difference. First operand has 542 places, 541 transitions, 1099 flow. Second operand 3 states and 1705 transitions. [2025-03-04 06:41:37,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 541 transitions, 1131 flow [2025-03-04 06:41:37,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 541 transitions, 1130 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:41:37,893 INFO L231 Difference]: Finished difference. Result has 543 places, 541 transitions, 1106 flow [2025-03-04 06:41:37,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1106, PETRI_PLACES=543, PETRI_TRANSITIONS=541} [2025-03-04 06:41:37,895 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -32 predicate places. [2025-03-04 06:41:37,895 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 541 transitions, 1106 flow [2025-03-04 06:41:37,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.0) internal successors, (1695), 3 states have internal predecessors, (1695), 0 states have call successors, (0), 0 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-04 06:41:37,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:37,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] [2025-03-04 06:41:37,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 06:41:37,896 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:37,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:37,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1320629670, now seen corresponding path program 1 times [2025-03-04 06:41:37,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:37,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835231315] [2025-03-04 06:41:37,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:37,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:37,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-04 06:41:37,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-04 06:41:37,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:37,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:37,981 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-04 06:41:37,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:37,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835231315] [2025-03-04 06:41:37,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835231315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:37,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:37,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:37,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132840445] [2025-03-04 06:41:37,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:37,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:37,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:37,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:37,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:37,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 587 [2025-03-04 06:41:37,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 541 transitions, 1106 flow. Second operand has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 0 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-04 06:41:37,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:37,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 587 [2025-03-04 06:41:37,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:38,151 INFO L124 PetriNetUnfolderBase]: 49/1445 cut-off events. [2025-03-04 06:41:38,152 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-04 06:41:38,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 1445 events. 49/1445 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 6210 event pairs, 10 based on Foata normal form. 0/1379 useless extension candidates. Maximal degree in co-relation 1517. Up to 38 conditions per place. [2025-03-04 06:41:38,161 INFO L140 encePairwiseOnDemand]: 585/587 looper letters, 10 selfloop transitions, 1 changer transitions 0/543 dead transitions. [2025-03-04 06:41:38,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 543 transitions, 1134 flow [2025-03-04 06:41:38,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1719 transitions. [2025-03-04 06:41:38,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9761499148211243 [2025-03-04 06:41:38,165 INFO L175 Difference]: Start difference. First operand has 543 places, 541 transitions, 1106 flow. Second operand 3 states and 1719 transitions. [2025-03-04 06:41:38,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 543 transitions, 1134 flow [2025-03-04 06:41:38,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 543 transitions, 1132 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:41:38,172 INFO L231 Difference]: Finished difference. Result has 543 places, 540 transitions, 1104 flow [2025-03-04 06:41:38,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1104, PETRI_PLACES=543, PETRI_TRANSITIONS=540} [2025-03-04 06:41:38,173 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -32 predicate places. [2025-03-04 06:41:38,174 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 540 transitions, 1104 flow [2025-03-04 06:41:38,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 0 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-04 06:41:38,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:38,175 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-04 06:41:38,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 06:41:38,175 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting whoop_wrapper_nvram_unlocked_ioctlErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:38,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:38,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1502269747, now seen corresponding path program 1 times [2025-03-04 06:41:38,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:38,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129096237] [2025-03-04 06:41:38,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:38,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:38,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-04 06:41:38,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-04 06:41:38,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:38,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:38,281 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-04 06:41:38,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:38,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129096237] [2025-03-04 06:41:38,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129096237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:38,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:38,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:38,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686896002] [2025-03-04 06:41:38,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:38,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:38,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:38,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:38,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:38,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 587 [2025-03-04 06:41:38,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 540 transitions, 1104 flow. Second operand has 3 states, 3 states have (on average 570.6666666666666) internal successors, (1712), 3 states have internal predecessors, (1712), 0 states have call successors, (0), 0 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-04 06:41:38,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:38,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 587 [2025-03-04 06:41:38,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:38,417 INFO L124 PetriNetUnfolderBase]: 23/800 cut-off events. [2025-03-04 06:41:38,418 INFO L125 PetriNetUnfolderBase]: For 11/13 co-relation queries the response was YES. [2025-03-04 06:41:38,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 800 events. 23/800 cut-off events. For 11/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2053 event pairs, 0 based on Foata normal form. 0/773 useless extension candidates. Maximal degree in co-relation 648. Up to 24 conditions per place. [2025-03-04 06:41:38,425 INFO L140 encePairwiseOnDemand]: 585/587 looper letters, 7 selfloop transitions, 1 changer transitions 1/540 dead transitions. [2025-03-04 06:41:38,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 540 transitions, 1123 flow [2025-03-04 06:41:38,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:38,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1717 transitions. [2025-03-04 06:41:38,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9750141964792731 [2025-03-04 06:41:38,428 INFO L175 Difference]: Start difference. First operand has 543 places, 540 transitions, 1104 flow. Second operand 3 states and 1717 transitions. [2025-03-04 06:41:38,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 540 transitions, 1123 flow [2025-03-04 06:41:38,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 540 transitions, 1122 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:41:38,438 INFO L231 Difference]: Finished difference. Result has 543 places, 539 transitions, 1103 flow [2025-03-04 06:41:38,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1103, PETRI_PLACES=543, PETRI_TRANSITIONS=539} [2025-03-04 06:41:38,440 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -32 predicate places. [2025-03-04 06:41:38,441 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 539 transitions, 1103 flow [2025-03-04 06:41:38,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.6666666666666) internal successors, (1712), 3 states have internal predecessors, (1712), 0 states have call successors, (0), 0 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-04 06:41:38,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:38,445 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] [2025-03-04 06:41:38,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 06:41:38,445 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:38,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:38,446 INFO L85 PathProgramCache]: Analyzing trace with hash 501329262, now seen corresponding path program 1 times [2025-03-04 06:41:38,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:38,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936846374] [2025-03-04 06:41:38,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:38,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:38,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-04 06:41:38,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-04 06:41:38,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:38,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:40,171 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-04 06:41:40,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:40,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936846374] [2025-03-04 06:41:40,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936846374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:40,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:40,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:41:40,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212394151] [2025-03-04 06:41:40,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:40,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:41:40,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:40,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:41:40,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:41:40,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 523 out of 587 [2025-03-04 06:41:40,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 539 transitions, 1103 flow. Second operand has 10 states, 10 states have (on average 525.0) internal successors, (5250), 10 states have internal predecessors, (5250), 0 states have call successors, (0), 0 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-04 06:41:40,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:40,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 523 of 587 [2025-03-04 06:41:40,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:41,073 INFO L124 PetriNetUnfolderBase]: 303/2861 cut-off events. [2025-03-04 06:41:41,077 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 06:41:41,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3530 conditions, 2861 events. 303/2861 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 22072 event pairs, 47 based on Foata normal form. 0/2715 useless extension candidates. Maximal degree in co-relation 3322. Up to 323 conditions per place. [2025-03-04 06:41:41,091 INFO L140 encePairwiseOnDemand]: 553/587 looper letters, 67 selfloop transitions, 45 changer transitions 6/597 dead transitions. [2025-03-04 06:41:41,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 597 transitions, 1461 flow [2025-03-04 06:41:41,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:41:41,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 06:41:41,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5346 transitions. [2025-03-04 06:41:41,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9107325383304941 [2025-03-04 06:41:41,100 INFO L175 Difference]: Start difference. First operand has 543 places, 539 transitions, 1103 flow. Second operand 10 states and 5346 transitions. [2025-03-04 06:41:41,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 597 transitions, 1461 flow [2025-03-04 06:41:41,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 597 transitions, 1460 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:41:41,106 INFO L231 Difference]: Finished difference. Result has 560 places, 576 transitions, 1419 flow [2025-03-04 06:41:41,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1419, PETRI_PLACES=560, PETRI_TRANSITIONS=576} [2025-03-04 06:41:41,112 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -15 predicate places. [2025-03-04 06:41:41,112 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 576 transitions, 1419 flow [2025-03-04 06:41:41,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 525.0) internal successors, (5250), 10 states have internal predecessors, (5250), 0 states have call successors, (0), 0 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-04 06:41:41,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:41,113 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:41:41,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 06:41:41,113 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:41,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:41,114 INFO L85 PathProgramCache]: Analyzing trace with hash -451464284, now seen corresponding path program 1 times [2025-03-04 06:41:41,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:41,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594425462] [2025-03-04 06:41:41,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:41,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:41,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-04 06:41:41,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-04 06:41:41,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:41,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:48,271 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-04 06:41:48,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:48,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594425462] [2025-03-04 06:41:48,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594425462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:48,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:48,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-04 06:41:48,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146448536] [2025-03-04 06:41:48,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:48,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 06:41:48,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:48,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 06:41:48,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-03-04 06:41:50,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 587 [2025-03-04 06:41:50,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 576 transitions, 1419 flow. Second operand has 25 states, 25 states have (on average 499.92) internal successors, (12498), 25 states have internal predecessors, (12498), 0 states have call successors, (0), 0 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-04 06:41:50,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:50,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 587 [2025-03-04 06:41:50,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:52,877 INFO L124 PetriNetUnfolderBase]: 1150/5598 cut-off events. [2025-03-04 06:41:52,877 INFO L125 PetriNetUnfolderBase]: For 962/1110 co-relation queries the response was YES. [2025-03-04 06:41:52,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9660 conditions, 5598 events. 1150/5598 cut-off events. For 962/1110 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 48431 event pairs, 72 based on Foata normal form. 24/5390 useless extension candidates. Maximal degree in co-relation 9427. Up to 980 conditions per place. [2025-03-04 06:41:52,901 INFO L140 encePairwiseOnDemand]: 542/587 looper letters, 278 selfloop transitions, 93 changer transitions 6/833 dead transitions. [2025-03-04 06:41:52,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 833 transitions, 3333 flow [2025-03-04 06:41:52,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 06:41:52,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 06:41:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 12197 transitions. [2025-03-04 06:41:52,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8657722884724588 [2025-03-04 06:41:52,908 INFO L175 Difference]: Start difference. First operand has 560 places, 576 transitions, 1419 flow. Second operand 24 states and 12197 transitions. [2025-03-04 06:41:52,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 833 transitions, 3333 flow [2025-03-04 06:41:52,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 833 transitions, 3333 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:41:52,924 INFO L231 Difference]: Finished difference. Result has 590 places, 654 transitions, 2251 flow [2025-03-04 06:41:52,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2251, PETRI_PLACES=590, PETRI_TRANSITIONS=654} [2025-03-04 06:41:52,925 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 15 predicate places. [2025-03-04 06:41:52,925 INFO L471 AbstractCegarLoop]: Abstraction has has 590 places, 654 transitions, 2251 flow [2025-03-04 06:41:52,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 499.92) internal successors, (12498), 25 states have internal predecessors, (12498), 0 states have call successors, (0), 0 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-04 06:41:52,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:52,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:41:52,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 06:41:52,928 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:41:52,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:52,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1417893396, now seen corresponding path program 2 times [2025-03-04 06:41:52,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:52,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113415695] [2025-03-04 06:41:52,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:41:52,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:52,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 356 statements into 2 equivalence classes. [2025-03-04 06:41:52,990 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 352 of 356 statements. [2025-03-04 06:41:52,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:41:52,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:58,712 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-04 06:41:58,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:58,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113415695] [2025-03-04 06:41:58,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113415695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:58,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:58,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-04 06:41:58,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082383661] [2025-03-04 06:41:58,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:58,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 06:41:58,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:58,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 06:41:58,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-03-04 06:42:00,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 587 [2025-03-04 06:42:00,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 654 transitions, 2251 flow. Second operand has 25 states, 25 states have (on average 499.92) internal successors, (12498), 25 states have internal predecessors, (12498), 0 states have call successors, (0), 0 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-04 06:42:00,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:42:00,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 587 [2025-03-04 06:42:00,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:42:02,836 INFO L124 PetriNetUnfolderBase]: 1758/8032 cut-off events. [2025-03-04 06:42:02,836 INFO L125 PetriNetUnfolderBase]: For 6201/6501 co-relation queries the response was YES. [2025-03-04 06:42:02,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17459 conditions, 8032 events. 1758/8032 cut-off events. For 6201/6501 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 75101 event pairs, 98 based on Foata normal form. 90/7802 useless extension candidates. Maximal degree in co-relation 17199. Up to 1249 conditions per place. [2025-03-04 06:42:02,873 INFO L140 encePairwiseOnDemand]: 542/587 looper letters, 379 selfloop transitions, 154 changer transitions 0/989 dead transitions. [2025-03-04 06:42:02,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 989 transitions, 5394 flow [2025-03-04 06:42:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 06:42:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 06:42:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 12739 transitions. [2025-03-04 06:42:02,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8680749574105622 [2025-03-04 06:42:02,879 INFO L175 Difference]: Start difference. First operand has 590 places, 654 transitions, 2251 flow. Second operand 25 states and 12739 transitions. [2025-03-04 06:42:02,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 989 transitions, 5394 flow [2025-03-04 06:42:02,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 989 transitions, 5379 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 06:42:02,908 INFO L231 Difference]: Finished difference. Result has 621 places, 764 transitions, 3819 flow [2025-03-04 06:42:02,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=2236, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3819, PETRI_PLACES=621, PETRI_TRANSITIONS=764} [2025-03-04 06:42:02,909 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 46 predicate places. [2025-03-04 06:42:02,909 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 764 transitions, 3819 flow [2025-03-04 06:42:02,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 499.92) internal successors, (12498), 25 states have internal predecessors, (12498), 0 states have call successors, (0), 0 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-04 06:42:02,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:42:02,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:42:02,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 06:42:02,911 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:42:02,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:42:02,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1748236916, now seen corresponding path program 3 times [2025-03-04 06:42:02,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:42:02,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109031630] [2025-03-04 06:42:02,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:42:02,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:42:02,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 356 statements into 3 equivalence classes. [2025-03-04 06:42:02,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 352 of 356 statements. [2025-03-04 06:42:02,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 06:42:02,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:42:08,355 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-04 06:42:08,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:42:08,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109031630] [2025-03-04 06:42:08,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109031630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:42:08,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:42:08,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-04 06:42:08,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169669078] [2025-03-04 06:42:08,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:42:08,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 06:42:08,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:42:08,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 06:42:08,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-03-04 06:42:09,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 587 [2025-03-04 06:42:09,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 764 transitions, 3819 flow. Second operand has 25 states, 25 states have (on average 499.92) internal successors, (12498), 25 states have internal predecessors, (12498), 0 states have call successors, (0), 0 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-04 06:42:09,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:42:09,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 587 [2025-03-04 06:42:09,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:42:12,972 INFO L124 PetriNetUnfolderBase]: 2049/9745 cut-off events. [2025-03-04 06:42:12,972 INFO L125 PetriNetUnfolderBase]: For 17696/18072 co-relation queries the response was YES. [2025-03-04 06:42:13,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24175 conditions, 9745 events. 2049/9745 cut-off events. For 17696/18072 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 96630 event pairs, 151 based on Foata normal form. 178/9509 useless extension candidates. Maximal degree in co-relation 23894. Up to 1074 conditions per place. [2025-03-04 06:42:13,085 INFO L140 encePairwiseOnDemand]: 542/587 looper letters, 407 selfloop transitions, 212 changer transitions 0/1075 dead transitions. [2025-03-04 06:42:13,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 1075 transitions, 7543 flow [2025-03-04 06:42:13,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 06:42:13,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 06:42:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 12727 transitions. [2025-03-04 06:42:13,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8672572402044293 [2025-03-04 06:42:13,095 INFO L175 Difference]: Start difference. First operand has 621 places, 764 transitions, 3819 flow. Second operand 25 states and 12727 transitions. [2025-03-04 06:42:13,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 1075 transitions, 7543 flow [2025-03-04 06:42:13,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 1075 transitions, 7422 flow, removed 46 selfloop flow, removed 9 redundant places. [2025-03-04 06:42:13,186 INFO L231 Difference]: Finished difference. Result has 652 places, 865 transitions, 5751 flow [2025-03-04 06:42:13,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=3702, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=764, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=5751, PETRI_PLACES=652, PETRI_TRANSITIONS=865} [2025-03-04 06:42:13,188 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 77 predicate places. [2025-03-04 06:42:13,188 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 865 transitions, 5751 flow [2025-03-04 06:42:13,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 499.92) internal successors, (12498), 25 states have internal predecessors, (12498), 0 states have call successors, (0), 0 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-04 06:42:13,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:42:13,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:42:13,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 06:42:13,191 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-04 06:42:13,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:42:13,193 INFO L85 PathProgramCache]: Analyzing trace with hash 711936464, now seen corresponding path program 4 times [2025-03-04 06:42:13,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:42:13,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760320616] [2025-03-04 06:42:13,193 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 06:42:13,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:42:13,219 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 356 statements into 2 equivalence classes. [2025-03-04 06:42:13,290 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 356 of 356 statements. [2025-03-04 06:42:13,291 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 06:42:13,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:42:18,273 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-04 06:42:18,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:42:18,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760320616] [2025-03-04 06:42:18,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760320616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:42:18,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973749635] [2025-03-04 06:42:18,274 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 06:42:18,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:42:18,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:42:18,280 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-04 06:42:18,281 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-04 06:42:18,502 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 356 statements into 2 equivalence classes. [2025-03-04 06:42:18,833 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 356 of 356 statements. [2025-03-04 06:42:18,833 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 06:42:18,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:42:18,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-03-04 06:42:18,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:42:19,095 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:42:19,097 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-04 06:42:19,150 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:42:19,151 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-04 06:42:19,198 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:42:19,199 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-04 06:42:19,247 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:42:19,247 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-04 06:42:19,292 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:42:19,292 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-04 06:42:19,330 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 06:42:19,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 06:42:19,386 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:42:19,386 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-04 06:42:19,427 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:42:19,427 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-04 06:42:19,474 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:42:19,474 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-04 06:42:19,521 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:42:19,521 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-04 06:42:19,563 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:42:19,563 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-04 06:42:19,603 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:42:19,603 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-04 06:42:19,645 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:42:19,645 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-04 06:42:19,686 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:42:19,687 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-04 06:42:19,732 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:42:19,733 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-04 06:42:19,784 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:42:19,785 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-04 06:42:19,823 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 06:42:19,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 06:42:20,495 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-04 06:42:20,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 06:42:20,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-04 06:42:20,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-03-04 06:42:20,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2025-03-04 06:42:20,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2025-03-04 06:42:20,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 68 [2025-03-04 06:42:20,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 78 [2025-03-04 06:42:21,162 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 65 treesize of output 46 [2025-03-04 06:42:21,205 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-04 06:42:21,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:42:21,629 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))))) is different from false [2025-03-04 06:42:21,650 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse1 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= 0 (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)))) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2) 0))))) is different from false [2025-03-04 06:42:21,670 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse1 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse3 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2 0) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1416 (Array Int Int))) (= 0 (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)))) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse3) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_1416 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1416) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))))) is different from false [2025-03-04 06:42:22,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:42:22,786 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-04 06:42:22,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:42:22,796 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-04 06:42:22,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 06:42:22,813 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-04 06:42:22,813 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-04 06:42:22,818 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-04 06:42:22,819 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-04 06:42:22,827 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-04 06:42:22,827 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-04 06:42:22,834 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-04 06:42:22,834 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-04 06:42:22,842 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-04 06:42:22,842 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-04 06:42:22,848 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-04 06:42:22,848 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-04 06:42:22,854 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-04 06:42:22,855 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