./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f16b4cfe031f645c2fa5eeec572887c79d8e9243727503d849e4b19e0e31cc63 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:27:55,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:27:55,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:27:55,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:27:55,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:27:55,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:27:55,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:27:55,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:27:55,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:27:55,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:27:55,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:27:55,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:27:55,919 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:27:55,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:27:55,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:27:55,920 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:27:55,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:27:55,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:27:55,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:27:55,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:27:55,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:27:55,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:27:55,920 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:27:55,921 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:27:55,921 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:27:55,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:27:55,921 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:27:55,921 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:27:55,921 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:27:55,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:27:55,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:27:55,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:27:55,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:27:55,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:27:55,922 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:27:55,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:27:55,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:27:55,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:27:55,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:27:55,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:27:55,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:27:55,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:27:55,922 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f16b4cfe031f645c2fa5eeec572887c79d8e9243727503d849e4b19e0e31cc63 [2025-02-08 05:27:56,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:27:56,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:27:56,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:27:56,114 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:27:56,114 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:27:56,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i [2025-02-08 05:27:57,231 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5fda1e51c/1f98490b69964646a01cfe69c2e36303/FLAG5c8ba98e6 [2025-02-08 05:27:57,701 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:27:57,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i [2025-02-08 05:27:57,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5fda1e51c/1f98490b69964646a01cfe69c2e36303/FLAG5c8ba98e6 [2025-02-08 05:27:57,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5fda1e51c/1f98490b69964646a01cfe69c2e36303 [2025-02-08 05:27:57,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:27:57,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:27:57,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:27:57,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:27:57,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:27:57,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:27:57" (1/1) ... [2025-02-08 05:27:57,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d424a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:27:57, skipping insertion in model container [2025-02-08 05:27:57,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:27:57" (1/1) ... [2025-02-08 05:27:57,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:28:01,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:28:01,499 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:28:01,586 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "b %b0, %1\n" : "+q" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-02-08 05:28:01,587 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "w %w0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-02-08 05:28:01,587 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "l %0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-02-08 05:28:01,587 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "q %q0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-02-08 05:28:01,699 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] [2025-02-08 05:28:01,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:28:02,035 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:28:02,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:28:02 WrapperNode [2025-02-08 05:28:02,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:28:02,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:28:02,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:28:02,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:28:02,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:28:02" (1/1) ... [2025-02-08 05:28:02,130 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:28:02" (1/1) ... [2025-02-08 05:28:02,188 INFO L138 Inliner]: procedures = 1354, calls = 1480, calls flagged for inlining = 353, calls inlined = 20, statements flattened = 610 [2025-02-08 05:28:02,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:28:02,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:28:02,189 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:28:02,189 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:28:02,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:28:02" (1/1) ... [2025-02-08 05:28:02,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:28:02" (1/1) ... [2025-02-08 05:28:02,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:28:02" (1/1) ... [2025-02-08 05:28:02,205 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:28:02" (1/1) ... [2025-02-08 05:28:02,231 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:28:02" (1/1) ... [2025-02-08 05:28:02,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:28:02" (1/1) ... [2025-02-08 05:28:02,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:28:02" (1/1) ... [2025-02-08 05:28:02,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:28:02" (1/1) ... [2025-02-08 05:28:02,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:28:02,256 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:28:02,256 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:28:02,256 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:28:02,257 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:28:02" (1/1) ... [2025-02-08 05:28:02,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:28:02,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:28:02,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:28:02,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:28:02,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:28:02,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:28:02,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:28:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:28:02,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:28:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:28:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_read_nvram [2025-02-08 05:28:02,306 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_read_nvram [2025-02-08 05:28:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:28:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:28:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 05:28:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_write_nvram [2025-02-08 05:28:02,306 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_write_nvram [2025-02-08 05:28:02,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:28:02,308 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:28:02,657 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:28:02,658 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:28:02,933 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6551: havoc access_ok_#t~nondet1286#1; [2025-02-08 05:28:02,934 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543: havoc __put_user_#t~nondet1284#1; [2025-02-08 05:28:02,934 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543-5: havoc __put_user_#t~nondet1284#1; [2025-02-08 05:28:02,934 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543-4: assume -2147483648 <= __put_user_#t~nondet1284#1 && __put_user_#t~nondet1284#1 <= 2147483647; [2025-02-08 05:28:02,934 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543-3: __put_user_#res#1 := __put_user_#t~nondet1284#1; [2025-02-08 05:28:02,934 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543-2: havoc __put_user_#t~nondet1284#1; [2025-02-08 05:28:02,934 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6636: havoc nvram_read_byte_#t~nondet1302#1; [2025-02-08 05:28:02,934 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6729-3: read_nvram_#t~pre1325#1 := read_nvram_~count#1 - 1; [2025-02-08 05:28:02,934 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6729-2: read_nvram_~count#1 := read_nvram_~count#1 - 1; [2025-02-08 05:28:02,934 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6729-1: havoc read_nvram_#t~pre1325#1; [2025-02-08 05:28:02,934 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6729-7: havoc read_nvram_#t~pre1323#1; [2025-02-08 05:28:02,934 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6729-6: read_nvram_#t~pre1324#1.base, read_nvram_#t~pre1324#1.offset := read_nvram_~p~1#1.base, 1 + read_nvram_~p~1#1.offset; [2025-02-08 05:28:02,934 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6729-5: read_nvram_~p~1#1.base, read_nvram_~p~1#1.offset := read_nvram_~p~1#1.base, 1 + read_nvram_~p~1#1.offset; [2025-02-08 05:28:02,934 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6729-4: havoc read_nvram_#t~pre1324#1.base, read_nvram_#t~pre1324#1.offset; [2025-02-08 05:28:02,934 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6729-9: read_nvram_#t~pre1323#1 := 1 + read_nvram_~i~1#1; [2025-02-08 05:28:02,934 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6729-8: read_nvram_~i~1#1 := 1 + read_nvram_~i~1#1; [2025-02-08 05:28:02,934 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730: havoc read_nvram_#t~ret1322#1; [2025-02-08 05:28:02,935 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-4: havoc read_nvram_#t~ret1321#1; [2025-02-08 05:28:02,935 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-3: havoc read_nvram_#t~ret1321#1; [2025-02-08 05:28:02,935 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-2: assume 0 != read_nvram_#t~ret1322#1; [2025-02-08 05:28:02,935 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-2: assume !(0 != read_nvram_#t~ret1322#1); [2025-02-08 05:28:02,935 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-1: havoc read_nvram_#t~ret1322#1; [2025-02-08 05:28:02,935 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-8: read_nvram_#t~ret1322#1 := __put_user_#res#1; [2025-02-08 05:28:02,935 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-7: havoc __put_user_#t~nondet1284#1, __put_user_~arg0#1, __put_user_~arg1#1.base, __put_user_~arg1#1.offset; [2025-02-08 05:28:02,935 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-6: havoc __put_user_#in~arg0#1, __put_user_#in~arg1#1.base, __put_user_#in~arg1#1.offset; [2025-02-08 05:28:02,935 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-5: assume { :end_inline___put_user } true;assume -2147483648 <= read_nvram_#t~ret1322#1 && read_nvram_#t~ret1322#1 <= 2147483647; [2025-02-08 05:28:02,935 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-12: havoc nvram_read_byte_#in~arg0#1; [2025-02-08 05:28:02,935 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-11: assume { :end_inline_nvram_read_byte } true;assume { :begin_inline___put_user } true;__put_user_#in~arg0#1, __put_user_#in~arg1#1.base, __put_user_#in~arg1#1.offset := (if read_nvram_#t~ret1321#1 % 256 % 4294967296 <= 2147483647 then read_nvram_#t~ret1321#1 % 256 % 4294967296 else read_nvram_#t~ret1321#1 % 256 % 4294967296 - 4294967296), read_nvram_~p~1#1.base, read_nvram_~p~1#1.offset; [2025-02-08 05:28:02,935 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-10: havoc __put_user_#res#1; [2025-02-08 05:28:02,935 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-9: havoc __put_user_#t~nondet1284#1, __put_user_~arg0#1, __put_user_~arg1#1.base, __put_user_~arg1#1.offset; [2025-02-08 05:28:02,935 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-14: read_nvram_#t~ret1321#1 := nvram_read_byte_#res#1; [2025-02-08 05:28:02,935 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-13: havoc nvram_read_byte_#t~nondet1302#1, nvram_read_byte_~arg0#1; [2025-02-08 05:28:02,935 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6731-1: read_nvram_#res#1 := -14; [2025-02-08 05:28:02,935 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6542: __put_user_~arg1#1.base, __put_user_~arg1#1.offset := __put_user_#in~arg1#1.base, __put_user_#in~arg1#1.offset; [2025-02-08 05:28:02,935 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6542-1: __put_user_~arg0#1 := __put_user_#in~arg0#1; [2025-02-08 05:28:03,102 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6757-7: havoc write_nvram_#t~pre1334#1; [2025-02-08 05:28:03,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6757-6: write_nvram_#t~pre1335#1.base, write_nvram_#t~pre1335#1.offset := write_nvram_~p~2#1.base, 1 + write_nvram_~p~2#1.offset; [2025-02-08 05:28:03,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6757-5: write_nvram_~p~2#1.base, write_nvram_~p~2#1.offset := write_nvram_~p~2#1.base, 1 + write_nvram_~p~2#1.offset; [2025-02-08 05:28:03,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6757-4: havoc write_nvram_#t~pre1335#1.base, write_nvram_#t~pre1335#1.offset; [2025-02-08 05:28:03,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6757-8: write_nvram_~i~2#1 := 1 + write_nvram_~i~2#1; [2025-02-08 05:28:03,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6551: havoc access_ok_#t~nondet1286#1; [2025-02-08 05:28:03,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6758: assume 0 != write_nvram_#t~ret1333#1; [2025-02-08 05:28:03,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6758: assume !(0 != write_nvram_#t~ret1333#1); [2025-02-08 05:28:03,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6535: havoc __get_user_#t~nondet1282#1; [2025-02-08 05:28:03,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6758-4: havoc __get_user_#in~arg0#1, __get_user_#in~arg1#1.base, __get_user_#in~arg1#1.offset; [2025-02-08 05:28:03,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6758-3: assume { :end_inline___get_user } true;assume -2147483648 <= write_nvram_#t~ret1333#1 && write_nvram_#t~ret1333#1 <= 2147483647; [2025-02-08 05:28:03,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6758-2: havoc write_nvram_#t~ret1333#1; [2025-02-08 05:28:03,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6758-1: havoc write_nvram_#t~ret1333#1; [2025-02-08 05:28:03,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6758-6: write_nvram_#t~ret1333#1 := __get_user_#res#1; [2025-02-08 05:28:03,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6758-5: havoc __get_user_#t~nondet1282#1, __get_user_~arg0#1, __get_user_~arg1#1.base, __get_user_~arg1#1.offset; [2025-02-08 05:28:03,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6759-1: write_nvram_#res#1 := -14; [2025-02-08 05:28:03,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6760-2: havoc nvram_write_byte_~arg0#1, nvram_write_byte_~arg1#1; [2025-02-08 05:28:03,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6760-1: havoc nvram_write_byte_#in~arg0#1, nvram_write_byte_#in~arg1#1; [2025-02-08 05:28:03,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6760: assume { :end_inline_nvram_write_byte } true;write_nvram_#t~pre1334#1 := 1 + write_nvram_~i~2#1; [2025-02-08 05:28:03,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6760-4: assume { :begin_inline_nvram_write_byte } true;nvram_write_byte_#in~arg0#1, nvram_write_byte_#in~arg1#1 := write_nvram_~c~4#1, (if write_nvram_~i~2#1 % 4294967296 % 4294967296 <= 2147483647 then write_nvram_~i~2#1 % 4294967296 % 4294967296 else write_nvram_~i~2#1 % 4294967296 % 4294967296 - 4294967296); [2025-02-08 05:28:03,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6760-3: havoc nvram_write_byte_~arg0#1, nvram_write_byte_~arg1#1; [2025-02-08 05:28:03,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6641-1: nvram_write_byte_~arg0#1 := nvram_write_byte_#in~arg0#1; [2025-02-08 05:28:03,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6641: nvram_write_byte_~arg1#1 := nvram_write_byte_#in~arg1#1; [2025-02-08 05:28:03,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6757-3: write_nvram_#t~pre1336#1 := write_nvram_~count#1 - 1; [2025-02-08 05:28:03,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6757-2: write_nvram_~count#1 := write_nvram_~count#1 - 1; [2025-02-08 05:28:03,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6757-1: havoc write_nvram_#t~pre1336#1; [2025-02-08 05:28:03,305 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6632: havoc nvram_get_size_#t~nondet1301#1; [2025-02-08 05:28:03,305 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6650: havoc printk_#t~nondet1304#1; [2025-02-08 05:28:03,305 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6624: havoc misc_register_#t~nondet1299#1; [2025-02-08 05:28:03,306 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:28:03,306 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:28:03,419 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:28:03,420 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:28:03,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:28:03 BoogieIcfgContainer [2025-02-08 05:28:03,420 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:28:03,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:28:03,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:28:03,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:28:03,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:27:57" (1/3) ... [2025-02-08 05:28:03,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef38da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:28:03, skipping insertion in model container [2025-02-08 05:28:03,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:28:02" (2/3) ... [2025-02-08 05:28:03,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef38da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:28:03, skipping insertion in model container [2025-02-08 05:28:03,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:28:03" (3/3) ... [2025-02-08 05:28:03,426 INFO L128 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_read_nvram_write_nvram.i [2025-02-08 05:28:03,435 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:28:03,437 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG char_generic_nvram_read_nvram_write_nvram.i that has 3 procedures, 541 locations, 1 initial locations, 2 loop locations, and 45 error locations. [2025-02-08 05:28:03,437 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:28:03,546 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:28:03,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 547 places, 552 transitions, 1118 flow [2025-02-08 05:28:03,716 INFO L124 PetriNetUnfolderBase]: 12/550 cut-off events. [2025-02-08 05:28:03,718 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:28:03,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 550 events. 12/550 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 577 event pairs, 0 based on Foata normal form. 0/488 useless extension candidates. Maximal degree in co-relation 448. Up to 2 conditions per place. [2025-02-08 05:28:03,731 INFO L82 GeneralOperation]: Start removeDead. Operand has 547 places, 552 transitions, 1118 flow [2025-02-08 05:28:03,737 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 540 places, 545 transitions, 1099 flow [2025-02-08 05:28:03,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:28:03,760 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;@5d21263e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:28:03,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2025-02-08 05:28:03,768 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:28:03,768 INFO L124 PetriNetUnfolderBase]: 0/87 cut-off events. [2025-02-08 05:28:03,768 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:28:03,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:03,769 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:03,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:03,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:03,772 INFO L85 PathProgramCache]: Analyzing trace with hash 489241774, now seen corresponding path program 1 times [2025-02-08 05:28:03,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:03,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231557348] [2025-02-08 05:28:03,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:03,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:03,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 05:28:03,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 05:28:03,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:03,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:04,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:04,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:04,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231557348] [2025-02-08 05:28:04,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231557348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:04,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:04,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:04,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553169858] [2025-02-08 05:28:04,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:04,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:04,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:04,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:04,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:04,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 516 out of 552 [2025-02-08 05:28:04,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 545 transitions, 1099 flow. Second operand has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:04,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:04,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 516 of 552 [2025-02-08 05:28:04,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:04,361 INFO L124 PetriNetUnfolderBase]: 35/930 cut-off events. [2025-02-08 05:28:04,362 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-02-08 05:28:04,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 930 events. 35/930 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2823 event pairs, 24 based on Foata normal form. 35/872 useless extension candidates. Maximal degree in co-relation 627. Up to 63 conditions per place. [2025-02-08 05:28:04,370 INFO L140 encePairwiseOnDemand]: 534/552 looper letters, 14 selfloop transitions, 2 changer transitions 1/525 dead transitions. [2025-02-08 05:28:04,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 525 transitions, 1091 flow [2025-02-08 05:28:04,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:04,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1580 transitions. [2025-02-08 05:28:04,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9541062801932367 [2025-02-08 05:28:04,387 INFO L175 Difference]: Start difference. First operand has 540 places, 545 transitions, 1099 flow. Second operand 3 states and 1580 transitions. [2025-02-08 05:28:04,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 525 transitions, 1091 flow [2025-02-08 05:28:04,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 525 transitions, 1086 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:28:04,404 INFO L231 Difference]: Finished difference. Result has 526 places, 524 transitions, 1056 flow [2025-02-08 05:28:04,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=526, PETRI_TRANSITIONS=524} [2025-02-08 05:28:04,409 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -14 predicate places. [2025-02-08 05:28:04,410 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 524 transitions, 1056 flow [2025-02-08 05:28:04,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:04,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:04,412 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:04,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:28:04,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:04,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:04,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1583577552, now seen corresponding path program 1 times [2025-02-08 05:28:04,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:04,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616025921] [2025-02-08 05:28:04,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:04,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:04,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:28:04,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:28:04,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:04,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:04,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:04,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616025921] [2025-02-08 05:28:04,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616025921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:04,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:04,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:04,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185894877] [2025-02-08 05:28:04,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:04,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:04,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:04,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:04,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:04,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 515 out of 552 [2025-02-08 05:28:04,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 524 transitions, 1056 flow. Second operand has 3 states, 3 states have (on average 516.3333333333334) internal successors, (1549), 3 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:04,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:04,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 515 of 552 [2025-02-08 05:28:04,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:04,782 INFO L124 PetriNetUnfolderBase]: 42/1031 cut-off events. [2025-02-08 05:28:04,782 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:28:04,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 1031 events. 42/1031 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3508 event pairs, 29 based on Foata normal form. 0/927 useless extension candidates. Maximal degree in co-relation 1029. Up to 74 conditions per place. [2025-02-08 05:28:04,786 INFO L140 encePairwiseOnDemand]: 549/552 looper letters, 15 selfloop transitions, 2 changer transitions 0/523 dead transitions. [2025-02-08 05:28:04,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 523 transitions, 1088 flow [2025-02-08 05:28:04,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:04,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:04,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1563 transitions. [2025-02-08 05:28:04,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9438405797101449 [2025-02-08 05:28:04,789 INFO L175 Difference]: Start difference. First operand has 526 places, 524 transitions, 1056 flow. Second operand 3 states and 1563 transitions. [2025-02-08 05:28:04,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 523 transitions, 1088 flow [2025-02-08 05:28:04,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 523 transitions, 1084 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:28:04,794 INFO L231 Difference]: Finished difference. Result has 524 places, 523 transitions, 1054 flow [2025-02-08 05:28:04,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1054, PETRI_PLACES=524, PETRI_TRANSITIONS=523} [2025-02-08 05:28:04,795 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -16 predicate places. [2025-02-08 05:28:04,795 INFO L471 AbstractCegarLoop]: Abstraction has has 524 places, 523 transitions, 1054 flow [2025-02-08 05:28:04,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 516.3333333333334) internal successors, (1549), 3 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:04,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:04,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:04,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:28:04,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:04,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:04,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1469233811, now seen corresponding path program 1 times [2025-02-08 05:28:04,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:04,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076452868] [2025-02-08 05:28:04,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:04,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:04,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:28:04,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:28:04,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:04,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:04,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:04,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076452868] [2025-02-08 05:28:04,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076452868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:04,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:04,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:04,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399228301] [2025-02-08 05:28:04,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:04,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:04,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:04,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:04,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:04,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 516 out of 552 [2025-02-08 05:28:04,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 523 transitions, 1054 flow. Second operand has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:04,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:04,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 516 of 552 [2025-02-08 05:28:04,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:05,011 INFO L124 PetriNetUnfolderBase]: 35/927 cut-off events. [2025-02-08 05:28:05,012 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:28:05,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 927 events. 35/927 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2809 event pairs, 24 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 905. Up to 63 conditions per place. [2025-02-08 05:28:05,016 INFO L140 encePairwiseOnDemand]: 549/552 looper letters, 14 selfloop transitions, 2 changer transitions 0/522 dead transitions. [2025-02-08 05:28:05,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 522 transitions, 1084 flow [2025-02-08 05:28:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1565 transitions. [2025-02-08 05:28:05,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9450483091787439 [2025-02-08 05:28:05,019 INFO L175 Difference]: Start difference. First operand has 524 places, 523 transitions, 1054 flow. Second operand 3 states and 1565 transitions. [2025-02-08 05:28:05,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 522 transitions, 1084 flow [2025-02-08 05:28:05,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 522 transitions, 1080 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:28:05,025 INFO L231 Difference]: Finished difference. Result has 523 places, 522 transitions, 1052 flow [2025-02-08 05:28:05,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1052, PETRI_PLACES=523, PETRI_TRANSITIONS=522} [2025-02-08 05:28:05,026 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -17 predicate places. [2025-02-08 05:28:05,026 INFO L471 AbstractCegarLoop]: Abstraction has has 523 places, 522 transitions, 1052 flow [2025-02-08 05:28:05,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:05,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:05,027 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:05,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:28:05,028 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:05,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:05,028 INFO L85 PathProgramCache]: Analyzing trace with hash 785013851, now seen corresponding path program 1 times [2025-02-08 05:28:05,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:05,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302457408] [2025-02-08 05:28:05,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:05,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:05,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 05:28:05,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 05:28:05,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:05,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:05,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:05,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302457408] [2025-02-08 05:28:05,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302457408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:05,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:05,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:05,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602106826] [2025-02-08 05:28:05,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:05,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:05,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:05,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:05,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:05,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 515 out of 552 [2025-02-08 05:28:05,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 522 transitions, 1052 flow. Second operand has 3 states, 3 states have (on average 516.3333333333334) internal successors, (1549), 3 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:05,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:05,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 515 of 552 [2025-02-08 05:28:05,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:05,262 INFO L124 PetriNetUnfolderBase]: 40/950 cut-off events. [2025-02-08 05:28:05,262 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:28:05,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 950 events. 40/950 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3021 event pairs, 29 based on Foata normal form. 0/859 useless extension candidates. Maximal degree in co-relation 932. Up to 74 conditions per place. [2025-02-08 05:28:05,267 INFO L140 encePairwiseOnDemand]: 549/552 looper letters, 15 selfloop transitions, 2 changer transitions 0/521 dead transitions. [2025-02-08 05:28:05,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 521 transitions, 1084 flow [2025-02-08 05:28:05,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:05,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:05,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1563 transitions. [2025-02-08 05:28:05,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9438405797101449 [2025-02-08 05:28:05,271 INFO L175 Difference]: Start difference. First operand has 523 places, 522 transitions, 1052 flow. Second operand 3 states and 1563 transitions. [2025-02-08 05:28:05,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 521 transitions, 1084 flow [2025-02-08 05:28:05,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 522 places, 521 transitions, 1080 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:28:05,279 INFO L231 Difference]: Finished difference. Result has 522 places, 521 transitions, 1050 flow [2025-02-08 05:28:05,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=520, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1050, PETRI_PLACES=522, PETRI_TRANSITIONS=521} [2025-02-08 05:28:05,281 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -18 predicate places. [2025-02-08 05:28:05,281 INFO L471 AbstractCegarLoop]: Abstraction has has 522 places, 521 transitions, 1050 flow [2025-02-08 05:28:05,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 516.3333333333334) internal successors, (1549), 3 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:05,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:05,282 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:05,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:28:05,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:05,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:05,283 INFO L85 PathProgramCache]: Analyzing trace with hash -755701057, now seen corresponding path program 1 times [2025-02-08 05:28:05,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:05,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654436459] [2025-02-08 05:28:05,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:05,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:05,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 05:28:05,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 05:28:05,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:05,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:05,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:05,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:05,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654436459] [2025-02-08 05:28:05,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654436459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:05,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:05,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:05,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335748897] [2025-02-08 05:28:05,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:05,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:05,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:05,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:05,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:05,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 516 out of 552 [2025-02-08 05:28:05,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 521 transitions, 1050 flow. Second operand has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:05,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:05,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 516 of 552 [2025-02-08 05:28:05,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:05,525 INFO L124 PetriNetUnfolderBase]: 35/925 cut-off events. [2025-02-08 05:28:05,526 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:28:05,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 925 events. 35/925 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2808 event pairs, 24 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 889. Up to 63 conditions per place. [2025-02-08 05:28:05,530 INFO L140 encePairwiseOnDemand]: 549/552 looper letters, 14 selfloop transitions, 2 changer transitions 0/520 dead transitions. [2025-02-08 05:28:05,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 520 transitions, 1080 flow [2025-02-08 05:28:05,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:05,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1565 transitions. [2025-02-08 05:28:05,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9450483091787439 [2025-02-08 05:28:05,533 INFO L175 Difference]: Start difference. First operand has 522 places, 521 transitions, 1050 flow. Second operand 3 states and 1565 transitions. [2025-02-08 05:28:05,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 520 transitions, 1080 flow [2025-02-08 05:28:05,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 520 transitions, 1076 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:28:05,540 INFO L231 Difference]: Finished difference. Result has 521 places, 520 transitions, 1048 flow [2025-02-08 05:28:05,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1048, PETRI_PLACES=521, PETRI_TRANSITIONS=520} [2025-02-08 05:28:05,542 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -19 predicate places. [2025-02-08 05:28:05,542 INFO L471 AbstractCegarLoop]: Abstraction has has 521 places, 520 transitions, 1048 flow [2025-02-08 05:28:05,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:05,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:05,543 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:05,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:28:05,543 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:05,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:05,544 INFO L85 PathProgramCache]: Analyzing trace with hash 187774616, now seen corresponding path program 1 times [2025-02-08 05:28:05,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:05,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267533739] [2025-02-08 05:28:05,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:05,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:05,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:28:05,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:28:05,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:05,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:05,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:05,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267533739] [2025-02-08 05:28:05,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267533739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:05,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:05,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:05,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522184649] [2025-02-08 05:28:05,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:05,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:05,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:05,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:05,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:05,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 516 out of 552 [2025-02-08 05:28:05,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 520 transitions, 1048 flow. Second operand has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:05,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:05,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 516 of 552 [2025-02-08 05:28:05,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:05,734 INFO L124 PetriNetUnfolderBase]: 35/924 cut-off events. [2025-02-08 05:28:05,734 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:28:05,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 924 events. 35/924 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2814 event pairs, 24 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 881. Up to 63 conditions per place. [2025-02-08 05:28:05,738 INFO L140 encePairwiseOnDemand]: 549/552 looper letters, 14 selfloop transitions, 2 changer transitions 0/519 dead transitions. [2025-02-08 05:28:05,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 519 transitions, 1078 flow [2025-02-08 05:28:05,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:05,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:05,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1565 transitions. [2025-02-08 05:28:05,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9450483091787439 [2025-02-08 05:28:05,741 INFO L175 Difference]: Start difference. First operand has 521 places, 520 transitions, 1048 flow. Second operand 3 states and 1565 transitions. [2025-02-08 05:28:05,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 519 transitions, 1078 flow [2025-02-08 05:28:05,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 519 transitions, 1074 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:28:05,747 INFO L231 Difference]: Finished difference. Result has 520 places, 519 transitions, 1046 flow [2025-02-08 05:28:05,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1046, PETRI_PLACES=520, PETRI_TRANSITIONS=519} [2025-02-08 05:28:05,749 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -20 predicate places. [2025-02-08 05:28:05,750 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 519 transitions, 1046 flow [2025-02-08 05:28:05,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:05,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:05,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:05,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:28:05,751 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:05,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:05,752 INFO L85 PathProgramCache]: Analyzing trace with hash -890027848, now seen corresponding path program 1 times [2025-02-08 05:28:05,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:05,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014133224] [2025-02-08 05:28:05,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:05,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:05,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-08 05:28:05,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-08 05:28:05,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:05,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:05,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-02-08 05:28:05,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:05,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014133224] [2025-02-08 05:28:05,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014133224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:05,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:05,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:05,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740255703] [2025-02-08 05:28:05,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:05,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:05,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:05,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:05,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:05,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 516 out of 552 [2025-02-08 05:28:05,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 519 transitions, 1046 flow. Second operand has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:05,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:05,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 516 of 552 [2025-02-08 05:28:05,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:05,928 INFO L124 PetriNetUnfolderBase]: 35/923 cut-off events. [2025-02-08 05:28:05,928 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:28:05,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 923 events. 35/923 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2809 event pairs, 24 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 873. Up to 63 conditions per place. [2025-02-08 05:28:05,931 INFO L140 encePairwiseOnDemand]: 549/552 looper letters, 14 selfloop transitions, 2 changer transitions 0/518 dead transitions. [2025-02-08 05:28:05,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 518 transitions, 1076 flow [2025-02-08 05:28:05,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1565 transitions. [2025-02-08 05:28:05,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9450483091787439 [2025-02-08 05:28:05,934 INFO L175 Difference]: Start difference. First operand has 520 places, 519 transitions, 1046 flow. Second operand 3 states and 1565 transitions. [2025-02-08 05:28:05,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 518 transitions, 1076 flow [2025-02-08 05:28:05,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 518 transitions, 1072 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:28:05,939 INFO L231 Difference]: Finished difference. Result has 519 places, 518 transitions, 1044 flow [2025-02-08 05:28:05,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1044, PETRI_PLACES=519, PETRI_TRANSITIONS=518} [2025-02-08 05:28:05,940 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -21 predicate places. [2025-02-08 05:28:05,941 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 518 transitions, 1044 flow [2025-02-08 05:28:05,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:05,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:05,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:05,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:28:05,942 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:05,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:05,942 INFO L85 PathProgramCache]: Analyzing trace with hash 378447419, now seen corresponding path program 1 times [2025-02-08 05:28:05,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:05,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269074327] [2025-02-08 05:28:05,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:05,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:05,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-08 05:28:05,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-08 05:28:05,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:05,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:06,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:06,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269074327] [2025-02-08 05:28:06,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269074327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:06,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:06,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:06,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931125472] [2025-02-08 05:28:06,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:06,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:06,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:06,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:06,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:06,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 516 out of 552 [2025-02-08 05:28:06,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 518 transitions, 1044 flow. Second operand has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:06,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:06,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 516 of 552 [2025-02-08 05:28:06,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:06,168 INFO L124 PetriNetUnfolderBase]: 35/922 cut-off events. [2025-02-08 05:28:06,169 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:28:06,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 922 events. 35/922 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2799 event pairs, 24 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 865. Up to 63 conditions per place. [2025-02-08 05:28:06,173 INFO L140 encePairwiseOnDemand]: 549/552 looper letters, 14 selfloop transitions, 2 changer transitions 0/517 dead transitions. [2025-02-08 05:28:06,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 517 transitions, 1074 flow [2025-02-08 05:28:06,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:06,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:06,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1565 transitions. [2025-02-08 05:28:06,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9450483091787439 [2025-02-08 05:28:06,176 INFO L175 Difference]: Start difference. First operand has 519 places, 518 transitions, 1044 flow. Second operand 3 states and 1565 transitions. [2025-02-08 05:28:06,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 517 transitions, 1074 flow [2025-02-08 05:28:06,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 517 transitions, 1070 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:28:06,183 INFO L231 Difference]: Finished difference. Result has 518 places, 517 transitions, 1042 flow [2025-02-08 05:28:06,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1042, PETRI_PLACES=518, PETRI_TRANSITIONS=517} [2025-02-08 05:28:06,183 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -22 predicate places. [2025-02-08 05:28:06,184 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 517 transitions, 1042 flow [2025-02-08 05:28:06,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:06,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:06,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:06,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:28:06,185 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:06,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:06,186 INFO L85 PathProgramCache]: Analyzing trace with hash 773752228, now seen corresponding path program 1 times [2025-02-08 05:28:06,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:06,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347046827] [2025-02-08 05:28:06,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:06,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:06,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-08 05:28:06,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-08 05:28:06,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:06,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:06,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:06,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347046827] [2025-02-08 05:28:06,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347046827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:06,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:06,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:06,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093210039] [2025-02-08 05:28:06,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:06,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:06,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:06,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:06,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:06,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 516 out of 552 [2025-02-08 05:28:06,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 517 transitions, 1042 flow. Second operand has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:06,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:06,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 516 of 552 [2025-02-08 05:28:06,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:06,412 INFO L124 PetriNetUnfolderBase]: 35/921 cut-off events. [2025-02-08 05:28:06,412 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:28:06,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 921 events. 35/921 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2772 event pairs, 24 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 857. Up to 63 conditions per place. [2025-02-08 05:28:06,417 INFO L140 encePairwiseOnDemand]: 549/552 looper letters, 14 selfloop transitions, 2 changer transitions 0/516 dead transitions. [2025-02-08 05:28:06,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 516 transitions, 1072 flow [2025-02-08 05:28:06,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:06,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:06,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1565 transitions. [2025-02-08 05:28:06,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9450483091787439 [2025-02-08 05:28:06,421 INFO L175 Difference]: Start difference. First operand has 518 places, 517 transitions, 1042 flow. Second operand 3 states and 1565 transitions. [2025-02-08 05:28:06,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 516 transitions, 1072 flow [2025-02-08 05:28:06,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 516 transitions, 1068 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:28:06,427 INFO L231 Difference]: Finished difference. Result has 517 places, 516 transitions, 1040 flow [2025-02-08 05:28:06,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1040, PETRI_PLACES=517, PETRI_TRANSITIONS=516} [2025-02-08 05:28:06,429 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -23 predicate places. [2025-02-08 05:28:06,429 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 516 transitions, 1040 flow [2025-02-08 05:28:06,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:06,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:06,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:06,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:28:06,431 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:06,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:06,434 INFO L85 PathProgramCache]: Analyzing trace with hash 901454279, now seen corresponding path program 1 times [2025-02-08 05:28:06,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:06,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835100065] [2025-02-08 05:28:06,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:06,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:06,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-08 05:28:06,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-08 05:28:06,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:06,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:06,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:06,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835100065] [2025-02-08 05:28:06,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835100065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:06,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:06,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:06,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356867277] [2025-02-08 05:28:06,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:06,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:06,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:06,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:06,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:06,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 516 out of 552 [2025-02-08 05:28:06,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 516 transitions, 1040 flow. Second operand has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:06,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:06,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 516 of 552 [2025-02-08 05:28:06,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:06,653 INFO L124 PetriNetUnfolderBase]: 35/920 cut-off events. [2025-02-08 05:28:06,653 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:28:06,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 920 events. 35/920 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2763 event pairs, 24 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 849. Up to 63 conditions per place. [2025-02-08 05:28:06,656 INFO L140 encePairwiseOnDemand]: 549/552 looper letters, 14 selfloop transitions, 2 changer transitions 0/515 dead transitions. [2025-02-08 05:28:06,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 515 transitions, 1070 flow [2025-02-08 05:28:06,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:06,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:06,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1565 transitions. [2025-02-08 05:28:06,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9450483091787439 [2025-02-08 05:28:06,659 INFO L175 Difference]: Start difference. First operand has 517 places, 516 transitions, 1040 flow. Second operand 3 states and 1565 transitions. [2025-02-08 05:28:06,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 515 transitions, 1070 flow [2025-02-08 05:28:06,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 515 transitions, 1066 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:28:06,665 INFO L231 Difference]: Finished difference. Result has 516 places, 515 transitions, 1038 flow [2025-02-08 05:28:06,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1038, PETRI_PLACES=516, PETRI_TRANSITIONS=515} [2025-02-08 05:28:06,666 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -24 predicate places. [2025-02-08 05:28:06,666 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 515 transitions, 1038 flow [2025-02-08 05:28:06,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:06,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:06,667 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:06,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:28:06,668 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:06,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:06,668 INFO L85 PathProgramCache]: Analyzing trace with hash -43475234, now seen corresponding path program 1 times [2025-02-08 05:28:06,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:06,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590103390] [2025-02-08 05:28:06,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:06,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:06,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-08 05:28:06,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-08 05:28:06,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:06,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:06,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:06,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:06,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590103390] [2025-02-08 05:28:06,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590103390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:06,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:06,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:06,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087477550] [2025-02-08 05:28:06,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:06,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:06,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:06,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:06,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:06,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 516 out of 552 [2025-02-08 05:28:06,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 515 transitions, 1038 flow. Second operand has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:06,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:06,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 516 of 552 [2025-02-08 05:28:06,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:06,845 INFO L124 PetriNetUnfolderBase]: 35/919 cut-off events. [2025-02-08 05:28:06,845 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:28:06,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 999 conditions, 919 events. 35/919 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2760 event pairs, 24 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 841. Up to 63 conditions per place. [2025-02-08 05:28:06,849 INFO L140 encePairwiseOnDemand]: 549/552 looper letters, 14 selfloop transitions, 2 changer transitions 0/514 dead transitions. [2025-02-08 05:28:06,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 514 transitions, 1068 flow [2025-02-08 05:28:06,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1565 transitions. [2025-02-08 05:28:06,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9450483091787439 [2025-02-08 05:28:06,852 INFO L175 Difference]: Start difference. First operand has 516 places, 515 transitions, 1038 flow. Second operand 3 states and 1565 transitions. [2025-02-08 05:28:06,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 514 transitions, 1068 flow [2025-02-08 05:28:06,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 514 transitions, 1064 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:28:06,857 INFO L231 Difference]: Finished difference. Result has 515 places, 514 transitions, 1036 flow [2025-02-08 05:28:06,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=515, PETRI_TRANSITIONS=514} [2025-02-08 05:28:06,858 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -25 predicate places. [2025-02-08 05:28:06,858 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 514 transitions, 1036 flow [2025-02-08 05:28:06,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:06,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:06,859 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:06,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:28:06,859 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:06,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:06,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1478738114, now seen corresponding path program 1 times [2025-02-08 05:28:06,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:06,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925792127] [2025-02-08 05:28:06,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:06,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:06,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 05:28:06,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 05:28:06,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:06,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:06,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:06,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925792127] [2025-02-08 05:28:06,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925792127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:06,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:06,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922714293] [2025-02-08 05:28:06,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:06,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:06,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:06,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:06,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:06,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 552 [2025-02-08 05:28:06,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 514 transitions, 1036 flow. Second operand has 3 states, 3 states have (on average 515.3333333333334) internal successors, (1546), 3 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:06,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:06,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 552 [2025-02-08 05:28:06,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:07,063 INFO L124 PetriNetUnfolderBase]: 50/1105 cut-off events. [2025-02-08 05:28:07,063 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:28:07,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 1105 events. 50/1105 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4118 event pairs, 35 based on Foata normal form. 0/1006 useless extension candidates. Maximal degree in co-relation 1046. Up to 87 conditions per place. [2025-02-08 05:28:07,068 INFO L140 encePairwiseOnDemand]: 549/552 looper letters, 16 selfloop transitions, 2 changer transitions 0/513 dead transitions. [2025-02-08 05:28:07,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 513 transitions, 1070 flow [2025-02-08 05:28:07,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:07,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:07,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1561 transitions. [2025-02-08 05:28:07,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9426328502415459 [2025-02-08 05:28:07,070 INFO L175 Difference]: Start difference. First operand has 515 places, 514 transitions, 1036 flow. Second operand 3 states and 1561 transitions. [2025-02-08 05:28:07,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 513 transitions, 1070 flow [2025-02-08 05:28:07,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 513 transitions, 1066 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:28:07,076 INFO L231 Difference]: Finished difference. Result has 514 places, 513 transitions, 1034 flow [2025-02-08 05:28:07,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1034, PETRI_PLACES=514, PETRI_TRANSITIONS=513} [2025-02-08 05:28:07,077 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -26 predicate places. [2025-02-08 05:28:07,077 INFO L471 AbstractCegarLoop]: Abstraction has has 514 places, 513 transitions, 1034 flow [2025-02-08 05:28:07,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 515.3333333333334) internal successors, (1546), 3 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:07,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:07,078 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:07,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:28:07,078 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:07,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:07,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1192393461, now seen corresponding path program 1 times [2025-02-08 05:28:07,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:07,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145800289] [2025-02-08 05:28:07,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:07,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:07,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 05:28:07,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 05:28:07,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:07,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:07,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:07,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145800289] [2025-02-08 05:28:07,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145800289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:07,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:07,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:07,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531087505] [2025-02-08 05:28:07,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:07,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:07,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:07,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:07,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:07,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 516 out of 552 [2025-02-08 05:28:07,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 513 transitions, 1034 flow. Second operand has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:07,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:07,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 516 of 552 [2025-02-08 05:28:07,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:07,249 INFO L124 PetriNetUnfolderBase]: 35/917 cut-off events. [2025-02-08 05:28:07,249 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:28:07,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 917 events. 35/917 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2791 event pairs, 24 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 825. Up to 63 conditions per place. [2025-02-08 05:28:07,252 INFO L140 encePairwiseOnDemand]: 549/552 looper letters, 14 selfloop transitions, 2 changer transitions 0/512 dead transitions. [2025-02-08 05:28:07,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 512 transitions, 1064 flow [2025-02-08 05:28:07,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1565 transitions. [2025-02-08 05:28:07,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9450483091787439 [2025-02-08 05:28:07,254 INFO L175 Difference]: Start difference. First operand has 514 places, 513 transitions, 1034 flow. Second operand 3 states and 1565 transitions. [2025-02-08 05:28:07,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 512 transitions, 1064 flow [2025-02-08 05:28:07,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 512 transitions, 1060 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:28:07,260 INFO L231 Difference]: Finished difference. Result has 513 places, 512 transitions, 1032 flow [2025-02-08 05:28:07,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1032, PETRI_PLACES=513, PETRI_TRANSITIONS=512} [2025-02-08 05:28:07,261 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -27 predicate places. [2025-02-08 05:28:07,261 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 512 transitions, 1032 flow [2025-02-08 05:28:07,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:07,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:07,262 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:07,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:28:07,262 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:07,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:07,263 INFO L85 PathProgramCache]: Analyzing trace with hash 284725738, now seen corresponding path program 1 times [2025-02-08 05:28:07,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:07,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572304696] [2025-02-08 05:28:07,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:07,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:07,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-08 05:28:07,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-08 05:28:07,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:07,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:07,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:07,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572304696] [2025-02-08 05:28:07,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572304696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:07,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:07,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:07,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075372517] [2025-02-08 05:28:07,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:07,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:07,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:07,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:07,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:07,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 516 out of 552 [2025-02-08 05:28:07,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 512 transitions, 1032 flow. Second operand has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:07,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:07,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 516 of 552 [2025-02-08 05:28:07,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:07,446 INFO L124 PetriNetUnfolderBase]: 35/916 cut-off events. [2025-02-08 05:28:07,446 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:28:07,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 916 events. 35/916 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2790 event pairs, 24 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 817. Up to 63 conditions per place. [2025-02-08 05:28:07,451 INFO L140 encePairwiseOnDemand]: 549/552 looper letters, 14 selfloop transitions, 2 changer transitions 0/511 dead transitions. [2025-02-08 05:28:07,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 511 transitions, 1062 flow [2025-02-08 05:28:07,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1565 transitions. [2025-02-08 05:28:07,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9450483091787439 [2025-02-08 05:28:07,454 INFO L175 Difference]: Start difference. First operand has 513 places, 512 transitions, 1032 flow. Second operand 3 states and 1565 transitions. [2025-02-08 05:28:07,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 511 transitions, 1062 flow [2025-02-08 05:28:07,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 511 transitions, 1058 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:28:07,460 INFO L231 Difference]: Finished difference. Result has 512 places, 511 transitions, 1030 flow [2025-02-08 05:28:07,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1030, PETRI_PLACES=512, PETRI_TRANSITIONS=511} [2025-02-08 05:28:07,461 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -28 predicate places. [2025-02-08 05:28:07,461 INFO L471 AbstractCegarLoop]: Abstraction has has 512 places, 511 transitions, 1030 flow [2025-02-08 05:28:07,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:07,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:07,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:07,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:28:07,463 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:07,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:07,463 INFO L85 PathProgramCache]: Analyzing trace with hash -578176634, now seen corresponding path program 1 times [2025-02-08 05:28:07,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:07,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285073608] [2025-02-08 05:28:07,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:07,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:07,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 05:28:07,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 05:28:07,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:07,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:07,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:07,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285073608] [2025-02-08 05:28:07,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285073608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:07,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:07,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:07,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473419666] [2025-02-08 05:28:07,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:07,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:07,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:07,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:07,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:07,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 516 out of 552 [2025-02-08 05:28:07,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 511 transitions, 1030 flow. Second operand has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:07,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:07,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 516 of 552 [2025-02-08 05:28:07,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:07,635 INFO L124 PetriNetUnfolderBase]: 35/915 cut-off events. [2025-02-08 05:28:07,636 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:28:07,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 915 events. 35/915 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2788 event pairs, 24 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 809. Up to 63 conditions per place. [2025-02-08 05:28:07,639 INFO L140 encePairwiseOnDemand]: 549/552 looper letters, 14 selfloop transitions, 2 changer transitions 0/510 dead transitions. [2025-02-08 05:28:07,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 510 transitions, 1060 flow [2025-02-08 05:28:07,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:07,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:07,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1565 transitions. [2025-02-08 05:28:07,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9450483091787439 [2025-02-08 05:28:07,642 INFO L175 Difference]: Start difference. First operand has 512 places, 511 transitions, 1030 flow. Second operand 3 states and 1565 transitions. [2025-02-08 05:28:07,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 513 places, 510 transitions, 1060 flow [2025-02-08 05:28:07,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 510 transitions, 1056 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:28:07,681 INFO L231 Difference]: Finished difference. Result has 511 places, 510 transitions, 1028 flow [2025-02-08 05:28:07,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1028, PETRI_PLACES=511, PETRI_TRANSITIONS=510} [2025-02-08 05:28:07,682 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -29 predicate places. [2025-02-08 05:28:07,682 INFO L471 AbstractCegarLoop]: Abstraction has has 511 places, 510 transitions, 1028 flow [2025-02-08 05:28:07,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:07,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:07,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:07,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:28:07,683 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:07,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:07,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2125266423, now seen corresponding path program 1 times [2025-02-08 05:28:07,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:07,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43099192] [2025-02-08 05:28:07,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:07,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:07,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-08 05:28:07,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-08 05:28:07,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:07,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:07,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:07,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:07,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43099192] [2025-02-08 05:28:07,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43099192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:07,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:07,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:07,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071262912] [2025-02-08 05:28:07,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:07,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:07,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:07,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:07,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:07,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 516 out of 552 [2025-02-08 05:28:07,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 510 transitions, 1028 flow. Second operand has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:07,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:07,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 516 of 552 [2025-02-08 05:28:07,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:07,901 INFO L124 PetriNetUnfolderBase]: 35/914 cut-off events. [2025-02-08 05:28:07,901 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:28:07,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 914 events. 35/914 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2785 event pairs, 24 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 801. Up to 63 conditions per place. [2025-02-08 05:28:07,905 INFO L140 encePairwiseOnDemand]: 549/552 looper letters, 14 selfloop transitions, 2 changer transitions 0/509 dead transitions. [2025-02-08 05:28:07,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 509 transitions, 1058 flow [2025-02-08 05:28:07,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:07,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:07,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1565 transitions. [2025-02-08 05:28:07,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9450483091787439 [2025-02-08 05:28:07,908 INFO L175 Difference]: Start difference. First operand has 511 places, 510 transitions, 1028 flow. Second operand 3 states and 1565 transitions. [2025-02-08 05:28:07,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 509 transitions, 1058 flow [2025-02-08 05:28:07,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 510 places, 509 transitions, 1054 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:28:07,914 INFO L231 Difference]: Finished difference. Result has 510 places, 509 transitions, 1026 flow [2025-02-08 05:28:07,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1026, PETRI_PLACES=510, PETRI_TRANSITIONS=509} [2025-02-08 05:28:07,914 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -30 predicate places. [2025-02-08 05:28:07,914 INFO L471 AbstractCegarLoop]: Abstraction has has 510 places, 509 transitions, 1026 flow [2025-02-08 05:28:07,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:07,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:07,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:07,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:28:07,916 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:07,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:07,917 INFO L85 PathProgramCache]: Analyzing trace with hash -651695607, now seen corresponding path program 1 times [2025-02-08 05:28:07,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:07,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864798347] [2025-02-08 05:28:07,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:07,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:07,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-08 05:28:07,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-08 05:28:07,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:07,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:07,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:07,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:07,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864798347] [2025-02-08 05:28:07,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864798347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:07,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:07,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:07,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335097494] [2025-02-08 05:28:07,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:07,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:07,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:07,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:07,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:08,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 513 out of 552 [2025-02-08 05:28:08,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 509 transitions, 1026 flow. Second operand has 3 states, 3 states have (on average 514.3333333333334) internal successors, (1543), 3 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:08,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:08,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 513 of 552 [2025-02-08 05:28:08,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:08,125 INFO L124 PetriNetUnfolderBase]: 48/1033 cut-off events. [2025-02-08 05:28:08,125 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:28:08,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 1033 events. 48/1033 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3618 event pairs, 35 based on Foata normal form. 0/942 useless extension candidates. Maximal degree in co-relation 940. Up to 88 conditions per place. [2025-02-08 05:28:08,130 INFO L140 encePairwiseOnDemand]: 549/552 looper letters, 17 selfloop transitions, 2 changer transitions 0/508 dead transitions. [2025-02-08 05:28:08,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 508 transitions, 1062 flow [2025-02-08 05:28:08,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:08,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1559 transitions. [2025-02-08 05:28:08,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414251207729468 [2025-02-08 05:28:08,132 INFO L175 Difference]: Start difference. First operand has 510 places, 509 transitions, 1026 flow. Second operand 3 states and 1559 transitions. [2025-02-08 05:28:08,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 508 transitions, 1062 flow [2025-02-08 05:28:08,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 509 places, 508 transitions, 1058 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:28:08,138 INFO L231 Difference]: Finished difference. Result has 509 places, 508 transitions, 1024 flow [2025-02-08 05:28:08,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=507, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=508, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1024, PETRI_PLACES=509, PETRI_TRANSITIONS=508} [2025-02-08 05:28:08,138 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -31 predicate places. [2025-02-08 05:28:08,139 INFO L471 AbstractCegarLoop]: Abstraction has has 509 places, 508 transitions, 1024 flow [2025-02-08 05:28:08,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 514.3333333333334) internal successors, (1543), 3 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:08,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:08,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:08,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:28:08,140 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:08,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:08,141 INFO L85 PathProgramCache]: Analyzing trace with hash -781274370, now seen corresponding path program 1 times [2025-02-08 05:28:08,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:08,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58523919] [2025-02-08 05:28:08,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:08,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:08,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-08 05:28:08,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-08 05:28:08,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:08,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:08,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:08,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:08,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58523919] [2025-02-08 05:28:08,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58523919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:08,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:08,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:08,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056620053] [2025-02-08 05:28:08,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:08,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:08,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:08,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:08,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:08,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 513 out of 552 [2025-02-08 05:28:08,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 508 transitions, 1024 flow. Second operand has 3 states, 3 states have (on average 514.0) internal successors, (1542), 3 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:08,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:08,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 513 of 552 [2025-02-08 05:28:08,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:08,333 INFO L124 PetriNetUnfolderBase]: 67/1217 cut-off events. [2025-02-08 05:28:08,333 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:28:08,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 1217 events. 67/1217 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5058 event pairs, 48 based on Foata normal form. 0/1120 useless extension candidates. Maximal degree in co-relation 1144. Up to 113 conditions per place. [2025-02-08 05:28:08,338 INFO L140 encePairwiseOnDemand]: 548/552 looper letters, 17 selfloop transitions, 1 changer transitions 0/505 dead transitions. [2025-02-08 05:28:08,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 505 transitions, 1054 flow [2025-02-08 05:28:08,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1560 transitions. [2025-02-08 05:28:08,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9420289855072463 [2025-02-08 05:28:08,341 INFO L175 Difference]: Start difference. First operand has 509 places, 508 transitions, 1024 flow. Second operand 3 states and 1560 transitions. [2025-02-08 05:28:08,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 508 places, 505 transitions, 1054 flow [2025-02-08 05:28:08,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 505 transitions, 1050 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:28:08,346 INFO L231 Difference]: Finished difference. Result has 506 places, 505 transitions, 1016 flow [2025-02-08 05:28:08,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1016, PETRI_PLACES=506, PETRI_TRANSITIONS=505} [2025-02-08 05:28:08,347 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -34 predicate places. [2025-02-08 05:28:08,347 INFO L471 AbstractCegarLoop]: Abstraction has has 506 places, 505 transitions, 1016 flow [2025-02-08 05:28:08,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 514.0) internal successors, (1542), 3 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:08,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:08,348 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:08,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:28:08,348 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:08,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:08,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1081673153, now seen corresponding path program 1 times [2025-02-08 05:28:08,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:08,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806284584] [2025-02-08 05:28:08,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:08,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:08,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:28:08,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:28:08,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:08,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:10,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:10,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806284584] [2025-02-08 05:28:10,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806284584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:10,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:10,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:28:10,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240451705] [2025-02-08 05:28:10,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:10,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:28:10,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:10,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:28:10,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:28:10,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 552 [2025-02-08 05:28:10,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 505 transitions, 1016 flow. Second operand has 10 states, 10 states have (on average 508.3) internal successors, (5083), 10 states have internal predecessors, (5083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:10,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:10,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 552 [2025-02-08 05:28:10,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:10,296 INFO L124 PetriNetUnfolderBase]: 35/906 cut-off events. [2025-02-08 05:28:10,297 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:28:10,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 906 events. 35/906 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2787 event pairs, 24 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 785. Up to 65 conditions per place. [2025-02-08 05:28:10,304 INFO L140 encePairwiseOnDemand]: 542/552 looper letters, 16 selfloop transitions, 9 changer transitions 0/504 dead transitions. [2025-02-08 05:28:10,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 504 transitions, 1064 flow [2025-02-08 05:28:10,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:28:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:28:10,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5096 transitions. [2025-02-08 05:28:10,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9231884057971015 [2025-02-08 05:28:10,312 INFO L175 Difference]: Start difference. First operand has 506 places, 505 transitions, 1016 flow. Second operand 10 states and 5096 transitions. [2025-02-08 05:28:10,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 504 transitions, 1064 flow [2025-02-08 05:28:10,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 504 transitions, 1063 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:28:10,318 INFO L231 Difference]: Finished difference. Result has 513 places, 504 transitions, 1031 flow [2025-02-08 05:28:10,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1031, PETRI_PLACES=513, PETRI_TRANSITIONS=504} [2025-02-08 05:28:10,318 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -27 predicate places. [2025-02-08 05:28:10,318 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 504 transitions, 1031 flow [2025-02-08 05:28:10,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 508.3) internal successors, (5083), 10 states have internal predecessors, (5083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:10,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:10,323 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:10,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:28:10,323 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:10,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:10,324 INFO L85 PathProgramCache]: Analyzing trace with hash -614625828, now seen corresponding path program 1 times [2025-02-08 05:28:10,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:10,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986194640] [2025-02-08 05:28:10,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:10,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:10,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-08 05:28:10,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-08 05:28:10,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:10,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:10,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:10,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:10,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986194640] [2025-02-08 05:28:10,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986194640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:10,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:10,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:10,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642662219] [2025-02-08 05:28:10,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:10,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:10,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:10,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:10,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:10,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 513 out of 552 [2025-02-08 05:28:10,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 504 transitions, 1031 flow. Second operand has 3 states, 3 states have (on average 514.3333333333334) internal successors, (1543), 3 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:10,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:10,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 513 of 552 [2025-02-08 05:28:10,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:10,538 INFO L124 PetriNetUnfolderBase]: 48/1024 cut-off events. [2025-02-08 05:28:10,538 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:28:10,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1139 conditions, 1024 events. 48/1024 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3596 event pairs, 35 based on Foata normal form. 0/943 useless extension candidates. Maximal degree in co-relation 932. Up to 88 conditions per place. [2025-02-08 05:28:10,543 INFO L140 encePairwiseOnDemand]: 549/552 looper letters, 17 selfloop transitions, 2 changer transitions 0/503 dead transitions. [2025-02-08 05:28:10,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 503 transitions, 1067 flow [2025-02-08 05:28:10,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:10,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:10,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1559 transitions. [2025-02-08 05:28:10,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414251207729468 [2025-02-08 05:28:10,546 INFO L175 Difference]: Start difference. First operand has 513 places, 504 transitions, 1031 flow. Second operand 3 states and 1559 transitions. [2025-02-08 05:28:10,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 503 transitions, 1067 flow [2025-02-08 05:28:10,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 505 places, 503 transitions, 1049 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-02-08 05:28:10,551 INFO L231 Difference]: Finished difference. Result has 505 places, 503 transitions, 1015 flow [2025-02-08 05:28:10,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=503, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1015, PETRI_PLACES=505, PETRI_TRANSITIONS=503} [2025-02-08 05:28:10,552 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -35 predicate places. [2025-02-08 05:28:10,552 INFO L471 AbstractCegarLoop]: Abstraction has has 505 places, 503 transitions, 1015 flow [2025-02-08 05:28:10,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 514.3333333333334) internal successors, (1543), 3 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:10,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:10,553 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:10,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:28:10,553 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:10,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:10,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1241246110, now seen corresponding path program 1 times [2025-02-08 05:28:10,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:10,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991166789] [2025-02-08 05:28:10,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:10,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:10,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-08 05:28:10,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-08 05:28:10,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:10,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:10,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:28:10,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:10,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991166789] [2025-02-08 05:28:10,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991166789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:10,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:10,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:10,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433404110] [2025-02-08 05:28:10,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:10,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:10,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:10,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:10,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:10,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 513 out of 552 [2025-02-08 05:28:10,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 503 transitions, 1015 flow. Second operand has 3 states, 3 states have (on average 514.0) internal successors, (1542), 3 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:10,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:10,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 513 of 552 [2025-02-08 05:28:10,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:10,758 INFO L124 PetriNetUnfolderBase]: 67/1223 cut-off events. [2025-02-08 05:28:10,759 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:28:10,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 1223 events. 67/1223 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5090 event pairs, 48 based on Foata normal form. 0/1133 useless extension candidates. Maximal degree in co-relation 1152. Up to 113 conditions per place. [2025-02-08 05:28:10,763 INFO L140 encePairwiseOnDemand]: 548/552 looper letters, 17 selfloop transitions, 1 changer transitions 0/500 dead transitions. [2025-02-08 05:28:10,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 500 transitions, 1045 flow [2025-02-08 05:28:10,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1560 transitions. [2025-02-08 05:28:10,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9420289855072463 [2025-02-08 05:28:10,766 INFO L175 Difference]: Start difference. First operand has 505 places, 503 transitions, 1015 flow. Second operand 3 states and 1560 transitions. [2025-02-08 05:28:10,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 504 places, 500 transitions, 1045 flow [2025-02-08 05:28:10,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 500 transitions, 1041 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:28:10,772 INFO L231 Difference]: Finished difference. Result has 502 places, 500 transitions, 1007 flow [2025-02-08 05:28:10,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=500, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1007, PETRI_PLACES=502, PETRI_TRANSITIONS=500} [2025-02-08 05:28:10,772 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -38 predicate places. [2025-02-08 05:28:10,772 INFO L471 AbstractCegarLoop]: Abstraction has has 502 places, 500 transitions, 1007 flow [2025-02-08 05:28:10,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 514.0) internal successors, (1542), 3 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:10,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:10,773 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:10,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:28:10,773 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:10,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:10,774 INFO L85 PathProgramCache]: Analyzing trace with hash 584922130, now seen corresponding path program 1 times [2025-02-08 05:28:10,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:10,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968449145] [2025-02-08 05:28:10,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:10,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:10,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-08 05:28:10,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-08 05:28:10,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:10,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:28:10,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:10,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968449145] [2025-02-08 05:28:10,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968449145] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:10,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:10,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:10,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380637460] [2025-02-08 05:28:10,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:10,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:10,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:10,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:10,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:10,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 520 out of 552 [2025-02-08 05:28:10,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 500 transitions, 1007 flow. Second operand has 3 states, 3 states have (on average 520.6666666666666) internal successors, (1562), 3 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:10,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:10,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 520 of 552 [2025-02-08 05:28:10,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:10,970 INFO L124 PetriNetUnfolderBase]: 35/898 cut-off events. [2025-02-08 05:28:10,970 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:28:10,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 898 events. 35/898 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2726 event pairs, 24 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 769. Up to 61 conditions per place. [2025-02-08 05:28:10,974 INFO L140 encePairwiseOnDemand]: 550/552 looper letters, 12 selfloop transitions, 1 changer transitions 0/499 dead transitions. [2025-02-08 05:28:10,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 499 transitions, 1031 flow [2025-02-08 05:28:10,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1574 transitions. [2025-02-08 05:28:10,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9504830917874396 [2025-02-08 05:28:10,976 INFO L175 Difference]: Start difference. First operand has 502 places, 500 transitions, 1007 flow. Second operand 3 states and 1574 transitions. [2025-02-08 05:28:10,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 503 places, 499 transitions, 1031 flow [2025-02-08 05:28:10,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 499 transitions, 1030 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:28:10,982 INFO L231 Difference]: Finished difference. Result has 502 places, 499 transitions, 1006 flow [2025-02-08 05:28:10,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=500, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1006, PETRI_PLACES=502, PETRI_TRANSITIONS=499} [2025-02-08 05:28:10,982 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -38 predicate places. [2025-02-08 05:28:10,983 INFO L471 AbstractCegarLoop]: Abstraction has has 502 places, 499 transitions, 1006 flow [2025-02-08 05:28:10,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 520.6666666666666) internal successors, (1562), 3 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:10,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:10,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:10,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:28:10,984 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:10,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:10,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1933292526, now seen corresponding path program 1 times [2025-02-08 05:28:10,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:10,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488706755] [2025-02-08 05:28:10,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:10,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:11,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-02-08 05:28:11,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-02-08 05:28:11,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:11,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:28:11,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:11,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488706755] [2025-02-08 05:28:11,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488706755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:11,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:11,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:11,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557813103] [2025-02-08 05:28:11,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:11,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:11,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:11,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:11,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:11,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 510 out of 552 [2025-02-08 05:28:11,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 499 transitions, 1006 flow. Second operand has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:11,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:11,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 510 of 552 [2025-02-08 05:28:11,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:11,229 INFO L124 PetriNetUnfolderBase]: 61/1021 cut-off events. [2025-02-08 05:28:11,230 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:28:11,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 1021 events. 61/1021 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3979 event pairs, 48 based on Foata normal form. 0/934 useless extension candidates. Maximal degree in co-relation 955. Up to 118 conditions per place. [2025-02-08 05:28:11,234 INFO L140 encePairwiseOnDemand]: 549/552 looper letters, 21 selfloop transitions, 2 changer transitions 0/498 dead transitions. [2025-02-08 05:28:11,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 498 transitions, 1050 flow [2025-02-08 05:28:11,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1554 transitions. [2025-02-08 05:28:11,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9384057971014492 [2025-02-08 05:28:11,237 INFO L175 Difference]: Start difference. First operand has 502 places, 499 transitions, 1006 flow. Second operand 3 states and 1554 transitions. [2025-02-08 05:28:11,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 503 places, 498 transitions, 1050 flow [2025-02-08 05:28:11,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 498 transitions, 1049 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:28:11,242 INFO L231 Difference]: Finished difference. Result has 502 places, 498 transitions, 1007 flow [2025-02-08 05:28:11,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1003, PETRI_DIFFERENCE_MINUEND_PLACES=500, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1007, PETRI_PLACES=502, PETRI_TRANSITIONS=498} [2025-02-08 05:28:11,243 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -38 predicate places. [2025-02-08 05:28:11,243 INFO L471 AbstractCegarLoop]: Abstraction has has 502 places, 498 transitions, 1007 flow [2025-02-08 05:28:11,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:11,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:11,243 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:11,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:28:11,244 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:11,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:11,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1134874139, now seen corresponding path program 1 times [2025-02-08 05:28:11,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:11,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542884551] [2025-02-08 05:28:11,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:11,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:11,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-02-08 05:28:11,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-02-08 05:28:11,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:11,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:11,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:28:11,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:11,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542884551] [2025-02-08 05:28:11,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542884551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:11,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:11,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:11,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603203499] [2025-02-08 05:28:11,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:11,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:11,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:11,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:11,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:11,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 506 out of 552 [2025-02-08 05:28:11,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 498 transitions, 1007 flow. Second operand has 3 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:11,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:11,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 506 of 552 [2025-02-08 05:28:11,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:11,491 INFO L124 PetriNetUnfolderBase]: 110/1398 cut-off events. [2025-02-08 05:28:11,491 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:28:11,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 1398 events. 110/1398 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6874 event pairs, 82 based on Foata normal form. 0/1299 useless extension candidates. Maximal degree in co-relation 1430. Up to 196 conditions per place. [2025-02-08 05:28:11,496 INFO L140 encePairwiseOnDemand]: 543/552 looper letters, 25 selfloop transitions, 4 changer transitions 0/499 dead transitions. [2025-02-08 05:28:11,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 499 transitions, 1070 flow [2025-02-08 05:28:11,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:11,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1552 transitions. [2025-02-08 05:28:11,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371980676328503 [2025-02-08 05:28:11,500 INFO L175 Difference]: Start difference. First operand has 502 places, 498 transitions, 1007 flow. Second operand 3 states and 1552 transitions. [2025-02-08 05:28:11,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 499 transitions, 1070 flow [2025-02-08 05:28:11,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 499 transitions, 1066 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:28:11,509 INFO L231 Difference]: Finished difference. Result has 498 places, 495 transitions, 1013 flow [2025-02-08 05:28:11,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1013, PETRI_PLACES=498, PETRI_TRANSITIONS=495} [2025-02-08 05:28:11,510 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -42 predicate places. [2025-02-08 05:28:11,510 INFO L471 AbstractCegarLoop]: Abstraction has has 498 places, 495 transitions, 1013 flow [2025-02-08 05:28:11,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:11,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:11,511 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:11,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:28:11,511 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:11,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:11,512 INFO L85 PathProgramCache]: Analyzing trace with hash 602807089, now seen corresponding path program 1 times [2025-02-08 05:28:11,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:11,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105416327] [2025-02-08 05:28:11,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:11,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:11,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-02-08 05:28:11,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-02-08 05:28:11,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:11,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:28:11,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:11,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105416327] [2025-02-08 05:28:11,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105416327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:11,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:11,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:11,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498734902] [2025-02-08 05:28:11,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:11,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:11,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:11,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:11,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:11,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 511 out of 552 [2025-02-08 05:28:11,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 495 transitions, 1013 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:11,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:11,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 511 of 552 [2025-02-08 05:28:11,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:11,737 INFO L124 PetriNetUnfolderBase]: 67/1161 cut-off events. [2025-02-08 05:28:11,737 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:28:11,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 1161 events. 67/1161 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4735 event pairs, 50 based on Foata normal form. 0/1084 useless extension candidates. Maximal degree in co-relation 1142. Up to 131 conditions per place. [2025-02-08 05:28:11,742 INFO L140 encePairwiseOnDemand]: 549/552 looper letters, 23 selfloop transitions, 2 changer transitions 0/495 dead transitions. [2025-02-08 05:28:11,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 495 transitions, 1063 flow [2025-02-08 05:28:11,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1557 transitions. [2025-02-08 05:28:11,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9402173913043478 [2025-02-08 05:28:11,745 INFO L175 Difference]: Start difference. First operand has 498 places, 495 transitions, 1013 flow. Second operand 3 states and 1557 transitions. [2025-02-08 05:28:11,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 495 transitions, 1063 flow [2025-02-08 05:28:11,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 498 places, 495 transitions, 1059 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:28:11,750 INFO L231 Difference]: Finished difference. Result has 499 places, 495 transitions, 1017 flow [2025-02-08 05:28:11,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1017, PETRI_PLACES=499, PETRI_TRANSITIONS=495} [2025-02-08 05:28:11,751 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -41 predicate places. [2025-02-08 05:28:11,751 INFO L471 AbstractCegarLoop]: Abstraction has has 499 places, 495 transitions, 1017 flow [2025-02-08 05:28:11,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:11,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:11,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:11,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:28:11,752 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:11,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:11,753 INFO L85 PathProgramCache]: Analyzing trace with hash -734142702, now seen corresponding path program 1 times [2025-02-08 05:28:11,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:11,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911681540] [2025-02-08 05:28:11,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:11,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:11,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-08 05:28:11,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-08 05:28:11,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:11,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:28:11,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:11,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911681540] [2025-02-08 05:28:11,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911681540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:11,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:11,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:11,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386304858] [2025-02-08 05:28:11,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:11,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:11,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:11,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:11,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:11,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 519 out of 552 [2025-02-08 05:28:11,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 495 transitions, 1017 flow. Second operand has 3 states, 3 states have (on average 520.3333333333334) internal successors, (1561), 3 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:11,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:11,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 519 of 552 [2025-02-08 05:28:11,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:11,962 INFO L124 PetriNetUnfolderBase]: 60/1174 cut-off events. [2025-02-08 05:28:11,962 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:28:11,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 1174 events. 60/1174 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4681 event pairs, 1 based on Foata normal form. 0/1112 useless extension candidates. Maximal degree in co-relation 1117. Up to 91 conditions per place. [2025-02-08 05:28:11,966 INFO L140 encePairwiseOnDemand]: 550/552 looper letters, 18 selfloop transitions, 1 changer transitions 0/499 dead transitions. [2025-02-08 05:28:11,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 499 transitions, 1065 flow [2025-02-08 05:28:11,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1577 transitions. [2025-02-08 05:28:11,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522946859903382 [2025-02-08 05:28:11,969 INFO L175 Difference]: Start difference. First operand has 499 places, 495 transitions, 1017 flow. Second operand 3 states and 1577 transitions. [2025-02-08 05:28:11,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 500 places, 499 transitions, 1065 flow [2025-02-08 05:28:11,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 499 transitions, 1063 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:28:11,974 INFO L231 Difference]: Finished difference. Result has 499 places, 494 transitions, 1015 flow [2025-02-08 05:28:11,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1015, PETRI_PLACES=499, PETRI_TRANSITIONS=494} [2025-02-08 05:28:11,975 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -41 predicate places. [2025-02-08 05:28:11,975 INFO L471 AbstractCegarLoop]: Abstraction has has 499 places, 494 transitions, 1015 flow [2025-02-08 05:28:11,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 520.3333333333334) internal successors, (1561), 3 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:11,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:11,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:28:11,976 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:11,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:11,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1136453165, now seen corresponding path program 1 times [2025-02-08 05:28:11,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:11,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800749705] [2025-02-08 05:28:11,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:11,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:11,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-02-08 05:28:12,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-02-08 05:28:12,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:12,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:12,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:28:12,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:12,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800749705] [2025-02-08 05:28:12,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800749705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:12,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:12,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:12,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386593929] [2025-02-08 05:28:12,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:12,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:12,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:12,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:12,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:12,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 516 out of 552 [2025-02-08 05:28:12,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 494 transitions, 1015 flow. Second operand has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:12,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:12,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 516 of 552 [2025-02-08 05:28:12,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:12,247 INFO L124 PetriNetUnfolderBase]: 87/1548 cut-off events. [2025-02-08 05:28:12,247 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:28:12,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 1548 events. 87/1548 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7712 event pairs, 45 based on Foata normal form. 0/1471 useless extension candidates. Maximal degree in co-relation 1544. Up to 143 conditions per place. [2025-02-08 05:28:12,251 INFO L140 encePairwiseOnDemand]: 548/552 looper letters, 11 selfloop transitions, 1 changer transitions 80/495 dead transitions. [2025-02-08 05:28:12,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 495 transitions, 1057 flow [2025-02-08 05:28:12,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:12,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:12,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1569 transitions. [2025-02-08 05:28:12,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.947463768115942 [2025-02-08 05:28:12,254 INFO L175 Difference]: Start difference. First operand has 499 places, 494 transitions, 1015 flow. Second operand 3 states and 1569 transitions. [2025-02-08 05:28:12,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 495 transitions, 1057 flow [2025-02-08 05:28:12,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 498 places, 495 transitions, 1056 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:28:12,259 INFO L231 Difference]: Finished difference. Result has 499 places, 414 transitions, 855 flow [2025-02-08 05:28:12,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=1010, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=855, PETRI_PLACES=499, PETRI_TRANSITIONS=414} [2025-02-08 05:28:12,260 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -41 predicate places. [2025-02-08 05:28:12,260 INFO L471 AbstractCegarLoop]: Abstraction has has 499 places, 414 transitions, 855 flow [2025-02-08 05:28:12,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:12,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:28:12,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:28:12,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:28:12,261 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (and 64 more)] === [2025-02-08 05:28:12,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:28:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1303093735, now seen corresponding path program 1 times [2025-02-08 05:28:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:28:12,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482076615] [2025-02-08 05:28:12,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:28:12,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:28:12,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-08 05:28:12,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-08 05:28:12,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:28:12,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:28:12,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:28:12,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:28:12,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482076615] [2025-02-08 05:28:12,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482076615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:28:12,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:28:12,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:28:12,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770387662] [2025-02-08 05:28:12,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:28:12,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:28:12,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:28:12,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:28:12,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:28:12,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 519 out of 552 [2025-02-08 05:28:12,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 414 transitions, 855 flow. Second operand has 3 states, 3 states have (on average 520.6666666666666) internal successors, (1562), 3 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:12,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:28:12,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 519 of 552 [2025-02-08 05:28:12,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:28:12,402 INFO L124 PetriNetUnfolderBase]: 22/611 cut-off events. [2025-02-08 05:28:12,402 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:28:12,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 611 events. 22/611 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1051 event pairs, 11 based on Foata normal form. 0/592 useless extension candidates. Maximal degree in co-relation 496. Up to 28 conditions per place. [2025-02-08 05:28:12,403 INFO L140 encePairwiseOnDemand]: 550/552 looper letters, 0 selfloop transitions, 0 changer transitions 418/418 dead transitions. [2025-02-08 05:28:12,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 418 transitions, 894 flow [2025-02-08 05:28:12,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:28:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:28:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1573 transitions. [2025-02-08 05:28:12,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498792270531401 [2025-02-08 05:28:12,406 INFO L175 Difference]: Start difference. First operand has 499 places, 414 transitions, 855 flow. Second operand 3 states and 1573 transitions. [2025-02-08 05:28:12,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 418 transitions, 894 flow [2025-02-08 05:28:12,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 418 transitions, 893 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:28:12,409 INFO L231 Difference]: Finished difference. Result has 424 places, 0 transitions, 0 flow [2025-02-08 05:28:12,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=552, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=424, PETRI_TRANSITIONS=0} [2025-02-08 05:28:12,410 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -116 predicate places. [2025-02-08 05:28:12,410 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 0 transitions, 0 flow [2025-02-08 05:28:12,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 520.6666666666666) internal successors, (1562), 3 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:28:12,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE (66 of 67 remaining) [2025-02-08 05:28:12,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE (65 of 67 remaining) [2025-02-08 05:28:12,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (64 of 67 remaining) [2025-02-08 05:28:12,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr6ASSERT_VIOLATIONDATA_RACE (63 of 67 remaining) [2025-02-08 05:28:12,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE (62 of 67 remaining) [2025-02-08 05:28:12,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE (61 of 67 remaining) [2025-02-08 05:28:12,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr3ASSERT_VIOLATIONDATA_RACE (60 of 67 remaining) [2025-02-08 05:28:12,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE (59 of 67 remaining) [2025-02-08 05:28:12,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE (58 of 67 remaining) [2025-02-08 05:28:12,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (57 of 67 remaining) [2025-02-08 05:28:12,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE (56 of 67 remaining) [2025-02-08 05:28:12,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE (55 of 67 remaining) [2025-02-08 05:28:12,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (54 of 67 remaining) [2025-02-08 05:28:12,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr6ASSERT_VIOLATIONDATA_RACE (53 of 67 remaining) [2025-02-08 05:28:12,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE (52 of 67 remaining) [2025-02-08 05:28:12,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr4ASSERT_VIOLATIONDATA_RACE (51 of 67 remaining) [2025-02-08 05:28:12,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr3ASSERT_VIOLATIONDATA_RACE (50 of 67 remaining) [2025-02-08 05:28:12,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE (49 of 67 remaining) [2025-02-08 05:28:12,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE (48 of 67 remaining) [2025-02-08 05:28:12,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (47 of 67 remaining) [2025-02-08 05:28:12,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (46 of 67 remaining) [2025-02-08 05:28:12,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (45 of 67 remaining) [2025-02-08 05:28:12,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (44 of 67 remaining) [2025-02-08 05:28:12,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (43 of 67 remaining) [2025-02-08 05:28:12,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (42 of 67 remaining) [2025-02-08 05:28:12,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (41 of 67 remaining) [2025-02-08 05:28:12,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (40 of 67 remaining) [2025-02-08 05:28:12,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (39 of 67 remaining) [2025-02-08 05:28:12,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (38 of 67 remaining) [2025-02-08 05:28:12,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (37 of 67 remaining) [2025-02-08 05:28:12,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (36 of 67 remaining) [2025-02-08 05:28:12,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (35 of 67 remaining) [2025-02-08 05:28:12,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (34 of 67 remaining) [2025-02-08 05:28:12,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (33 of 67 remaining) [2025-02-08 05:28:12,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 67 remaining) [2025-02-08 05:28:12,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (31 of 67 remaining) [2025-02-08 05:28:12,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (30 of 67 remaining) [2025-02-08 05:28:12,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (29 of 67 remaining) [2025-02-08 05:28:12,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (28 of 67 remaining) [2025-02-08 05:28:12,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (27 of 67 remaining) [2025-02-08 05:28:12,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (26 of 67 remaining) [2025-02-08 05:28:12,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (25 of 67 remaining) [2025-02-08 05:28:12,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (24 of 67 remaining) [2025-02-08 05:28:12,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (23 of 67 remaining) [2025-02-08 05:28:12,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 67 remaining) [2025-02-08 05:28:12,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 67 remaining) [2025-02-08 05:28:12,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 67 remaining) [2025-02-08 05:28:12,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr9ASSERT_VIOLATIONDATA_RACE (19 of 67 remaining) [2025-02-08 05:28:12,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr8ASSERT_VIOLATIONDATA_RACE (18 of 67 remaining) [2025-02-08 05:28:12,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr7ASSERT_VIOLATIONDATA_RACE (17 of 67 remaining) [2025-02-08 05:28:12,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr6ASSERT_VIOLATIONDATA_RACE (16 of 67 remaining) [2025-02-08 05:28:12,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr5ASSERT_VIOLATIONDATA_RACE (15 of 67 remaining) [2025-02-08 05:28:12,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE (14 of 67 remaining) [2025-02-08 05:28:12,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr3ASSERT_VIOLATIONDATA_RACE (13 of 67 remaining) [2025-02-08 05:28:12,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE (12 of 67 remaining) [2025-02-08 05:28:12,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE (11 of 67 remaining) [2025-02-08 05:28:12,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (10 of 67 remaining) [2025-02-08 05:28:12,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr9ASSERT_VIOLATIONDATA_RACE (9 of 67 remaining) [2025-02-08 05:28:12,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr8ASSERT_VIOLATIONDATA_RACE (8 of 67 remaining) [2025-02-08 05:28:12,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr7ASSERT_VIOLATIONDATA_RACE (7 of 67 remaining) [2025-02-08 05:28:12,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr6ASSERT_VIOLATIONDATA_RACE (6 of 67 remaining) [2025-02-08 05:28:12,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr5ASSERT_VIOLATIONDATA_RACE (5 of 67 remaining) [2025-02-08 05:28:12,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr4ASSERT_VIOLATIONDATA_RACE (4 of 67 remaining) [2025-02-08 05:28:12,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr3ASSERT_VIOLATIONDATA_RACE (3 of 67 remaining) [2025-02-08 05:28:12,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr1ASSERT_VIOLATIONDATA_RACE (2 of 67 remaining) [2025-02-08 05:28:12,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONDATA_RACE (1 of 67 remaining) [2025-02-08 05:28:12,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr2ASSERT_VIOLATIONDATA_RACE (0 of 67 remaining) [2025-02-08 05:28:12,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:28:12,417 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-02-08 05:28:12,421 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:28:12,421 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:28:12,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:28:12 BasicIcfg [2025-02-08 05:28:12,424 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:28:12,424 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:28:12,425 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:28:12,425 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:28:12,425 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:28:03" (3/4) ... [2025-02-08 05:28:12,426 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:28:12,428 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure whoop_wrapper_read_nvram [2025-02-08 05:28:12,428 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure whoop_wrapper_write_nvram [2025-02-08 05:28:12,432 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-02-08 05:28:12,433 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-08 05:28:12,433 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 05:28:12,433 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:28:12,434 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:28:12,532 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:28:12,536 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:28:12,536 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:28:12,537 INFO L158 Benchmark]: Toolchain (without parser) took 14729.39ms. Allocated memory was 167.8MB in the beginning and 897.6MB in the end (delta: 729.8MB). Free memory was 112.9MB in the beginning and 560.9MB in the end (delta: -448.0MB). Peak memory consumption was 279.2MB. Max. memory is 16.1GB. [2025-02-08 05:28:12,541 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:28:12,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 4228.59ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 112.9MB in the beginning and 300.2MB in the end (delta: -187.3MB). Peak memory consumption was 139.1MB. Max. memory is 16.1GB. [2025-02-08 05:28:12,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 151.74ms. Allocated memory is still 478.2MB. Free memory was 300.2MB in the beginning and 284.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:28:12,541 INFO L158 Benchmark]: Boogie Preprocessor took 66.02ms. Allocated memory is still 478.2MB. Free memory was 284.2MB in the beginning and 278.6MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:28:12,541 INFO L158 Benchmark]: IcfgBuilder took 1164.36ms. Allocated memory is still 478.2MB. Free memory was 278.6MB in the beginning and 376.9MB in the end (delta: -98.3MB). Peak memory consumption was 84.3MB. Max. memory is 16.1GB. [2025-02-08 05:28:12,542 INFO L158 Benchmark]: TraceAbstraction took 9002.65ms. Allocated memory was 478.2MB in the beginning and 897.6MB in the end (delta: 419.4MB). Free memory was 376.9MB in the beginning and 569.3MB in the end (delta: -192.4MB). Peak memory consumption was 222.1MB. Max. memory is 16.1GB. [2025-02-08 05:28:12,542 INFO L158 Benchmark]: Witness Printer took 111.54ms. Allocated memory is still 897.6MB. Free memory was 569.3MB in the beginning and 560.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:28:12,543 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.23ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 4228.59ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 112.9MB in the beginning and 300.2MB in the end (delta: -187.3MB). Peak memory consumption was 139.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 151.74ms. Allocated memory is still 478.2MB. Free memory was 300.2MB in the beginning and 284.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.02ms. Allocated memory is still 478.2MB. Free memory was 284.2MB in the beginning and 278.6MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1164.36ms. Allocated memory is still 478.2MB. Free memory was 278.6MB in the beginning and 376.9MB in the end (delta: -98.3MB). Peak memory consumption was 84.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9002.65ms. Allocated memory was 478.2MB in the beginning and 897.6MB in the end (delta: 419.4MB). Free memory was 376.9MB in the beginning and 569.3MB in the end (delta: -192.4MB). Peak memory consumption was 222.1MB. Max. memory is 16.1GB. * Witness Printer took 111.54ms. Allocated memory is still 897.6MB. Free memory was 569.3MB in the beginning and 560.9MB 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, 733 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: 8.8s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 493 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 179 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1046 IncrementalHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 136 mSDtfsCounter, 1046 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.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1099occurred 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.1s InterpolantComputationTime, 5335 NumberOfCodeBlocks, 5335 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 5307 ConstructedInterpolants, 0 QuantifiedInterpolants, 5668 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 7/7 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-02-08 05:28:12,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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