./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.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_write_nvram.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f16b4cfe031f645c2fa5eeec572887c79d8e9243727503d849e4b19e0e31cc63 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:41:43,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:41:43,959 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:43,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:41:43,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:41:43,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:41:43,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:41:43,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:41:43,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:41:43,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:41:43,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:41:43,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:41:43,990 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:41:43,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:41:43,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:41:43,990 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:41:43,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:41:43,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:41:43,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:41:43,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:41:43,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:41:43,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:41:43,991 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:41:43,991 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:41:43,991 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:41:43,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:41:43,992 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:41:43,992 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:41:43,992 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:41:43,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:41:43,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:41:43,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:41:43,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:41:43,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:41:43,992 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:41:43,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:41:43,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:41:43,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:41:43,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:41:43,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:41:43,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:41:43,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:41:43,992 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 -> f16b4cfe031f645c2fa5eeec572887c79d8e9243727503d849e4b19e0e31cc63 [2025-03-04 06:41:44,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:41:44,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:41:44,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:41:44,227 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:41:44,228 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:41:44,229 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_write_nvram.i [2025-03-04 06:41:45,406 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f0bfe55/57fd2e6a2df6435c9e00eff11f13b3f2/FLAG1769b96ca [2025-03-04 06:41:45,895 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:41:45,897 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i [2025-03-04 06:41:45,936 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f0bfe55/57fd2e6a2df6435c9e00eff11f13b3f2/FLAG1769b96ca [2025-03-04 06:41:45,951 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f0bfe55/57fd2e6a2df6435c9e00eff11f13b3f2 [2025-03-04 06:41:45,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:41:45,956 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:41:45,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:41:45,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:41:45,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:41:45,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:41:45" (1/1) ... [2025-03-04 06:41:45,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39718001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:41:45, skipping insertion in model container [2025-03-04 06:41:45,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:41:45" (1/1) ... [2025-03-04 06:41:46,036 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:41:51,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:41:51,162 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:41:51,295 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:51,296 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:51,297 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:51,297 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:51,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] [2025-03-04 06:41:51,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:41:51,696 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:41:51,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:41:51 WrapperNode [2025-03-04 06:41:51,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:41:51,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:41:51,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:41:51,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:41:51,704 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:51" (1/1) ... [2025-03-04 06:41:51,775 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:51" (1/1) ... [2025-03-04 06:41:51,823 INFO L138 Inliner]: procedures = 1354, calls = 1480, calls flagged for inlining = 353, calls inlined = 20, statements flattened = 610 [2025-03-04 06:41:51,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:41:51,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:41:51,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:41:51,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:41:51,838 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:51" (1/1) ... [2025-03-04 06:41:51,838 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:51" (1/1) ... [2025-03-04 06:41:51,843 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:51" (1/1) ... [2025-03-04 06:41:51,845 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:51" (1/1) ... [2025-03-04 06:41:51,876 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:51" (1/1) ... [2025-03-04 06:41:51,881 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:51" (1/1) ... [2025-03-04 06:41:51,888 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:51" (1/1) ... [2025-03-04 06:41:51,895 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:51" (1/1) ... [2025-03-04 06:41:51,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:41:51,908 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:41:51,909 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:41:51,909 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:41:51,910 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:41:51" (1/1) ... [2025-03-04 06:41:51,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:41:51,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:41:51,940 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:51,945 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:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:41:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:41:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:41:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:41:51,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:41:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:41:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_read_nvram [2025-03-04 06:41:51,962 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_read_nvram [2025-03-04 06:41:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:41:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:41:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 06:41:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_write_nvram [2025-03-04 06:41:51,963 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_write_nvram [2025-03-04 06:41:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:41:51,964 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:52,328 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:41:52,330 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:41:52,614 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6551: havoc access_ok_#t~nondet1286#1; [2025-03-04 06:41:52,614 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543: havoc __put_user_#t~nondet1284#1; [2025-03-04 06:41:52,614 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6636: havoc nvram_read_byte_#t~nondet1302#1; [2025-03-04 06:41:52,780 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6551: havoc access_ok_#t~nondet1286#1; [2025-03-04 06:41:52,781 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6535: havoc __get_user_#t~nondet1282#1; [2025-03-04 06:41:53,041 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6632: havoc nvram_get_size_#t~nondet1301#1; [2025-03-04 06:41:53,041 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6650: havoc printk_#t~nondet1304#1; [2025-03-04 06:41:53,042 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6624: havoc misc_register_#t~nondet1299#1; [2025-03-04 06:41:53,042 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:41:53,043 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:41:53,140 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:41:53,140 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:41:53,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:41:53 BoogieIcfgContainer [2025-03-04 06:41:53,140 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:41:53,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:41:53,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:41:53,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:41:53,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:41:45" (1/3) ... [2025-03-04 06:41:53,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2066e18b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:41:53, skipping insertion in model container [2025-03-04 06:41:53,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:41:51" (2/3) ... [2025-03-04 06:41:53,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2066e18b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:41:53, skipping insertion in model container [2025-03-04 06:41:53,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:41:53" (3/3) ... [2025-03-04 06:41:53,154 INFO L128 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_read_nvram_write_nvram.i [2025-03-04 06:41:53,164 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:41:53,170 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG char_generic_nvram_read_nvram_write_nvram.i that has 3 procedures, 590 locations, 1 initial locations, 2 loop locations, and 45 error locations. [2025-03-04 06:41:53,170 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:41:53,321 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:41:53,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 596 places, 608 transitions, 1230 flow [2025-03-04 06:41:53,545 INFO L124 PetriNetUnfolderBase]: 19/606 cut-off events. [2025-03-04 06:41:53,546 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:41:53,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 606 events. 19/606 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 847 event pairs, 0 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 472. Up to 4 conditions per place. [2025-03-04 06:41:53,560 INFO L82 GeneralOperation]: Start removeDead. Operand has 596 places, 608 transitions, 1230 flow [2025-03-04 06:41:53,567 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 590 places, 602 transitions, 1213 flow [2025-03-04 06:41:53,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:41:53,580 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;@3bbaa35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:41:53,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2025-03-04 06:41:53,595 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:41:53,595 INFO L124 PetriNetUnfolderBase]: 0/87 cut-off events. [2025-03-04 06:41:53,595 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:41:53,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:53,596 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:53,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:41:53,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:53,602 INFO L85 PathProgramCache]: Analyzing trace with hash -351807171, now seen corresponding path program 1 times [2025-03-04 06:41:53,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:53,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061236990] [2025-03-04 06:41:53,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:53,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:53,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 06:41:53,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 06:41:53,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:53,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:53,985 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:53,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:53,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061236990] [2025-03-04 06:41:53,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061236990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:53,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:53,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:53,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201183085] [2025-03-04 06:41:53,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:53,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:54,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:54,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:54,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:54,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-03-04 06:41:54,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 602 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:54,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:54,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-03-04 06:41:54,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:54,344 INFO L124 PetriNetUnfolderBase]: 60/1145 cut-off events. [2025-03-04 06:41:54,345 INFO L125 PetriNetUnfolderBase]: For 36/37 co-relation queries the response was YES. [2025-03-04 06:41:54,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1240 conditions, 1145 events. 60/1145 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4360 event pairs, 24 based on Foata normal form. 35/1074 useless extension candidates. Maximal degree in co-relation 779. Up to 68 conditions per place. [2025-03-04 06:41:54,356 INFO L140 encePairwiseOnDemand]: 590/608 looper letters, 14 selfloop transitions, 2 changer transitions 1/582 dead transitions. [2025-03-04 06:41:54,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 579 places, 582 transitions, 1205 flow [2025-03-04 06:41:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1748 transitions. [2025-03-04 06:41:54,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9583333333333334 [2025-03-04 06:41:54,379 INFO L175 Difference]: Start difference. First operand has 590 places, 602 transitions, 1213 flow. Second operand 3 states and 1748 transitions. [2025-03-04 06:41:54,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 579 places, 582 transitions, 1205 flow [2025-03-04 06:41:54,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 582 transitions, 1200 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 06:41:54,403 INFO L231 Difference]: Finished difference. Result has 576 places, 581 transitions, 1170 flow [2025-03-04 06:41:54,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1170, PETRI_PLACES=576, PETRI_TRANSITIONS=581} [2025-03-04 06:41:54,408 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -14 predicate places. [2025-03-04 06:41:54,409 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 581 transitions, 1170 flow [2025-03-04 06:41:54,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:54,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:54,414 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:54,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:41:54,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:41:54,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:54,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1322622929, now seen corresponding path program 1 times [2025-03-04 06:41:54,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:54,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597095485] [2025-03-04 06:41:54,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:54,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:54,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 06:41:54,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 06:41:54,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:54,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:54,583 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:54,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:54,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597095485] [2025-03-04 06:41:54,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597095485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:54,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:54,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:54,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197606928] [2025-03-04 06:41:54,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:54,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:54,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:54,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:54,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:54,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 571 out of 608 [2025-03-04 06:41:54,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 581 transitions, 1170 flow. Second operand has 3 states, 3 states have (on average 572.3333333333334) internal successors, (1717), 3 states have internal predecessors, (1717), 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:54,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:54,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 571 of 608 [2025-03-04 06:41:54,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:54,797 INFO L124 PetriNetUnfolderBase]: 61/1184 cut-off events. [2025-03-04 06:41:54,798 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 06:41:54,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 1184 events. 61/1184 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4500 event pairs, 29 based on Foata normal form. 0/1073 useless extension candidates. Maximal degree in co-relation 1182. Up to 74 conditions per place. [2025-03-04 06:41:54,806 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 15 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2025-03-04 06:41:54,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 580 transitions, 1202 flow [2025-03-04 06:41:54,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1731 transitions. [2025-03-04 06:41:54,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9490131578947368 [2025-03-04 06:41:54,814 INFO L175 Difference]: Start difference. First operand has 576 places, 581 transitions, 1170 flow. Second operand 3 states and 1731 transitions. [2025-03-04 06:41:54,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 580 transitions, 1202 flow [2025-03-04 06:41:54,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 580 transitions, 1198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:54,822 INFO L231 Difference]: Finished difference. Result has 574 places, 580 transitions, 1168 flow [2025-03-04 06:41:54,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1168, PETRI_PLACES=574, PETRI_TRANSITIONS=580} [2025-03-04 06:41:54,823 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -16 predicate places. [2025-03-04 06:41:54,824 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 580 transitions, 1168 flow [2025-03-04 06:41:54,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 572.3333333333334) internal successors, (1717), 3 states have internal predecessors, (1717), 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:54,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:54,826 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:54,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:41:54,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:41:54,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:54,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2146364163, now seen corresponding path program 1 times [2025-03-04 06:41:54,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:54,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169754979] [2025-03-04 06:41:54,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:54,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:54,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 06:41:54,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 06:41:54,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:54,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:54,926 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:54,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:54,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169754979] [2025-03-04 06:41:54,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169754979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:54,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:54,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:54,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908484481] [2025-03-04 06:41:54,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:54,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:54,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:54,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:54,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:54,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-03-04 06:41:54,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 580 transitions, 1168 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:54,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:54,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-03-04 06:41:54,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:55,120 INFO L124 PetriNetUnfolderBase]: 60/1142 cut-off events. [2025-03-04 06:41:55,121 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-03-04 06:41:55,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 1142 events. 60/1142 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4360 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1125. Up to 68 conditions per place. [2025-03-04 06:41:55,128 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/579 dead transitions. [2025-03-04 06:41:55,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 579 transitions, 1198 flow [2025-03-04 06:41:55,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-03-04 06:41:55,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-03-04 06:41:55,134 INFO L175 Difference]: Start difference. First operand has 574 places, 580 transitions, 1168 flow. Second operand 3 states and 1733 transitions. [2025-03-04 06:41:55,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 579 transitions, 1198 flow [2025-03-04 06:41:55,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 579 transitions, 1194 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:55,141 INFO L231 Difference]: Finished difference. Result has 573 places, 579 transitions, 1166 flow [2025-03-04 06:41:55,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1166, PETRI_PLACES=573, PETRI_TRANSITIONS=579} [2025-03-04 06:41:55,144 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -17 predicate places. [2025-03-04 06:41:55,144 INFO L471 AbstractCegarLoop]: Abstraction has has 573 places, 579 transitions, 1166 flow [2025-03-04 06:41:55,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:55,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:55,145 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:55,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:41:55,145 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:41:55,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:55,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1620452787, now seen corresponding path program 1 times [2025-03-04 06:41:55,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:55,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038808830] [2025-03-04 06:41:55,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:55,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:55,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 06:41:55,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 06:41:55,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:55,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:55,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:55,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:55,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038808830] [2025-03-04 06:41:55,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038808830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:55,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:55,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:55,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84012123] [2025-03-04 06:41:55,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:55,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:55,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:55,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:55,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:55,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 571 out of 608 [2025-03-04 06:41:55,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 579 transitions, 1166 flow. Second operand has 3 states, 3 states have (on average 572.3333333333334) internal successors, (1717), 3 states have internal predecessors, (1717), 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:55,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:55,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 571 of 608 [2025-03-04 06:41:55,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:55,375 INFO L124 PetriNetUnfolderBase]: 67/1205 cut-off events. [2025-03-04 06:41:55,376 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2025-03-04 06:41:55,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 1205 events. 67/1205 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4960 event pairs, 29 based on Foata normal form. 0/1095 useless extension candidates. Maximal degree in co-relation 1193. Up to 80 conditions per place. [2025-03-04 06:41:55,382 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 15 selfloop transitions, 2 changer transitions 0/578 dead transitions. [2025-03-04 06:41:55,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 578 transitions, 1198 flow [2025-03-04 06:41:55,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:55,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1731 transitions. [2025-03-04 06:41:55,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9490131578947368 [2025-03-04 06:41:55,385 INFO L175 Difference]: Start difference. First operand has 573 places, 579 transitions, 1166 flow. Second operand 3 states and 1731 transitions. [2025-03-04 06:41:55,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 578 transitions, 1198 flow [2025-03-04 06:41:55,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 578 transitions, 1194 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:55,392 INFO L231 Difference]: Finished difference. Result has 572 places, 578 transitions, 1164 flow [2025-03-04 06:41:55,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1160, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1164, PETRI_PLACES=572, PETRI_TRANSITIONS=578} [2025-03-04 06:41:55,394 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -18 predicate places. [2025-03-04 06:41:55,394 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 578 transitions, 1164 flow [2025-03-04 06:41:55,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 572.3333333333334) internal successors, (1717), 3 states have internal predecessors, (1717), 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:55,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:55,395 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:55,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:41:55,395 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:41:55,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:55,396 INFO L85 PathProgramCache]: Analyzing trace with hash -30194708, now seen corresponding path program 1 times [2025-03-04 06:41:55,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:55,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345703321] [2025-03-04 06:41:55,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:55,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:55,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 06:41:55,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 06:41:55,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:55,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:55,487 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:55,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:55,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345703321] [2025-03-04 06:41:55,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345703321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:55,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:55,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:55,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74563160] [2025-03-04 06:41:55,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:55,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:55,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:55,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:55,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:55,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-03-04 06:41:55,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 578 transitions, 1164 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:55,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:55,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-03-04 06:41:55,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:55,658 INFO L124 PetriNetUnfolderBase]: 60/1140 cut-off events. [2025-03-04 06:41:55,658 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-03-04 06:41:55,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1225 conditions, 1140 events. 60/1140 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4322 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1109. Up to 68 conditions per place. [2025-03-04 06:41:55,665 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/577 dead transitions. [2025-03-04 06:41:55,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 577 transitions, 1194 flow [2025-03-04 06:41:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:55,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-03-04 06:41:55,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-03-04 06:41:55,668 INFO L175 Difference]: Start difference. First operand has 572 places, 578 transitions, 1164 flow. Second operand 3 states and 1733 transitions. [2025-03-04 06:41:55,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 577 transitions, 1194 flow [2025-03-04 06:41:55,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 577 transitions, 1190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:55,675 INFO L231 Difference]: Finished difference. Result has 571 places, 577 transitions, 1162 flow [2025-03-04 06:41:55,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1158, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1162, PETRI_PLACES=571, PETRI_TRANSITIONS=577} [2025-03-04 06:41:55,677 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -19 predicate places. [2025-03-04 06:41:55,677 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 577 transitions, 1162 flow [2025-03-04 06:41:55,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:55,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:55,678 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:55,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:41:55,678 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:41:55,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:55,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1256547324, now seen corresponding path program 1 times [2025-03-04 06:41:55,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:55,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689900343] [2025-03-04 06:41:55,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:55,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:55,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 06:41:55,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 06:41:55,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:55,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:55,760 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:55,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:55,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689900343] [2025-03-04 06:41:55,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689900343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:55,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:55,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:55,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098477361] [2025-03-04 06:41:55,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:55,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:55,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:55,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:55,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:55,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-03-04 06:41:55,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 577 transitions, 1162 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:55,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:55,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-03-04 06:41:55,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:55,912 INFO L124 PetriNetUnfolderBase]: 60/1139 cut-off events. [2025-03-04 06:41:55,912 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-03-04 06:41:55,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 1139 events. 60/1139 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4330 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1101. Up to 68 conditions per place. [2025-03-04 06:41:55,919 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/576 dead transitions. [2025-03-04 06:41:55,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 576 transitions, 1192 flow [2025-03-04 06:41:55,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:55,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-03-04 06:41:55,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-03-04 06:41:55,923 INFO L175 Difference]: Start difference. First operand has 571 places, 577 transitions, 1162 flow. Second operand 3 states and 1733 transitions. [2025-03-04 06:41:55,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 576 transitions, 1192 flow [2025-03-04 06:41:55,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 576 transitions, 1188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:55,929 INFO L231 Difference]: Finished difference. Result has 570 places, 576 transitions, 1160 flow [2025-03-04 06:41:55,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1160, PETRI_PLACES=570, PETRI_TRANSITIONS=576} [2025-03-04 06:41:55,931 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -20 predicate places. [2025-03-04 06:41:55,931 INFO L471 AbstractCegarLoop]: Abstraction has has 570 places, 576 transitions, 1160 flow [2025-03-04 06:41:55,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:55,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:55,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:41:55,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:41:55,933 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:41:55,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:55,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1668118081, now seen corresponding path program 1 times [2025-03-04 06:41:55,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:55,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465041399] [2025-03-04 06:41:55,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:55,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:55,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 06:41:55,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 06:41:55,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:55,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:56,017 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:56,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:56,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465041399] [2025-03-04 06:41:56,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465041399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:56,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:56,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:56,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700112317] [2025-03-04 06:41:56,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:56,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:56,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:56,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:56,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:56,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-03-04 06:41:56,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 576 transitions, 1160 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:56,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:56,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-03-04 06:41:56,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:56,204 INFO L124 PetriNetUnfolderBase]: 60/1138 cut-off events. [2025-03-04 06:41:56,205 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-03-04 06:41:56,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 1138 events. 60/1138 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4328 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1093. Up to 68 conditions per place. [2025-03-04 06:41:56,212 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/575 dead transitions. [2025-03-04 06:41:56,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 575 transitions, 1190 flow [2025-03-04 06:41:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-03-04 06:41:56,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-03-04 06:41:56,216 INFO L175 Difference]: Start difference. First operand has 570 places, 576 transitions, 1160 flow. Second operand 3 states and 1733 transitions. [2025-03-04 06:41:56,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 575 transitions, 1190 flow [2025-03-04 06:41:56,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 575 transitions, 1186 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:56,224 INFO L231 Difference]: Finished difference. Result has 569 places, 575 transitions, 1158 flow [2025-03-04 06:41:56,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1158, PETRI_PLACES=569, PETRI_TRANSITIONS=575} [2025-03-04 06:41:56,225 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -21 predicate places. [2025-03-04 06:41:56,225 INFO L471 AbstractCegarLoop]: Abstraction has has 569 places, 575 transitions, 1158 flow [2025-03-04 06:41:56,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:56,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:56,227 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:56,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:41:56,227 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:41:56,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:56,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2051978074, now seen corresponding path program 1 times [2025-03-04 06:41:56,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:56,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804450105] [2025-03-04 06:41:56,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:56,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:56,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 06:41:56,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 06:41:56,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:56,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:56,302 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:56,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:56,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804450105] [2025-03-04 06:41:56,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804450105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:56,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:56,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:56,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106953582] [2025-03-04 06:41:56,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:56,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:56,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:56,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:56,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:56,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-03-04 06:41:56,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 575 transitions, 1158 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:56,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:56,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-03-04 06:41:56,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:56,467 INFO L124 PetriNetUnfolderBase]: 60/1137 cut-off events. [2025-03-04 06:41:56,467 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-03-04 06:41:56,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 1137 events. 60/1137 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4333 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1085. Up to 68 conditions per place. [2025-03-04 06:41:56,474 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/574 dead transitions. [2025-03-04 06:41:56,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 574 transitions, 1188 flow [2025-03-04 06:41:56,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-03-04 06:41:56,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-03-04 06:41:56,478 INFO L175 Difference]: Start difference. First operand has 569 places, 575 transitions, 1158 flow. Second operand 3 states and 1733 transitions. [2025-03-04 06:41:56,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 574 transitions, 1188 flow [2025-03-04 06:41:56,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 574 transitions, 1184 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:56,485 INFO L231 Difference]: Finished difference. Result has 568 places, 574 transitions, 1156 flow [2025-03-04 06:41:56,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1156, PETRI_PLACES=568, PETRI_TRANSITIONS=574} [2025-03-04 06:41:56,486 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -22 predicate places. [2025-03-04 06:41:56,486 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 574 transitions, 1156 flow [2025-03-04 06:41:56,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:56,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:56,487 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:56,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:41:56,488 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:41:56,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:56,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1861733272, now seen corresponding path program 1 times [2025-03-04 06:41:56,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:56,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854382493] [2025-03-04 06:41:56,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:56,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:56,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 06:41:56,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 06:41:56,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:56,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:56,557 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:56,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:56,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854382493] [2025-03-04 06:41:56,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854382493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:56,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:56,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:56,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889594287] [2025-03-04 06:41:56,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:56,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:56,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:56,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:56,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:56,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-03-04 06:41:56,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 574 transitions, 1156 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:56,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:56,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-03-04 06:41:56,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:56,713 INFO L124 PetriNetUnfolderBase]: 60/1136 cut-off events. [2025-03-04 06:41:56,713 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-03-04 06:41:56,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1221 conditions, 1136 events. 60/1136 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4309 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1077. Up to 68 conditions per place. [2025-03-04 06:41:56,718 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/573 dead transitions. [2025-03-04 06:41:56,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 573 transitions, 1186 flow [2025-03-04 06:41:56,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:56,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:56,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-03-04 06:41:56,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-03-04 06:41:56,722 INFO L175 Difference]: Start difference. First operand has 568 places, 574 transitions, 1156 flow. Second operand 3 states and 1733 transitions. [2025-03-04 06:41:56,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 573 transitions, 1186 flow [2025-03-04 06:41:56,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 573 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:56,728 INFO L231 Difference]: Finished difference. Result has 567 places, 573 transitions, 1154 flow [2025-03-04 06:41:56,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=567, PETRI_TRANSITIONS=573} [2025-03-04 06:41:56,730 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -23 predicate places. [2025-03-04 06:41:56,730 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 573 transitions, 1154 flow [2025-03-04 06:41:56,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:56,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:56,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:41:56,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:41:56,732 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:41:56,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:56,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1617734729, now seen corresponding path program 1 times [2025-03-04 06:41:56,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:56,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023799212] [2025-03-04 06:41:56,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:56,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:56,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 06:41:56,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 06:41:56,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:56,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:56,813 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:56,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:56,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023799212] [2025-03-04 06:41:56,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023799212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:56,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:56,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:56,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765009840] [2025-03-04 06:41:56,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:56,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:56,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:56,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:56,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:56,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-03-04 06:41:56,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 573 transitions, 1154 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:56,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:56,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-03-04 06:41:56,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:56,952 INFO L124 PetriNetUnfolderBase]: 60/1135 cut-off events. [2025-03-04 06:41:56,953 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-03-04 06:41:56,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 1135 events. 60/1135 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4292 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1069. Up to 68 conditions per place. [2025-03-04 06:41:56,959 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/572 dead transitions. [2025-03-04 06:41:56,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 572 transitions, 1184 flow [2025-03-04 06:41:56,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:56,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-03-04 06:41:56,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-03-04 06:41:56,963 INFO L175 Difference]: Start difference. First operand has 567 places, 573 transitions, 1154 flow. Second operand 3 states and 1733 transitions. [2025-03-04 06:41:56,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 572 transitions, 1184 flow [2025-03-04 06:41:56,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 572 transitions, 1180 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:56,971 INFO L231 Difference]: Finished difference. Result has 566 places, 572 transitions, 1152 flow [2025-03-04 06:41:56,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1152, PETRI_PLACES=566, PETRI_TRANSITIONS=572} [2025-03-04 06:41:56,973 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -24 predicate places. [2025-03-04 06:41:56,974 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 572 transitions, 1152 flow [2025-03-04 06:41:56,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:56,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:56,975 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:56,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:41:56,975 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:41:56,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:56,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1048523883, now seen corresponding path program 1 times [2025-03-04 06:41:56,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:56,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163433399] [2025-03-04 06:41:56,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:56,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:56,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 06:41:57,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 06:41:57,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:57,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:57,050 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:57,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:57,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163433399] [2025-03-04 06:41:57,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163433399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:57,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:57,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:57,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626917600] [2025-03-04 06:41:57,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:57,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:57,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:57,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:57,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:57,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-03-04 06:41:57,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 572 transitions, 1152 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:57,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:57,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-03-04 06:41:57,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:57,196 INFO L124 PetriNetUnfolderBase]: 60/1134 cut-off events. [2025-03-04 06:41:57,196 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-03-04 06:41:57,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 1134 events. 60/1134 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4290 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1061. Up to 68 conditions per place. [2025-03-04 06:41:57,202 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/571 dead transitions. [2025-03-04 06:41:57,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 571 transitions, 1182 flow [2025-03-04 06:41:57,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-03-04 06:41:57,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-03-04 06:41:57,206 INFO L175 Difference]: Start difference. First operand has 566 places, 572 transitions, 1152 flow. Second operand 3 states and 1733 transitions. [2025-03-04 06:41:57,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 571 transitions, 1182 flow [2025-03-04 06:41:57,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 571 transitions, 1178 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:57,213 INFO L231 Difference]: Finished difference. Result has 565 places, 571 transitions, 1150 flow [2025-03-04 06:41:57,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=563, 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=1150, PETRI_PLACES=565, PETRI_TRANSITIONS=571} [2025-03-04 06:41:57,214 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -25 predicate places. [2025-03-04 06:41:57,215 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 571 transitions, 1150 flow [2025-03-04 06:41:57,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:57,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:57,216 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:57,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:41:57,216 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:41:57,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:57,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1129436444, now seen corresponding path program 1 times [2025-03-04 06:41:57,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:57,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549309596] [2025-03-04 06:41:57,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:57,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:57,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 06:41:57,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 06:41:57,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:57,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:57,295 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:57,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:57,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549309596] [2025-03-04 06:41:57,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549309596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:57,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:57,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:57,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213338424] [2025-03-04 06:41:57,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:57,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:57,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:57,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:57,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:57,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 570 out of 608 [2025-03-04 06:41:57,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 571 transitions, 1150 flow. Second operand has 3 states, 3 states have (on average 571.3333333333334) internal successors, (1714), 3 states have internal predecessors, (1714), 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:57,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:57,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 570 of 608 [2025-03-04 06:41:57,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:57,457 INFO L124 PetriNetUnfolderBase]: 72/1282 cut-off events. [2025-03-04 06:41:57,457 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:41:57,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 1282 events. 72/1282 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5330 event pairs, 35 based on Foata normal form. 0/1175 useless extension candidates. Maximal degree in co-relation 1223. Up to 87 conditions per place. [2025-03-04 06:41:57,464 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 16 selfloop transitions, 2 changer transitions 0/570 dead transitions. [2025-03-04 06:41:57,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 570 transitions, 1184 flow [2025-03-04 06:41:57,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:57,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1729 transitions. [2025-03-04 06:41:57,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479166666666666 [2025-03-04 06:41:57,467 INFO L175 Difference]: Start difference. First operand has 565 places, 571 transitions, 1150 flow. Second operand 3 states and 1729 transitions. [2025-03-04 06:41:57,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 570 transitions, 1184 flow [2025-03-04 06:41:57,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 570 transitions, 1180 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:57,474 INFO L231 Difference]: Finished difference. Result has 564 places, 570 transitions, 1148 flow [2025-03-04 06:41:57,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1148, PETRI_PLACES=564, PETRI_TRANSITIONS=570} [2025-03-04 06:41:57,475 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -26 predicate places. [2025-03-04 06:41:57,475 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 570 transitions, 1148 flow [2025-03-04 06:41:57,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 571.3333333333334) internal successors, (1714), 3 states have internal predecessors, (1714), 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:57,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:57,477 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:57,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:41:57,477 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:41:57,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:57,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2140253497, now seen corresponding path program 1 times [2025-03-04 06:41:57,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:57,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274530828] [2025-03-04 06:41:57,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:57,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:57,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 06:41:57,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 06:41:57,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:57,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:57,543 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:57,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:57,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274530828] [2025-03-04 06:41:57,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274530828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:57,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:57,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:57,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745375430] [2025-03-04 06:41:57,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:57,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:57,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:57,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:57,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:57,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-03-04 06:41:57,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 570 transitions, 1148 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:57,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:57,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-03-04 06:41:57,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:57,683 INFO L124 PetriNetUnfolderBase]: 60/1132 cut-off events. [2025-03-04 06:41:57,683 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-03-04 06:41:57,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 1132 events. 60/1132 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4303 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1045. Up to 68 conditions per place. [2025-03-04 06:41:57,689 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/569 dead transitions. [2025-03-04 06:41:57,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 569 transitions, 1178 flow [2025-03-04 06:41:57,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:57,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-03-04 06:41:57,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-03-04 06:41:57,692 INFO L175 Difference]: Start difference. First operand has 564 places, 570 transitions, 1148 flow. Second operand 3 states and 1733 transitions. [2025-03-04 06:41:57,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 569 transitions, 1178 flow [2025-03-04 06:41:57,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 569 transitions, 1174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:57,699 INFO L231 Difference]: Finished difference. Result has 563 places, 569 transitions, 1146 flow [2025-03-04 06:41:57,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=561, 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=563, PETRI_TRANSITIONS=569} [2025-03-04 06:41:57,700 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -27 predicate places. [2025-03-04 06:41:57,700 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 569 transitions, 1146 flow [2025-03-04 06:41:57,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:57,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:57,701 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:57,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:41:57,702 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:41:57,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:57,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1387074495, now seen corresponding path program 1 times [2025-03-04 06:41:57,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:57,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233335889] [2025-03-04 06:41:57,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:57,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:57,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 06:41:57,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 06:41:57,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:57,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:57,767 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:57,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:57,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233335889] [2025-03-04 06:41:57,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233335889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:57,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:57,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:57,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104455339] [2025-03-04 06:41:57,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:57,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:57,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:57,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:57,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:57,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-03-04 06:41:57,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 569 transitions, 1146 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:57,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:57,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-03-04 06:41:57,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:57,923 INFO L124 PetriNetUnfolderBase]: 60/1131 cut-off events. [2025-03-04 06:41:57,924 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-03-04 06:41:57,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 1131 events. 60/1131 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4316 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1037. Up to 68 conditions per place. [2025-03-04 06:41:57,935 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/568 dead transitions. [2025-03-04 06:41:57,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 568 transitions, 1176 flow [2025-03-04 06:41:57,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:57,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-03-04 06:41:57,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-03-04 06:41:57,940 INFO L175 Difference]: Start difference. First operand has 563 places, 569 transitions, 1146 flow. Second operand 3 states and 1733 transitions. [2025-03-04 06:41:57,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 568 transitions, 1176 flow [2025-03-04 06:41:57,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 568 transitions, 1172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:57,946 INFO L231 Difference]: Finished difference. Result has 562 places, 568 transitions, 1144 flow [2025-03-04 06:41:57,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=560, 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=562, PETRI_TRANSITIONS=568} [2025-03-04 06:41:57,948 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -28 predicate places. [2025-03-04 06:41:57,948 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 568 transitions, 1144 flow [2025-03-04 06:41:57,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:57,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:57,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:41:57,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:41:57,950 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:41:57,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:57,951 INFO L85 PathProgramCache]: Analyzing trace with hash -407193481, now seen corresponding path program 1 times [2025-03-04 06:41:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:57,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009874622] [2025-03-04 06:41:57,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:57,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:57,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 06:41:57,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 06:41:57,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:57,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:58,033 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:58,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:58,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009874622] [2025-03-04 06:41:58,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009874622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:58,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:58,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:58,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667446345] [2025-03-04 06:41:58,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:58,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:58,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:58,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:58,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:58,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-03-04 06:41:58,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 568 transitions, 1144 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:58,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:58,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-03-04 06:41:58,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:58,181 INFO L124 PetriNetUnfolderBase]: 60/1130 cut-off events. [2025-03-04 06:41:58,182 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-03-04 06:41:58,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 1130 events. 60/1130 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4304 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1029. Up to 68 conditions per place. [2025-03-04 06:41:58,190 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/567 dead transitions. [2025-03-04 06:41:58,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 567 transitions, 1174 flow [2025-03-04 06:41:58,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:58,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-03-04 06:41:58,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-03-04 06:41:58,195 INFO L175 Difference]: Start difference. First operand has 562 places, 568 transitions, 1144 flow. Second operand 3 states and 1733 transitions. [2025-03-04 06:41:58,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 567 transitions, 1174 flow [2025-03-04 06:41:58,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 567 transitions, 1170 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:58,201 INFO L231 Difference]: Finished difference. Result has 561 places, 567 transitions, 1142 flow [2025-03-04 06:41:58,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=559, 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=561, PETRI_TRANSITIONS=567} [2025-03-04 06:41:58,203 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -29 predicate places. [2025-03-04 06:41:58,203 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 567 transitions, 1142 flow [2025-03-04 06:41:58,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:58,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:58,204 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:58,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:41:58,204 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:41:58,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:58,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1695692575, now seen corresponding path program 1 times [2025-03-04 06:41:58,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:58,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978492421] [2025-03-04 06:41:58,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:58,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:58,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 06:41:58,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 06:41:58,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:58,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:41:58,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:58,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978492421] [2025-03-04 06:41:58,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978492421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:58,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:58,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:58,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844276894] [2025-03-04 06:41:58,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:58,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:58,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:58,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:58,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:58,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-03-04 06:41:58,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 567 transitions, 1142 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:58,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:58,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-03-04 06:41:58,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:58,464 INFO L124 PetriNetUnfolderBase]: 60/1129 cut-off events. [2025-03-04 06:41:58,465 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-03-04 06:41:58,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 1129 events. 60/1129 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4304 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1021. Up to 68 conditions per place. [2025-03-04 06:41:58,469 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 14 selfloop transitions, 2 changer transitions 0/566 dead transitions. [2025-03-04 06:41:58,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 566 transitions, 1172 flow [2025-03-04 06:41:58,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:58,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:58,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1733 transitions. [2025-03-04 06:41:58,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950109649122807 [2025-03-04 06:41:58,474 INFO L175 Difference]: Start difference. First operand has 561 places, 567 transitions, 1142 flow. Second operand 3 states and 1733 transitions. [2025-03-04 06:41:58,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 566 transitions, 1172 flow [2025-03-04 06:41:58,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 566 transitions, 1168 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:58,481 INFO L231 Difference]: Finished difference. Result has 560 places, 566 transitions, 1140 flow [2025-03-04 06:41:58,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=558, 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=560, PETRI_TRANSITIONS=566} [2025-03-04 06:41:58,482 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -30 predicate places. [2025-03-04 06:41:58,482 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 566 transitions, 1140 flow [2025-03-04 06:41:58,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:58,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:58,484 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:58,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:41:58,484 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:41:58,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:58,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1926939758, now seen corresponding path program 1 times [2025-03-04 06:41:58,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:58,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012266230] [2025-03-04 06:41:58,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:58,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:58,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-04 06:41:58,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-04 06:41:58,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:58,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:58,570 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:58,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:58,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012266230] [2025-03-04 06:41:58,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012266230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:58,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:58,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:58,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638460209] [2025-03-04 06:41:58,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:58,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:58,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:58,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:58,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:58,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 608 [2025-03-04 06:41:58,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 566 transitions, 1140 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:58,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:58,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 608 [2025-03-04 06:41:58,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:58,776 INFO L124 PetriNetUnfolderBase]: 78/1311 cut-off events. [2025-03-04 06:41:58,776 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2025-03-04 06:41:58,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1424 conditions, 1311 events. 78/1311 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5803 event pairs, 35 based on Foata normal form. 0/1205 useless extension candidates. Maximal degree in co-relation 1224. Up to 94 conditions per place. [2025-03-04 06:41:58,783 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 17 selfloop transitions, 2 changer transitions 0/565 dead transitions. [2025-03-04 06:41:58,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 565 transitions, 1176 flow [2025-03-04 06:41:58,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:58,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1727 transitions. [2025-03-04 06:41:58,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468201754385965 [2025-03-04 06:41:58,786 INFO L175 Difference]: Start difference. First operand has 560 places, 566 transitions, 1140 flow. Second operand 3 states and 1727 transitions. [2025-03-04 06:41:58,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 565 transitions, 1176 flow [2025-03-04 06:41:58,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 565 transitions, 1172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:58,792 INFO L231 Difference]: Finished difference. Result has 559 places, 565 transitions, 1138 flow [2025-03-04 06:41:58,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=557, 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=559, PETRI_TRANSITIONS=565} [2025-03-04 06:41:58,793 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -31 predicate places. [2025-03-04 06:41:58,794 INFO L471 AbstractCegarLoop]: Abstraction has has 559 places, 565 transitions, 1138 flow [2025-03-04 06:41:58,795 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:58,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:58,795 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:58,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:41:58,795 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:41:58,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:58,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1203601368, now seen corresponding path program 1 times [2025-03-04 06:41:58,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:58,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954920813] [2025-03-04 06:41:58,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:58,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:58,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-04 06:41:58,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-04 06:41:58,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:58,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:41:58,862 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:58,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:41:58,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954920813] [2025-03-04 06:41:58,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954920813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:41:58,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:41:58,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:41:58,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832493168] [2025-03-04 06:41:58,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:41:58,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:41:58,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:41:58,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:41:58,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:41:58,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 608 [2025-03-04 06:41:58,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 565 transitions, 1138 flow. Second operand has 3 states, 3 states have (on average 570.0) internal successors, (1710), 3 states have internal predecessors, (1710), 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:58,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:41:58,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 608 [2025-03-04 06:41:58,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:41:59,044 INFO L124 PetriNetUnfolderBase]: 105/1572 cut-off events. [2025-03-04 06:41:59,044 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-04 06:41:59,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1711 conditions, 1572 events. 105/1572 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 7874 event pairs, 48 based on Foata normal form. 0/1456 useless extension candidates. Maximal degree in co-relation 1504. Up to 118 conditions per place. [2025-03-04 06:41:59,053 INFO L140 encePairwiseOnDemand]: 604/608 looper letters, 17 selfloop transitions, 1 changer transitions 0/562 dead transitions. [2025-03-04 06:41:59,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 562 transitions, 1168 flow [2025-03-04 06:41:59,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:41:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:41:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1728 transitions. [2025-03-04 06:41:59,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473684210526315 [2025-03-04 06:41:59,056 INFO L175 Difference]: Start difference. First operand has 559 places, 565 transitions, 1138 flow. Second operand 3 states and 1728 transitions. [2025-03-04 06:41:59,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 562 transitions, 1168 flow [2025-03-04 06:41:59,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 562 transitions, 1164 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:41:59,062 INFO L231 Difference]: Finished difference. Result has 556 places, 562 transitions, 1130 flow [2025-03-04 06:41:59,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1130, PETRI_PLACES=556, PETRI_TRANSITIONS=562} [2025-03-04 06:41:59,063 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -34 predicate places. [2025-03-04 06:41:59,064 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 562 transitions, 1130 flow [2025-03-04 06:41:59,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.0) internal successors, (1710), 3 states have internal predecessors, (1710), 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:59,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:41:59,065 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:59,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:41:59,065 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:41:59,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:41:59,066 INFO L85 PathProgramCache]: Analyzing trace with hash 585039272, now seen corresponding path program 1 times [2025-03-04 06:41:59,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:41:59,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952862565] [2025-03-04 06:41:59,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:41:59,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:41:59,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-04 06:41:59,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-04 06:41:59,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:41:59,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:42:00,820 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:42:00,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:42:00,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952862565] [2025-03-04 06:42:00,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952862565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:42:00,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:42:00,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:42:00,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506858819] [2025-03-04 06:42:00,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:42:00,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:42:00,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:42:00,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:42:00,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:42:00,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 608 [2025-03-04 06:42:00,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 562 transitions, 1130 flow. Second operand has 10 states, 10 states have (on average 564.3) internal successors, (5643), 10 states have internal predecessors, (5643), 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,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:42:00,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 608 [2025-03-04 06:42:00,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:42:01,137 INFO L124 PetriNetUnfolderBase]: 60/1121 cut-off events. [2025-03-04 06:42:01,137 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-03-04 06:42:01,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 1121 events. 60/1121 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4250 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1005. Up to 70 conditions per place. [2025-03-04 06:42:01,143 INFO L140 encePairwiseOnDemand]: 598/608 looper letters, 16 selfloop transitions, 9 changer transitions 0/561 dead transitions. [2025-03-04 06:42:01,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 561 transitions, 1178 flow [2025-03-04 06:42:01,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:42:01,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 06:42:01,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5656 transitions. [2025-03-04 06:42:01,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9302631578947368 [2025-03-04 06:42:01,154 INFO L175 Difference]: Start difference. First operand has 556 places, 562 transitions, 1130 flow. Second operand 10 states and 5656 transitions. [2025-03-04 06:42:01,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 561 transitions, 1178 flow [2025-03-04 06:42:01,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 561 transitions, 1177 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:42:01,161 INFO L231 Difference]: Finished difference. Result has 563 places, 561 transitions, 1145 flow [2025-03-04 06:42:01,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1145, PETRI_PLACES=563, PETRI_TRANSITIONS=561} [2025-03-04 06:42:01,162 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -27 predicate places. [2025-03-04 06:42:01,163 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 561 transitions, 1145 flow [2025-03-04 06:42:01,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 564.3) internal successors, (5643), 10 states have internal predecessors, (5643), 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:01,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:42:01,169 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:42:01,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:42:01,169 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:42:01,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:42:01,170 INFO L85 PathProgramCache]: Analyzing trace with hash -964282052, now seen corresponding path program 1 times [2025-03-04 06:42:01,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:42:01,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849898563] [2025-03-04 06:42:01,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:42:01,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:42:01,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-04 06:42:01,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-04 06:42:01,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:42:01,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:42:01,268 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:42:01,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:42:01,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849898563] [2025-03-04 06:42:01,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849898563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:42:01,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:42:01,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:42:01,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628896574] [2025-03-04 06:42:01,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:42:01,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:42:01,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:42:01,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:42:01,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:42:01,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 608 [2025-03-04 06:42:01,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 561 transitions, 1145 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:42:01,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:42:01,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 608 [2025-03-04 06:42:01,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:42:01,473 INFO L124 PetriNetUnfolderBase]: 78/1304 cut-off events. [2025-03-04 06:42:01,474 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2025-03-04 06:42:01,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 1304 events. 78/1304 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5733 event pairs, 35 based on Foata normal form. 0/1208 useless extension candidates. Maximal degree in co-relation 1218. Up to 94 conditions per place. [2025-03-04 06:42:01,482 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 17 selfloop transitions, 2 changer transitions 0/560 dead transitions. [2025-03-04 06:42:01,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 560 transitions, 1181 flow [2025-03-04 06:42:01,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:42:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:42:01,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1727 transitions. [2025-03-04 06:42:01,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468201754385965 [2025-03-04 06:42:01,486 INFO L175 Difference]: Start difference. First operand has 563 places, 561 transitions, 1145 flow. Second operand 3 states and 1727 transitions. [2025-03-04 06:42:01,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 560 transitions, 1181 flow [2025-03-04 06:42:01,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 560 transitions, 1163 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-04 06:42:01,493 INFO L231 Difference]: Finished difference. Result has 555 places, 560 transitions, 1129 flow [2025-03-04 06:42:01,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=553, 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=1129, PETRI_PLACES=555, PETRI_TRANSITIONS=560} [2025-03-04 06:42:01,495 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -35 predicate places. [2025-03-04 06:42:01,495 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 560 transitions, 1129 flow [2025-03-04 06:42:01,496 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:42:01,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:42:01,496 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:42:01,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:42:01,496 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:42:01,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:42:01,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1010641038, now seen corresponding path program 1 times [2025-03-04 06:42:01,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:42:01,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128248892] [2025-03-04 06:42:01,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:42:01,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:42:01,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-04 06:42:01,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-04 06:42:01,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:42:01,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:42:01,579 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:42:01,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:42:01,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128248892] [2025-03-04 06:42:01,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128248892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:42:01,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:42:01,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:42:01,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426863175] [2025-03-04 06:42:01,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:42:01,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:42:01,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:42:01,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:42:01,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:42:01,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 608 [2025-03-04 06:42:01,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 560 transitions, 1129 flow. Second operand has 3 states, 3 states have (on average 570.0) internal successors, (1710), 3 states have internal predecessors, (1710), 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:01,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:42:01,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 608 [2025-03-04 06:42:01,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:42:01,758 INFO L124 PetriNetUnfolderBase]: 105/1580 cut-off events. [2025-03-04 06:42:01,758 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-04 06:42:01,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1720 conditions, 1580 events. 105/1580 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7936 event pairs, 48 based on Foata normal form. 0/1471 useless extension candidates. Maximal degree in co-relation 1514. Up to 118 conditions per place. [2025-03-04 06:42:01,765 INFO L140 encePairwiseOnDemand]: 604/608 looper letters, 17 selfloop transitions, 1 changer transitions 0/557 dead transitions. [2025-03-04 06:42:01,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 557 transitions, 1159 flow [2025-03-04 06:42:01,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:42:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:42:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1728 transitions. [2025-03-04 06:42:01,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473684210526315 [2025-03-04 06:42:01,768 INFO L175 Difference]: Start difference. First operand has 555 places, 560 transitions, 1129 flow. Second operand 3 states and 1728 transitions. [2025-03-04 06:42:01,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 557 transitions, 1159 flow [2025-03-04 06:42:01,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 557 transitions, 1155 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:42:01,774 INFO L231 Difference]: Finished difference. Result has 552 places, 557 transitions, 1121 flow [2025-03-04 06:42:01,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1119, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1121, PETRI_PLACES=552, PETRI_TRANSITIONS=557} [2025-03-04 06:42:01,775 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -38 predicate places. [2025-03-04 06:42:01,775 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 557 transitions, 1121 flow [2025-03-04 06:42:01,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.0) internal successors, (1710), 3 states have internal predecessors, (1710), 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:01,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:42:01,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:42:01,776 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:42:01,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:42:01,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1361290938, now seen corresponding path program 1 times [2025-03-04 06:42:01,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:42:01,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635680010] [2025-03-04 06:42:01,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:42:01,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:42:01,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-04 06:42:01,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-04 06:42:01,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:42:01,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:42:01,873 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:01,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:42:01,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635680010] [2025-03-04 06:42:01,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635680010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:42:01,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:42:01,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:42:01,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54045400] [2025-03-04 06:42:01,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:42:01,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:42:01,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:42:01,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:42:01,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:42:01,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 608 [2025-03-04 06:42:01,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 557 transitions, 1121 flow. Second operand has 3 states, 3 states have (on average 576.6666666666666) internal successors, (1730), 3 states have internal predecessors, (1730), 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:01,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:42:01,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 608 [2025-03-04 06:42:01,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:42:02,008 INFO L124 PetriNetUnfolderBase]: 60/1113 cut-off events. [2025-03-04 06:42:02,009 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-03-04 06:42:02,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 1113 events. 60/1113 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4215 event pairs, 24 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 989. Up to 66 conditions per place. [2025-03-04 06:42:02,014 INFO L140 encePairwiseOnDemand]: 606/608 looper letters, 12 selfloop transitions, 1 changer transitions 0/556 dead transitions. [2025-03-04 06:42:02,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 556 transitions, 1145 flow [2025-03-04 06:42:02,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:42:02,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:42:02,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1742 transitions. [2025-03-04 06:42:02,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9550438596491229 [2025-03-04 06:42:02,017 INFO L175 Difference]: Start difference. First operand has 552 places, 557 transitions, 1121 flow. Second operand 3 states and 1742 transitions. [2025-03-04 06:42:02,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 556 transitions, 1145 flow [2025-03-04 06:42:02,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 556 transitions, 1144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:42:02,022 INFO L231 Difference]: Finished difference. Result has 552 places, 556 transitions, 1120 flow [2025-03-04 06:42:02,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1120, PETRI_PLACES=552, PETRI_TRANSITIONS=556} [2025-03-04 06:42:02,023 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -38 predicate places. [2025-03-04 06:42:02,024 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 556 transitions, 1120 flow [2025-03-04 06:42:02,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.6666666666666) internal successors, (1730), 3 states have internal predecessors, (1730), 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,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:42:02,024 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:42:02,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 06:42:02,024 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:42:02,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:42:02,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1827006046, now seen corresponding path program 1 times [2025-03-04 06:42:02,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:42:02,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094710102] [2025-03-04 06:42:02,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:42:02,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:42:02,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-04 06:42:02,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-04 06:42:02,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:42:02,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:42:02,109 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:02,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:42:02,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094710102] [2025-03-04 06:42:02,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094710102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:42:02,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:42:02,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:42:02,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464596420] [2025-03-04 06:42:02,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:42:02,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:42:02,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:42:02,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:42:02,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:42:02,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 608 [2025-03-04 06:42:02,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 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:42:02,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:42:02,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 608 [2025-03-04 06:42:02,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:42:02,295 INFO L124 PetriNetUnfolderBase]: 105/1353 cut-off events. [2025-03-04 06:42:02,296 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2025-03-04 06:42:02,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1505 conditions, 1353 events. 105/1353 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6633 event pairs, 48 based on Foata normal form. 0/1245 useless extension candidates. Maximal degree in co-relation 1299. Up to 130 conditions per place. [2025-03-04 06:42:02,302 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 21 selfloop transitions, 2 changer transitions 0/555 dead transitions. [2025-03-04 06:42:02,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 555 transitions, 1164 flow [2025-03-04 06:42:02,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:42:02,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:42:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1722 transitions. [2025-03-04 06:42:02,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.944078947368421 [2025-03-04 06:42:02,305 INFO L175 Difference]: Start difference. First operand has 552 places, 556 transitions, 1120 flow. Second operand 3 states and 1722 transitions. [2025-03-04 06:42:02,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 555 transitions, 1164 flow [2025-03-04 06:42:02,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 555 transitions, 1163 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:42:02,311 INFO L231 Difference]: Finished difference. Result has 552 places, 555 transitions, 1121 flow [2025-03-04 06:42:02,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1117, 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=1121, PETRI_PLACES=552, PETRI_TRANSITIONS=555} [2025-03-04 06:42:02,313 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -38 predicate places. [2025-03-04 06:42:02,313 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 555 transitions, 1121 flow [2025-03-04 06:42:02,314 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:42:02,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:42:02,314 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:42:02,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 06:42:02,314 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:42:02,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:42:02,315 INFO L85 PathProgramCache]: Analyzing trace with hash -520893774, now seen corresponding path program 1 times [2025-03-04 06:42:02,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:42:02,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546112310] [2025-03-04 06:42:02,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:42:02,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:42:02,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-04 06:42:02,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-04 06:42:02,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:42:02,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:42:02,392 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:02,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:42:02,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546112310] [2025-03-04 06:42:02,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546112310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:42:02,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:42:02,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:42:02,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889330473] [2025-03-04 06:42:02,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:42:02,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:42:02,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:42:02,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:42:02,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:42:02,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 608 [2025-03-04 06:42:02,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 555 transitions, 1121 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:42:02,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:42:02,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 608 [2025-03-04 06:42:02,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:42:02,612 INFO L124 PetriNetUnfolderBase]: 152/1679 cut-off events. [2025-03-04 06:42:02,612 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2025-03-04 06:42:02,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1918 conditions, 1679 events. 152/1679 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 9045 event pairs, 53 based on Foata normal form. 0/1572 useless extension candidates. Maximal degree in co-relation 1718. Up to 194 conditions per place. [2025-03-04 06:42:02,620 INFO L140 encePairwiseOnDemand]: 599/608 looper letters, 26 selfloop transitions, 4 changer transitions 0/557 dead transitions. [2025-03-04 06:42:02,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 557 transitions, 1189 flow [2025-03-04 06:42:02,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:42:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:42:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1721 transitions. [2025-03-04 06:42:02,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9435307017543859 [2025-03-04 06:42:02,624 INFO L175 Difference]: Start difference. First operand has 552 places, 555 transitions, 1121 flow. Second operand 3 states and 1721 transitions. [2025-03-04 06:42:02,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 557 transitions, 1189 flow [2025-03-04 06:42:02,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 557 transitions, 1185 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:42:02,633 INFO L231 Difference]: Finished difference. Result has 548 places, 552 transitions, 1127 flow [2025-03-04 06:42:02,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1127, PETRI_PLACES=548, PETRI_TRANSITIONS=552} [2025-03-04 06:42:02,635 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -42 predicate places. [2025-03-04 06:42:02,635 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 552 transitions, 1127 flow [2025-03-04 06:42:02,635 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:42:02,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:42:02,635 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:42:02,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 06:42:02,636 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:42:02,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:42:02,636 INFO L85 PathProgramCache]: Analyzing trace with hash -176734587, now seen corresponding path program 1 times [2025-03-04 06:42:02,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:42:02,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493765233] [2025-03-04 06:42:02,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:42:02,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:42:02,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-04 06:42:02,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-04 06:42:02,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:42:02,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:42:02,726 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:02,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:42:02,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493765233] [2025-03-04 06:42:02,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493765233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:42:02,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:42:02,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:42:02,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698214660] [2025-03-04 06:42:02,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:42:02,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:42:02,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:42:02,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:42:02,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:42:02,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 608 [2025-03-04 06:42:02,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 552 transitions, 1127 flow. Second operand has 3 states, 3 states have (on average 576.3333333333334) internal successors, (1729), 3 states have internal predecessors, (1729), 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,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:42:02,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 608 [2025-03-04 06:42:02,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:42:02,901 INFO L124 PetriNetUnfolderBase]: 86/1441 cut-off events. [2025-03-04 06:42:02,901 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 06:42:02,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1601 conditions, 1441 events. 86/1441 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6797 event pairs, 9 based on Foata normal form. 0/1368 useless extension candidates. Maximal degree in co-relation 1394. Up to 100 conditions per place. [2025-03-04 06:42:02,909 INFO L140 encePairwiseOnDemand]: 606/608 looper letters, 18 selfloop transitions, 1 changer transitions 0/556 dead transitions. [2025-03-04 06:42:02,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 556 transitions, 1175 flow [2025-03-04 06:42:02,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:42:02,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:42:02,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1745 transitions. [2025-03-04 06:42:02,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9566885964912281 [2025-03-04 06:42:02,912 INFO L175 Difference]: Start difference. First operand has 548 places, 552 transitions, 1127 flow. Second operand 3 states and 1745 transitions. [2025-03-04 06:42:02,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 556 transitions, 1175 flow [2025-03-04 06:42:02,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 556 transitions, 1171 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:42:02,918 INFO L231 Difference]: Finished difference. Result has 548 places, 551 transitions, 1123 flow [2025-03-04 06:42:02,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1123, PETRI_PLACES=548, PETRI_TRANSITIONS=551} [2025-03-04 06:42:02,919 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -42 predicate places. [2025-03-04 06:42:02,919 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 551 transitions, 1123 flow [2025-03-04 06:42:02,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.3333333333334) internal successors, (1729), 3 states have internal predecessors, (1729), 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,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:42:02,920 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:42:02,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 06:42:02,920 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 64 more)] === [2025-03-04 06:42:02,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:42:02,921 INFO L85 PathProgramCache]: Analyzing trace with hash -558276928, now seen corresponding path program 1 times [2025-03-04 06:42:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:42:02,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941917835] [2025-03-04 06:42:02,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:42:02,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:42:02,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-04 06:42:02,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-04 06:42:02,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:42:02,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:42:03,006 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:03,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:42:03,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941917835] [2025-03-04 06:42:03,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941917835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:42:03,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:42:03,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:42:03,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788013905] [2025-03-04 06:42:03,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:42:03,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:42:03,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:42:03,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:42:03,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:42:03,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 608 [2025-03-04 06:42:03,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 551 transitions, 1123 flow. Second operand has 3 states, 3 states have (on average 569.0) internal successors, (1707), 3 states have internal predecessors, (1707), 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:03,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:42:03,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 608 [2025-03-04 06:42:03,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:42:03,208 INFO L124 PetriNetUnfolderBase]: 110/1495 cut-off events. [2025-03-04 06:42:03,208 INFO L125 PetriNetUnfolderBase]: For 28/29 co-relation queries the response was YES. [2025-03-04 06:42:03,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1690 conditions, 1495 events. 110/1495 cut-off events. For 28/29 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7477 event pairs, 46 based on Foata normal form. 0/1404 useless extension candidates. Maximal degree in co-relation 1483. Up to 141 conditions per place. [2025-03-04 06:42:03,216 INFO L140 encePairwiseOnDemand]: 605/608 looper letters, 23 selfloop transitions, 2 changer transitions 0/551 dead transitions. [2025-03-04 06:42:03,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 551 transitions, 1173 flow [2025-03-04 06:42:03,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:42:03,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:42:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1725 transitions. [2025-03-04 06:42:03,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9457236842105263 [2025-03-04 06:42:03,219 INFO L175 Difference]: Start difference. First operand has 548 places, 551 transitions, 1123 flow. Second operand 3 states and 1725 transitions. [2025-03-04 06:42:03,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 551 transitions, 1173 flow [2025-03-04 06:42:03,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 551 transitions, 1172 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:42:03,225 INFO L231 Difference]: Finished difference. Result has 549 places, 551 transitions, 1130 flow [2025-03-04 06:42:03,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1130, PETRI_PLACES=549, PETRI_TRANSITIONS=551} [2025-03-04 06:42:03,227 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -41 predicate places. [2025-03-04 06:42:03,227 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 551 transitions, 1130 flow [2025-03-04 06:42:03,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 569.0) internal successors, (1707), 3 states have internal predecessors, (1707), 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:03,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:42:03,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:42:03,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 06:42:03,228 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:42:03,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:42:03,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1956803654, now seen corresponding path program 1 times [2025-03-04 06:42:03,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:42:03,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074127023] [2025-03-04 06:42:03,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:42:03,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:42:03,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-04 06:42:03,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-04 06:42:03,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:42:03,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:42:03,297 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:03,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:42:03,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074127023] [2025-03-04 06:42:03,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074127023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:42:03,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:42:03,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:42:03,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755077787] [2025-03-04 06:42:03,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:42:03,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:42:03,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:42:03,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:42:03,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:42:03,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 572 out of 608 [2025-03-04 06:42:03,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 551 transitions, 1130 flow. Second operand has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:03,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:42:03,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 572 of 608 [2025-03-04 06:42:03,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:42:03,516 INFO L124 PetriNetUnfolderBase]: 135/2044 cut-off events. [2025-03-04 06:42:03,516 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-04 06:42:03,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2267 conditions, 2044 events. 135/2044 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 12224 event pairs, 45 based on Foata normal form. 0/1946 useless extension candidates. Maximal degree in co-relation 2253. Up to 157 conditions per place. [2025-03-04 06:42:03,524 INFO L140 encePairwiseOnDemand]: 604/608 looper letters, 11 selfloop transitions, 1 changer transitions 112/552 dead transitions. [2025-03-04 06:42:03,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 552 transitions, 1172 flow [2025-03-04 06:42:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:42:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:42:03,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1737 transitions. [2025-03-04 06:42:03,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523026315789473 [2025-03-04 06:42:03,526 INFO L175 Difference]: Start difference. First operand has 549 places, 551 transitions, 1130 flow. Second operand 3 states and 1737 transitions. [2025-03-04 06:42:03,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 552 transitions, 1172 flow [2025-03-04 06:42:03,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 552 transitions, 1170 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:42:03,535 INFO L231 Difference]: Finished difference. Result has 549 places, 439 transitions, 905 flow [2025-03-04 06:42:03,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=905, PETRI_PLACES=549, PETRI_TRANSITIONS=439} [2025-03-04 06:42:03,536 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -41 predicate places. [2025-03-04 06:42:03,536 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 439 transitions, 905 flow [2025-03-04 06:42:03,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.3333333333334) internal successors, (1720), 3 states have internal predecessors, (1720), 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:03,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:42:03,537 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:42:03,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 06:42:03,537 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-03-04 06:42:03,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:42:03,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1552481450, now seen corresponding path program 1 times [2025-03-04 06:42:03,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:42:03,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134355655] [2025-03-04 06:42:03,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:42:03,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:42:03,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-04 06:42:03,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-04 06:42:03,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:42:03,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:42:03,617 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:03,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:42:03,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134355655] [2025-03-04 06:42:03,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134355655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:42:03,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:42:03,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:42:03,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615994711] [2025-03-04 06:42:03,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:42:03,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:42:03,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:42:03,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:42:03,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:42:03,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 608 [2025-03-04 06:42:03,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 439 transitions, 905 flow. Second operand has 3 states, 3 states have (on average 576.6666666666666) internal successors, (1730), 3 states have internal predecessors, (1730), 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:03,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:42:03,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 608 [2025-03-04 06:42:03,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:42:03,691 INFO L124 PetriNetUnfolderBase]: 29/597 cut-off events. [2025-03-04 06:42:03,691 INFO L125 PetriNetUnfolderBase]: For 10/12 co-relation queries the response was YES. [2025-03-04 06:42:03,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 597 events. 29/597 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1116 event pairs, 5 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 492. Up to 34 conditions per place. [2025-03-04 06:42:03,692 INFO L140 encePairwiseOnDemand]: 606/608 looper letters, 0 selfloop transitions, 0 changer transitions 443/443 dead transitions. [2025-03-04 06:42:03,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 443 transitions, 944 flow [2025-03-04 06:42:03,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:42:03,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:42:03,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1741 transitions. [2025-03-04 06:42:03,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9544956140350878 [2025-03-04 06:42:03,695 INFO L175 Difference]: Start difference. First operand has 549 places, 439 transitions, 905 flow. Second operand 3 states and 1741 transitions. [2025-03-04 06:42:03,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 443 transitions, 944 flow [2025-03-04 06:42:03,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 443 transitions, 943 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:42:03,699 INFO L231 Difference]: Finished difference. Result has 445 places, 0 transitions, 0 flow [2025-03-04 06:42:03,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=608, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=445, PETRI_TRANSITIONS=0} [2025-03-04 06:42:03,701 INFO L279 CegarLoopForPetriNet]: 590 programPoint places, -145 predicate places. [2025-03-04 06:42:03,703 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 0 transitions, 0 flow [2025-03-04 06:42:03,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.6666666666666) internal successors, (1730), 3 states have internal predecessors, (1730), 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:03,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE (66 of 67 remaining) [2025-03-04 06:42:03,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE (65 of 67 remaining) [2025-03-04 06:42:03,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (64 of 67 remaining) [2025-03-04 06:42:03,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr6ASSERT_VIOLATIONDATA_RACE (63 of 67 remaining) [2025-03-04 06:42:03,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE (62 of 67 remaining) [2025-03-04 06:42:03,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE (61 of 67 remaining) [2025-03-04 06:42:03,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr3ASSERT_VIOLATIONDATA_RACE (60 of 67 remaining) [2025-03-04 06:42:03,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE (59 of 67 remaining) [2025-03-04 06:42:03,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE (58 of 67 remaining) [2025-03-04 06:42:03,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (57 of 67 remaining) [2025-03-04 06:42:03,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE (56 of 67 remaining) [2025-03-04 06:42:03,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE (55 of 67 remaining) [2025-03-04 06:42:03,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (54 of 67 remaining) [2025-03-04 06:42:03,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr6ASSERT_VIOLATIONDATA_RACE (53 of 67 remaining) [2025-03-04 06:42:03,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE (52 of 67 remaining) [2025-03-04 06:42:03,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr4ASSERT_VIOLATIONDATA_RACE (51 of 67 remaining) [2025-03-04 06:42:03,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr3ASSERT_VIOLATIONDATA_RACE (50 of 67 remaining) [2025-03-04 06:42:03,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE (49 of 67 remaining) [2025-03-04 06:42:03,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE (48 of 67 remaining) [2025-03-04 06:42:03,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (47 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (46 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (45 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (44 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (43 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (42 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (41 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (40 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (39 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (38 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (37 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (36 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (35 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (34 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (33 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (31 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (30 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (29 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (28 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (27 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (26 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (25 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (24 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (23 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE (19 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE (18 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (17 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr6ASSERT_VIOLATIONDATA_RACE (16 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE (15 of 67 remaining) [2025-03-04 06:42:03,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE (14 of 67 remaining) [2025-03-04 06:42:03,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr3ASSERT_VIOLATIONDATA_RACE (13 of 67 remaining) [2025-03-04 06:42:03,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE (12 of 67 remaining) [2025-03-04 06:42:03,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE (11 of 67 remaining) [2025-03-04 06:42:03,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (10 of 67 remaining) [2025-03-04 06:42:03,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE (9 of 67 remaining) [2025-03-04 06:42:03,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE (8 of 67 remaining) [2025-03-04 06:42:03,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (7 of 67 remaining) [2025-03-04 06:42:03,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr6ASSERT_VIOLATIONDATA_RACE (6 of 67 remaining) [2025-03-04 06:42:03,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE (5 of 67 remaining) [2025-03-04 06:42:03,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr4ASSERT_VIOLATIONDATA_RACE (4 of 67 remaining) [2025-03-04 06:42:03,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr3ASSERT_VIOLATIONDATA_RACE (3 of 67 remaining) [2025-03-04 06:42:03,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE (2 of 67 remaining) [2025-03-04 06:42:03,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE (1 of 67 remaining) [2025-03-04 06:42:03,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (0 of 67 remaining) [2025-03-04 06:42:03,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 06:42:03,711 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:42:03,715 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:42:03,716 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:42:03,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:42:03 BasicIcfg [2025-03-04 06:42:03,722 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:42:03,722 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:42:03,722 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:42:03,722 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:42:03,723 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:41:53" (3/4) ... [2025-03-04 06:42:03,724 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:42:03,726 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure whoop_wrapper_read_nvram [2025-03-04 06:42:03,726 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure whoop_wrapper_write_nvram [2025-03-04 06:42:03,734 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-03-04 06:42:03,735 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-04 06:42:03,735 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 06:42:03,736 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:42:03,736 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:42:03,828 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:42:03,828 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:42:03,828 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:42:03,829 INFO L158 Benchmark]: Toolchain (without parser) took 17873.43ms. Allocated memory was 201.3MB in the beginning and 738.2MB in the end (delta: 536.9MB). Free memory was 144.4MB in the beginning and 436.1MB in the end (delta: -291.7MB). Peak memory consumption was 246.3MB. Max. memory is 16.1GB. [2025-03-04 06:42:03,829 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:42:03,830 INFO L158 Benchmark]: CACSL2BoogieTranslator took 5739.56ms. Allocated memory is still 201.3MB. Free memory was 144.4MB in the beginning and 89.2MB in the end (delta: 55.2MB). Peak memory consumption was 153.4MB. Max. memory is 16.1GB. [2025-03-04 06:42:03,830 INFO L158 Benchmark]: Boogie Procedure Inliner took 132.47ms. Allocated memory is still 201.3MB. Free memory was 89.2MB in the beginning and 73.6MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 06:42:03,830 INFO L158 Benchmark]: Boogie Preprocessor took 76.93ms. Allocated memory is still 201.3MB. Free memory was 73.6MB in the beginning and 68.7MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:42:03,831 INFO L158 Benchmark]: IcfgBuilder took 1232.07ms. Allocated memory is still 201.3MB. Free memory was 68.7MB in the beginning and 51.0MB in the end (delta: 17.7MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2025-03-04 06:42:03,831 INFO L158 Benchmark]: TraceAbstraction took 10579.91ms. Allocated memory was 201.3MB in the beginning and 738.2MB in the end (delta: 536.9MB). Free memory was 51.0MB in the beginning and 444.5MB in the end (delta: -393.5MB). Peak memory consumption was 144.6MB. Max. memory is 16.1GB. [2025-03-04 06:42:03,831 INFO L158 Benchmark]: Witness Printer took 106.25ms. Allocated memory is still 738.2MB. Free memory was 444.5MB in the beginning and 436.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:42:03,832 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 5739.56ms. Allocated memory is still 201.3MB. Free memory was 144.4MB in the beginning and 89.2MB in the end (delta: 55.2MB). Peak memory consumption was 153.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 132.47ms. Allocated memory is still 201.3MB. Free memory was 89.2MB in the beginning and 73.6MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.93ms. Allocated memory is still 201.3MB. Free memory was 73.6MB in the beginning and 68.7MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1232.07ms. Allocated memory is still 201.3MB. Free memory was 68.7MB in the beginning and 51.0MB in the end (delta: 17.7MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10579.91ms. Allocated memory was 201.3MB in the beginning and 738.2MB in the end (delta: 536.9MB). Free memory was 51.0MB in the beginning and 444.5MB in the end (delta: -393.5MB). Peak memory consumption was 144.6MB. Max. memory is 16.1GB. * Witness Printer took 106.25ms. Allocated memory is still 738.2MB. Free memory was 444.5MB in the beginning and 436.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 3228]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile ("" "xchg" "b %b0, %1\n" : "+q" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] - GenericResultAtLocation [Line: 3228]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile ("" "xchg" "w %w0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] - GenericResultAtLocation [Line: 3228]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile ("" "xchg" "l %0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] - GenericResultAtLocation [Line: 3228]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile ("" "xchg" "q %q0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] - GenericResultAtLocation [Line: 5817]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6847]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6847]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6847]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6847]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6722]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6724]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6727]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6733]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6736]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6729]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6842]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6842]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6842]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6842]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6750]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6752]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6755]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6763]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6766]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6757]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6867]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6868]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6869]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6870]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6871]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6872]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6873]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6874]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6875]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6876]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6877]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6878]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6879]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6880]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6881]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6882]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6883]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6884]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6884]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6885]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6886]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6887]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6810]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6811]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 6812]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 832 locations, 67 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.4s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 508 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 139 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1083 IncrementalHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 139 mSDtfsCounter, 1083 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1213occurred in iteration=0, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 5281 NumberOfCodeBlocks, 5281 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 5253 ConstructedInterpolants, 0 QuantifiedInterpolants, 5614 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 42/42 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 45 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:42:03,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE