./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3cf9a63e6b69549a73ec0cdf90051f21ab19a39a485979f4709a706d3ba6e298 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 11:19:55,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 11:19:55,277 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-12-02 11:19:55,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 11:19:55,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 11:19:55,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 11:19:55,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 11:19:55,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 11:19:55,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 11:19:55,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 11:19:55,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 11:19:55,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 11:19:55,307 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 11:19:55,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 11:19:55,307 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 11:19:55,307 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 11:19:55,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 11:19:55,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 11:19:55,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 11:19:55,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 11:19:55,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 11:19:55,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 11:19:55,308 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-12-02 11:19:55,308 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 11:19:55,308 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 11:19:55,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 11:19:55,308 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 11:19:55,308 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 11:19:55,308 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 11:19:55,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:19:55,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:19:55,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:19:55,308 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 11:19:55,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:19:55,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:19:55,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:19:55,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 11:19:55,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 11:19:55,309 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 11:19:55,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 11:19:55,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 11:19:55,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 11:19:55,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 11:19:55,309 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 11:19:55,309 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 11:19:55,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 11:19:55,310 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3cf9a63e6b69549a73ec0cdf90051f21ab19a39a485979f4709a706d3ba6e298 [2024-12-02 11:19:55,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 11:19:55,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 11:19:55,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 11:19:55,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 11:19:55,550 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 11:19:55,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i [2024-12-02 11:19:58,207 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/data/d70b3bcae/d69dfccdb3f24ac38eb5256fbd11379d/FLAG4e425488d [2024-12-02 11:19:58,676 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 11:19:58,677 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i [2024-12-02 11:19:58,719 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/data/d70b3bcae/d69dfccdb3f24ac38eb5256fbd11379d/FLAG4e425488d [2024-12-02 11:19:58,798 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/data/d70b3bcae/d69dfccdb3f24ac38eb5256fbd11379d [2024-12-02 11:19:58,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 11:19:58,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 11:19:58,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 11:19:58,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 11:19:58,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 11:19:58,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:19:58" (1/1) ... [2024-12-02 11:19:58,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64106514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:19:58, skipping insertion in model container [2024-12-02 11:19:58,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:19:58" (1/1) ... [2024-12-02 11:19:58,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 11:20:03,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:20:03,415 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 11:20:03,547 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] [2024-12-02 11:20:03,548 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] [2024-12-02 11:20:03,548 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] [2024-12-02 11:20:03,549 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] [2024-12-02 11:20:03,632 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] [2024-12-02 11:20:03,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:20:04,068 INFO L204 MainTranslator]: Completed translation [2024-12-02 11:20:04,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:20:04 WrapperNode [2024-12-02 11:20:04,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 11:20:04,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 11:20:04,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 11:20:04,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 11:20:04,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:20:04" (1/1) ... [2024-12-02 11:20:04,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:20:04" (1/1) ... [2024-12-02 11:20:04,201 INFO L138 Inliner]: procedures = 1354, calls = 1464, calls flagged for inlining = 353, calls inlined = 20, statements flattened = 523 [2024-12-02 11:20:04,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 11:20:04,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 11:20:04,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 11:20:04,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 11:20:04,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:20:04" (1/1) ... [2024-12-02 11:20:04,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:20:04" (1/1) ... [2024-12-02 11:20:04,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:20:04" (1/1) ... [2024-12-02 11:20:04,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:20:04" (1/1) ... [2024-12-02 11:20:04,236 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:20:04" (1/1) ... [2024-12-02 11:20:04,238 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:20:04" (1/1) ... [2024-12-02 11:20:04,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:20:04" (1/1) ... [2024-12-02 11:20:04,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:20:04" (1/1) ... [2024-12-02 11:20:04,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:20:04" (1/1) ... [2024-12-02 11:20:04,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 11:20:04,256 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 11:20:04,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 11:20:04,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 11:20:04,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:20:04" (1/1) ... [2024-12-02 11:20:04,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:20:04,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:20:04,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 11:20:04,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 11:20:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-02 11:20:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-02 11:20:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_nvram_unlocked_ioctl [2024-12-02 11:20:04,311 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_nvram_unlocked_ioctl [2024-12-02 11:20:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 11:20:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 11:20:04,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 11:20:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-02 11:20:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_read_nvram [2024-12-02 11:20:04,311 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_read_nvram [2024-12-02 11:20:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-12-02 11:20:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-12-02 11:20:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-12-02 11:20:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-02 11:20:04,313 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-02 11:20:04,642 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 11:20:04,644 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 11:20:05,255 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 11:20:05,255 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 11:20:05,325 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 11:20:05,325 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-02 11:20:05,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:20:05 BoogieIcfgContainer [2024-12-02 11:20:05,326 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 11:20:05,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 11:20:05,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 11:20:05,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 11:20:05,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:19:58" (1/3) ... [2024-12-02 11:20:05,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276e1b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:20:05, skipping insertion in model container [2024-12-02 11:20:05,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:20:04" (2/3) ... [2024-12-02 11:20:05,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276e1b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:20:05, skipping insertion in model container [2024-12-02 11:20:05,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:20:05" (3/3) ... [2024-12-02 11:20:05,335 INFO L128 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i [2024-12-02 11:20:05,350 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 11:20:05,353 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i that has 3 procedures, 575 locations, 1 initial locations, 1 loop locations, and 41 error locations. [2024-12-02 11:20:05,353 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 11:20:05,504 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-12-02 11:20:05,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 581 places, 587 transitions, 1188 flow [2024-12-02 11:20:05,792 INFO L124 PetriNetUnfolderBase]: 13/585 cut-off events. [2024-12-02 11:20:05,794 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-12-02 11:20:05,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 585 events. 13/585 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 579 event pairs, 0 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 516. Up to 4 conditions per place. [2024-12-02 11:20:05,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 581 places, 587 transitions, 1188 flow [2024-12-02 11:20:05,810 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 575 places, 581 transitions, 1171 flow [2024-12-02 11:20:05,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 11:20:05,828 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;@5c9a5152, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 11:20:05,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-12-02 11:20:05,844 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 11:20:05,845 INFO L124 PetriNetUnfolderBase]: 0/86 cut-off events. [2024-12-02 11:20:05,845 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 11:20:05,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:05,845 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] [2024-12-02 11:20:05,846 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:05,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:05,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1868452534, now seen corresponding path program 1 times [2024-12-02 11:20:05,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:05,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997457881] [2024-12-02 11:20:05,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:05,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:06,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:06,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997457881] [2024-12-02 11:20:06,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997457881] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:06,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:06,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:06,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139701630] [2024-12-02 11:20:06,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:06,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:06,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:06,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:06,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:06,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-12-02 11:20:06,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 581 transitions, 1171 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:06,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:06,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-12-02 11:20:06,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:06,412 INFO L124 PetriNetUnfolderBase]: 13/613 cut-off events. [2024-12-02 11:20:06,412 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-12-02 11:20:06,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 613 events. 13/613 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 817 event pairs, 2 based on Foata normal form. 4/566 useless extension candidates. Maximal degree in co-relation 515. Up to 13 conditions per place. [2024-12-02 11:20:06,418 INFO L140 encePairwiseOnDemand]: 577/587 looper letters, 8 selfloop transitions, 2 changer transitions 1/571 dead transitions. [2024-12-02 11:20:06,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 571 transitions, 1171 flow [2024-12-02 11:20:06,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:06,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1716 transitions. [2024-12-02 11:20:06,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9744463373083475 [2024-12-02 11:20:06,438 INFO L175 Difference]: Start difference. First operand has 575 places, 581 transitions, 1171 flow. Second operand 3 states and 1716 transitions. [2024-12-02 11:20:06,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 571 transitions, 1171 flow [2024-12-02 11:20:06,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 571 transitions, 1166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 11:20:06,456 INFO L231 Difference]: Finished difference. Result has 568 places, 570 transitions, 1148 flow [2024-12-02 11:20:06,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1148, PETRI_PLACES=568, PETRI_TRANSITIONS=570} [2024-12-02 11:20:06,463 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -7 predicate places. [2024-12-02 11:20:06,463 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 570 transitions, 1148 flow [2024-12-02 11:20:06,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:06,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:06,464 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] [2024-12-02 11:20:06,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 11:20:06,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:06,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:06,465 INFO L85 PathProgramCache]: Analyzing trace with hash 383396254, now seen corresponding path program 1 times [2024-12-02 11:20:06,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:06,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928997267] [2024-12-02 11:20:06,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:06,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:06,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:06,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:06,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928997267] [2024-12-02 11:20:06,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928997267] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:06,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:06,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:06,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912710491] [2024-12-02 11:20:06,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:06,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:06,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:06,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:06,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:06,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-12-02 11:20:06,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 570 transitions, 1148 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:06,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:06,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-12-02 11:20:06,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:06,753 INFO L124 PetriNetUnfolderBase]: 13/611 cut-off events. [2024-12-02 11:20:06,754 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-12-02 11:20:06,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 611 events. 13/611 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 815 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 538. Up to 13 conditions per place. [2024-12-02 11:20:06,758 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/569 dead transitions. [2024-12-02 11:20:06,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 569 transitions, 1166 flow [2024-12-02 11:20:06,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:06,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-12-02 11:20:06,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-12-02 11:20:06,763 INFO L175 Difference]: Start difference. First operand has 568 places, 570 transitions, 1148 flow. Second operand 3 states and 1709 transitions. [2024-12-02 11:20:06,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 569 transitions, 1166 flow [2024-12-02 11:20:06,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 569 transitions, 1162 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:20:06,774 INFO L231 Difference]: Finished difference. Result has 566 places, 569 transitions, 1146 flow [2024-12-02 11:20:06,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1146, PETRI_PLACES=566, PETRI_TRANSITIONS=569} [2024-12-02 11:20:06,775 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -9 predicate places. [2024-12-02 11:20:06,775 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 569 transitions, 1146 flow [2024-12-02 11:20:06,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:06,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:06,777 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] [2024-12-02 11:20:06,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 11:20:06,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:06,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:06,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1627991755, now seen corresponding path program 1 times [2024-12-02 11:20:06,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:06,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374984930] [2024-12-02 11:20:06,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:06,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:06,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:06,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374984930] [2024-12-02 11:20:06,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374984930] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:06,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:06,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:06,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531057980] [2024-12-02 11:20:06,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:06,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:06,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:06,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:06,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:06,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-12-02 11:20:06,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 569 transitions, 1146 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:06,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:06,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-12-02 11:20:06,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:07,005 INFO L124 PetriNetUnfolderBase]: 13/610 cut-off events. [2024-12-02 11:20:07,005 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-12-02 11:20:07,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 610 events. 13/610 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 815 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 530. Up to 13 conditions per place. [2024-12-02 11:20:07,008 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/568 dead transitions. [2024-12-02 11:20:07,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 568 transitions, 1164 flow [2024-12-02 11:20:07,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:07,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-12-02 11:20:07,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-12-02 11:20:07,013 INFO L175 Difference]: Start difference. First operand has 566 places, 569 transitions, 1146 flow. Second operand 3 states and 1709 transitions. [2024-12-02 11:20:07,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 568 transitions, 1164 flow [2024-12-02 11:20:07,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 568 transitions, 1160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:20:07,018 INFO L231 Difference]: Finished difference. Result has 565 places, 568 transitions, 1144 flow [2024-12-02 11:20:07,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1144, PETRI_PLACES=565, PETRI_TRANSITIONS=568} [2024-12-02 11:20:07,019 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -10 predicate places. [2024-12-02 11:20:07,019 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 568 transitions, 1144 flow [2024-12-02 11:20:07,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:07,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:07,020 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] [2024-12-02 11:20:07,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 11:20:07,020 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:07,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:07,021 INFO L85 PathProgramCache]: Analyzing trace with hash 997935529, now seen corresponding path program 1 times [2024-12-02 11:20:07,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:07,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356568489] [2024-12-02 11:20:07,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:07,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:07,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:07,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:07,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356568489] [2024-12-02 11:20:07,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356568489] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:07,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:07,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:07,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393782511] [2024-12-02 11:20:07,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:07,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:07,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:07,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:07,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:07,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 587 [2024-12-02 11:20:07,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 568 transitions, 1144 flow. Second operand has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:07,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:07,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 587 [2024-12-02 11:20:07,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:07,279 INFO L124 PetriNetUnfolderBase]: 29/1066 cut-off events. [2024-12-02 11:20:07,279 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-12-02 11:20:07,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 1066 events. 29/1066 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2994 event pairs, 5 based on Foata normal form. 0/971 useless extension candidates. Maximal degree in co-relation 988. Up to 20 conditions per place. [2024-12-02 11:20:07,283 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 9 selfloop transitions, 2 changer transitions 0/567 dead transitions. [2024-12-02 11:20:07,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 567 transitions, 1164 flow [2024-12-02 11:20:07,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1707 transitions. [2024-12-02 11:20:07,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969335604770017 [2024-12-02 11:20:07,287 INFO L175 Difference]: Start difference. First operand has 565 places, 568 transitions, 1144 flow. Second operand 3 states and 1707 transitions. [2024-12-02 11:20:07,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 567 transitions, 1164 flow [2024-12-02 11:20:07,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 567 transitions, 1160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:20:07,293 INFO L231 Difference]: Finished difference. Result has 564 places, 567 transitions, 1142 flow [2024-12-02 11:20:07,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=564, PETRI_TRANSITIONS=567} [2024-12-02 11:20:07,294 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -11 predicate places. [2024-12-02 11:20:07,294 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 567 transitions, 1142 flow [2024-12-02 11:20:07,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:07,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:07,295 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] [2024-12-02 11:20:07,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 11:20:07,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:07,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:07,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1852725899, now seen corresponding path program 1 times [2024-12-02 11:20:07,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:07,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678688757] [2024-12-02 11:20:07,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:07,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:07,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:07,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678688757] [2024-12-02 11:20:07,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678688757] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:07,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:07,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:07,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274030427] [2024-12-02 11:20:07,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:07,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:07,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:07,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:07,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:07,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-12-02 11:20:07,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 567 transitions, 1142 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:07,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:07,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-12-02 11:20:07,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:07,546 INFO L124 PetriNetUnfolderBase]: 13/608 cut-off events. [2024-12-02 11:20:07,547 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-12-02 11:20:07,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 608 events. 13/608 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 810 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 514. Up to 13 conditions per place. [2024-12-02 11:20:07,549 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/566 dead transitions. [2024-12-02 11:20:07,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 566 transitions, 1160 flow [2024-12-02 11:20:07,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:07,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-12-02 11:20:07,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-12-02 11:20:07,554 INFO L175 Difference]: Start difference. First operand has 564 places, 567 transitions, 1142 flow. Second operand 3 states and 1709 transitions. [2024-12-02 11:20:07,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 566 transitions, 1160 flow [2024-12-02 11:20:07,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 566 transitions, 1156 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:20:07,560 INFO L231 Difference]: Finished difference. Result has 563 places, 566 transitions, 1140 flow [2024-12-02 11:20:07,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1140, PETRI_PLACES=563, PETRI_TRANSITIONS=566} [2024-12-02 11:20:07,561 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -12 predicate places. [2024-12-02 11:20:07,561 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 566 transitions, 1140 flow [2024-12-02 11:20:07,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:07,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:07,563 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] [2024-12-02 11:20:07,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 11:20:07,563 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:07,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:07,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1600199409, now seen corresponding path program 1 times [2024-12-02 11:20:07,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:07,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899791636] [2024-12-02 11:20:07,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:07,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:07,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:07,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899791636] [2024-12-02 11:20:07,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899791636] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:07,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:07,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:07,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087529838] [2024-12-02 11:20:07,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:07,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:07,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:07,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:07,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:07,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 587 [2024-12-02 11:20:07,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 566 transitions, 1140 flow. Second operand has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:07,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:07,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 587 [2024-12-02 11:20:07,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:07,738 INFO L124 PetriNetUnfolderBase]: 14/627 cut-off events. [2024-12-02 11:20:07,738 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-12-02 11:20:07,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 627 events. 14/627 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 905 event pairs, 3 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 529. Up to 16 conditions per place. [2024-12-02 11:20:07,741 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 9 selfloop transitions, 2 changer transitions 0/565 dead transitions. [2024-12-02 11:20:07,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 565 transitions, 1160 flow [2024-12-02 11:20:07,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:07,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:07,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1707 transitions. [2024-12-02 11:20:07,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969335604770017 [2024-12-02 11:20:07,745 INFO L175 Difference]: Start difference. First operand has 563 places, 566 transitions, 1140 flow. Second operand 3 states and 1707 transitions. [2024-12-02 11:20:07,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 565 transitions, 1160 flow [2024-12-02 11:20:07,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 565 transitions, 1156 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:20:07,751 INFO L231 Difference]: Finished difference. Result has 562 places, 565 transitions, 1138 flow [2024-12-02 11:20:07,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1138, PETRI_PLACES=562, PETRI_TRANSITIONS=565} [2024-12-02 11:20:07,752 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -13 predicate places. [2024-12-02 11:20:07,752 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 565 transitions, 1138 flow [2024-12-02 11:20:07,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:07,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:07,753 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] [2024-12-02 11:20:07,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 11:20:07,754 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:07,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:07,754 INFO L85 PathProgramCache]: Analyzing trace with hash -948262792, now seen corresponding path program 1 times [2024-12-02 11:20:07,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:07,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993468704] [2024-12-02 11:20:07,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:07,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:07,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:07,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993468704] [2024-12-02 11:20:07,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993468704] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:07,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:07,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:07,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187223623] [2024-12-02 11:20:07,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:07,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:07,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:07,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:07,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:07,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-12-02 11:20:07,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 565 transitions, 1138 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:07,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:07,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-12-02 11:20:07,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:07,922 INFO L124 PetriNetUnfolderBase]: 13/606 cut-off events. [2024-12-02 11:20:07,922 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-12-02 11:20:07,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 606 events. 13/606 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 808 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 498. Up to 13 conditions per place. [2024-12-02 11:20:07,926 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/564 dead transitions. [2024-12-02 11:20:07,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 564 transitions, 1156 flow [2024-12-02 11:20:07,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:07,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:07,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-12-02 11:20:07,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-12-02 11:20:07,930 INFO L175 Difference]: Start difference. First operand has 562 places, 565 transitions, 1138 flow. Second operand 3 states and 1709 transitions. [2024-12-02 11:20:07,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 564 transitions, 1156 flow [2024-12-02 11:20:07,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 564 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:20:07,936 INFO L231 Difference]: Finished difference. Result has 561 places, 564 transitions, 1136 flow [2024-12-02 11:20:07,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1136, PETRI_PLACES=561, PETRI_TRANSITIONS=564} [2024-12-02 11:20:07,937 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -14 predicate places. [2024-12-02 11:20:07,937 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 564 transitions, 1136 flow [2024-12-02 11:20:07,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:07,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:07,939 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] [2024-12-02 11:20:07,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 11:20:07,939 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:07,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:07,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1755385402, now seen corresponding path program 1 times [2024-12-02 11:20:07,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:07,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071779270] [2024-12-02 11:20:07,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:07,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:08,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:08,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:08,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071779270] [2024-12-02 11:20:08,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071779270] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:08,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:08,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:08,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293027248] [2024-12-02 11:20:08,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:08,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:08,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:08,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:08,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:08,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-12-02 11:20:08,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 564 transitions, 1136 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:08,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:08,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-12-02 11:20:08,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:08,096 INFO L124 PetriNetUnfolderBase]: 13/605 cut-off events. [2024-12-02 11:20:08,096 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-12-02 11:20:08,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 605 events. 13/605 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 817 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 490. Up to 13 conditions per place. [2024-12-02 11:20:08,099 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/563 dead transitions. [2024-12-02 11:20:08,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 563 transitions, 1154 flow [2024-12-02 11:20:08,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-12-02 11:20:08,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-12-02 11:20:08,102 INFO L175 Difference]: Start difference. First operand has 561 places, 564 transitions, 1136 flow. Second operand 3 states and 1709 transitions. [2024-12-02 11:20:08,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 563 transitions, 1154 flow [2024-12-02 11:20:08,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 563 transitions, 1150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:20:08,108 INFO L231 Difference]: Finished difference. Result has 560 places, 563 transitions, 1134 flow [2024-12-02 11:20:08,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1134, PETRI_PLACES=560, PETRI_TRANSITIONS=563} [2024-12-02 11:20:08,109 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -15 predicate places. [2024-12-02 11:20:08,110 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 563 transitions, 1134 flow [2024-12-02 11:20:08,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:08,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:08,111 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] [2024-12-02 11:20:08,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 11:20:08,111 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:08,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash 703271396, now seen corresponding path program 1 times [2024-12-02 11:20:08,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:08,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627767408] [2024-12-02 11:20:08,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:08,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:08,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:08,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:08,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627767408] [2024-12-02 11:20:08,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627767408] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:08,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:08,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:08,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020231629] [2024-12-02 11:20:08,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:08,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:08,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:08,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:08,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:08,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-12-02 11:20:08,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 563 transitions, 1134 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:08,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:08,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-12-02 11:20:08,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:08,266 INFO L124 PetriNetUnfolderBase]: 13/604 cut-off events. [2024-12-02 11:20:08,266 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-12-02 11:20:08,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 604 events. 13/604 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 816 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 482. Up to 13 conditions per place. [2024-12-02 11:20:08,268 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/562 dead transitions. [2024-12-02 11:20:08,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 562 transitions, 1152 flow [2024-12-02 11:20:08,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-12-02 11:20:08,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-12-02 11:20:08,272 INFO L175 Difference]: Start difference. First operand has 560 places, 563 transitions, 1134 flow. Second operand 3 states and 1709 transitions. [2024-12-02 11:20:08,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 562 transitions, 1152 flow [2024-12-02 11:20:08,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 562 transitions, 1148 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:20:08,290 INFO L231 Difference]: Finished difference. Result has 559 places, 562 transitions, 1132 flow [2024-12-02 11:20:08,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1132, PETRI_PLACES=559, PETRI_TRANSITIONS=562} [2024-12-02 11:20:08,292 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -16 predicate places. [2024-12-02 11:20:08,292 INFO L471 AbstractCegarLoop]: Abstraction has has 559 places, 562 transitions, 1132 flow [2024-12-02 11:20:08,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:08,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:08,293 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:20:08,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 11:20:08,293 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:08,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:08,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1856580635, now seen corresponding path program 1 times [2024-12-02 11:20:08,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:08,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799902046] [2024-12-02 11:20:08,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:08,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:08,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:08,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799902046] [2024-12-02 11:20:08,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799902046] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:08,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:08,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:08,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372120771] [2024-12-02 11:20:08,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:08,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:08,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:08,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:08,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:08,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-12-02 11:20:08,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 562 transitions, 1132 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:08,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:08,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-12-02 11:20:08,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:08,503 INFO L124 PetriNetUnfolderBase]: 13/603 cut-off events. [2024-12-02 11:20:08,504 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-12-02 11:20:08,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 603 events. 13/603 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 816 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 474. Up to 13 conditions per place. [2024-12-02 11:20:08,508 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/561 dead transitions. [2024-12-02 11:20:08,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 561 transitions, 1150 flow [2024-12-02 11:20:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-12-02 11:20:08,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-12-02 11:20:08,512 INFO L175 Difference]: Start difference. First operand has 559 places, 562 transitions, 1132 flow. Second operand 3 states and 1709 transitions. [2024-12-02 11:20:08,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 561 transitions, 1150 flow [2024-12-02 11:20:08,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 561 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:20:08,520 INFO L231 Difference]: Finished difference. Result has 558 places, 561 transitions, 1130 flow [2024-12-02 11:20:08,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1130, PETRI_PLACES=558, PETRI_TRANSITIONS=561} [2024-12-02 11:20:08,521 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -17 predicate places. [2024-12-02 11:20:08,521 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 561 transitions, 1130 flow [2024-12-02 11:20:08,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:08,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:08,522 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] [2024-12-02 11:20:08,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 11:20:08,523 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:08,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:08,523 INFO L85 PathProgramCache]: Analyzing trace with hash 556897494, now seen corresponding path program 1 times [2024-12-02 11:20:08,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:08,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986160632] [2024-12-02 11:20:08,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:08,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:08,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:08,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986160632] [2024-12-02 11:20:08,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986160632] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:08,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:08,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:08,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246315110] [2024-12-02 11:20:08,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:08,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:08,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:08,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:08,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:08,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-12-02 11:20:08,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 561 transitions, 1130 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:08,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:08,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-12-02 11:20:08,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:08,739 INFO L124 PetriNetUnfolderBase]: 13/602 cut-off events. [2024-12-02 11:20:08,739 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-12-02 11:20:08,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 602 events. 13/602 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 813 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 466. Up to 13 conditions per place. [2024-12-02 11:20:08,745 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/560 dead transitions. [2024-12-02 11:20:08,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 560 transitions, 1148 flow [2024-12-02 11:20:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-12-02 11:20:08,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-12-02 11:20:08,749 INFO L175 Difference]: Start difference. First operand has 558 places, 561 transitions, 1130 flow. Second operand 3 states and 1709 transitions. [2024-12-02 11:20:08,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 560 transitions, 1148 flow [2024-12-02 11:20:08,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 560 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:20:08,758 INFO L231 Difference]: Finished difference. Result has 557 places, 560 transitions, 1128 flow [2024-12-02 11:20:08,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1128, PETRI_PLACES=557, PETRI_TRANSITIONS=560} [2024-12-02 11:20:08,759 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -18 predicate places. [2024-12-02 11:20:08,759 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 560 transitions, 1128 flow [2024-12-02 11:20:08,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:08,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:08,760 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] [2024-12-02 11:20:08,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 11:20:08,761 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:08,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:08,761 INFO L85 PathProgramCache]: Analyzing trace with hash -866413354, now seen corresponding path program 1 times [2024-12-02 11:20:08,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:08,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020587145] [2024-12-02 11:20:08,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:08,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:08,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:08,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020587145] [2024-12-02 11:20:08,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020587145] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:08,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:08,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:08,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331905472] [2024-12-02 11:20:08,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:08,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:08,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:08,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:08,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:08,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 587 [2024-12-02 11:20:08,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 560 transitions, 1128 flow. Second operand has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:08,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:08,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 587 [2024-12-02 11:20:08,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:09,129 INFO L124 PetriNetUnfolderBase]: 29/1049 cut-off events. [2024-12-02 11:20:09,130 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-12-02 11:20:09,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 1049 events. 29/1049 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2972 event pairs, 5 based on Foata normal form. 0/965 useless extension candidates. Maximal degree in co-relation 915. Up to 20 conditions per place. [2024-12-02 11:20:09,136 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 9 selfloop transitions, 2 changer transitions 0/559 dead transitions. [2024-12-02 11:20:09,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 559 transitions, 1148 flow [2024-12-02 11:20:09,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1707 transitions. [2024-12-02 11:20:09,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969335604770017 [2024-12-02 11:20:09,140 INFO L175 Difference]: Start difference. First operand has 557 places, 560 transitions, 1128 flow. Second operand 3 states and 1707 transitions. [2024-12-02 11:20:09,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 559 transitions, 1148 flow [2024-12-02 11:20:09,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 559 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:20:09,149 INFO L231 Difference]: Finished difference. Result has 556 places, 559 transitions, 1126 flow [2024-12-02 11:20:09,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1126, PETRI_PLACES=556, PETRI_TRANSITIONS=559} [2024-12-02 11:20:09,150 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -19 predicate places. [2024-12-02 11:20:09,150 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 559 transitions, 1126 flow [2024-12-02 11:20:09,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:09,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:09,151 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] [2024-12-02 11:20:09,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 11:20:09,152 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:09,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:09,152 INFO L85 PathProgramCache]: Analyzing trace with hash 408865890, now seen corresponding path program 1 times [2024-12-02 11:20:09,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:09,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394419253] [2024-12-02 11:20:09,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:09,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:09,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:09,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394419253] [2024-12-02 11:20:09,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394419253] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:09,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:09,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:09,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605247183] [2024-12-02 11:20:09,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:09,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:09,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:09,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:09,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:09,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-12-02 11:20:09,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 559 transitions, 1126 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:09,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:09,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-12-02 11:20:09,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:09,361 INFO L124 PetriNetUnfolderBase]: 13/600 cut-off events. [2024-12-02 11:20:09,361 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-12-02 11:20:09,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 600 events. 13/600 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 810 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 450. Up to 13 conditions per place. [2024-12-02 11:20:09,363 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2024-12-02 11:20:09,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 558 transitions, 1144 flow [2024-12-02 11:20:09,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:09,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:09,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-12-02 11:20:09,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-12-02 11:20:09,367 INFO L175 Difference]: Start difference. First operand has 556 places, 559 transitions, 1126 flow. Second operand 3 states and 1709 transitions. [2024-12-02 11:20:09,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 558 transitions, 1144 flow [2024-12-02 11:20:09,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 558 transitions, 1140 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:20:09,372 INFO L231 Difference]: Finished difference. Result has 555 places, 558 transitions, 1124 flow [2024-12-02 11:20:09,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1124, PETRI_PLACES=555, PETRI_TRANSITIONS=558} [2024-12-02 11:20:09,373 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -20 predicate places. [2024-12-02 11:20:09,373 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 558 transitions, 1124 flow [2024-12-02 11:20:09,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:09,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:09,374 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] [2024-12-02 11:20:09,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 11:20:09,374 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:09,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:09,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1745363436, now seen corresponding path program 1 times [2024-12-02 11:20:09,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:09,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683738182] [2024-12-02 11:20:09,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:09,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:09,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:09,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:09,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683738182] [2024-12-02 11:20:09,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683738182] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:09,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:09,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:09,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956149623] [2024-12-02 11:20:09,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:09,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:09,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:09,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:09,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:09,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-12-02 11:20:09,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 558 transitions, 1124 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:09,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:09,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-12-02 11:20:09,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:09,528 INFO L124 PetriNetUnfolderBase]: 13/599 cut-off events. [2024-12-02 11:20:09,528 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-12-02 11:20:09,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 599 events. 13/599 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 810 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 442. Up to 13 conditions per place. [2024-12-02 11:20:09,530 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/557 dead transitions. [2024-12-02 11:20:09,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 557 transitions, 1142 flow [2024-12-02 11:20:09,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:09,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:09,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-12-02 11:20:09,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-12-02 11:20:09,534 INFO L175 Difference]: Start difference. First operand has 555 places, 558 transitions, 1124 flow. Second operand 3 states and 1709 transitions. [2024-12-02 11:20:09,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 557 transitions, 1142 flow [2024-12-02 11:20:09,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 557 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:20:09,539 INFO L231 Difference]: Finished difference. Result has 554 places, 557 transitions, 1122 flow [2024-12-02 11:20:09,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1122, PETRI_PLACES=554, PETRI_TRANSITIONS=557} [2024-12-02 11:20:09,540 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -21 predicate places. [2024-12-02 11:20:09,540 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 557 transitions, 1122 flow [2024-12-02 11:20:09,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:09,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:09,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:20:09,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 11:20:09,541 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:09,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:09,542 INFO L85 PathProgramCache]: Analyzing trace with hash -392305167, now seen corresponding path program 1 times [2024-12-02 11:20:09,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:09,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073279556] [2024-12-02 11:20:09,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:09,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:09,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:09,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073279556] [2024-12-02 11:20:09,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073279556] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:09,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:09,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:09,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861282902] [2024-12-02 11:20:09,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:09,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:09,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:09,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:09,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:09,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-12-02 11:20:09,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 557 transitions, 1122 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:09,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:09,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-12-02 11:20:09,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:09,704 INFO L124 PetriNetUnfolderBase]: 13/598 cut-off events. [2024-12-02 11:20:09,704 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-12-02 11:20:09,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 598 events. 13/598 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 810 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 434. Up to 13 conditions per place. [2024-12-02 11:20:09,706 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/556 dead transitions. [2024-12-02 11:20:09,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 556 transitions, 1140 flow [2024-12-02 11:20:09,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:09,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-12-02 11:20:09,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-12-02 11:20:09,710 INFO L175 Difference]: Start difference. First operand has 554 places, 557 transitions, 1122 flow. Second operand 3 states and 1709 transitions. [2024-12-02 11:20:09,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 556 transitions, 1140 flow [2024-12-02 11:20:09,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 556 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:20:09,715 INFO L231 Difference]: Finished difference. Result has 553 places, 556 transitions, 1120 flow [2024-12-02 11:20:09,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1120, PETRI_PLACES=553, PETRI_TRANSITIONS=556} [2024-12-02 11:20:09,716 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -22 predicate places. [2024-12-02 11:20:09,716 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 556 transitions, 1120 flow [2024-12-02 11:20:09,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:09,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:09,717 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] [2024-12-02 11:20:09,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 11:20:09,717 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:09,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:09,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1088648328, now seen corresponding path program 1 times [2024-12-02 11:20:09,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:09,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185919568] [2024-12-02 11:20:09,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:09,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:09,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:09,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185919568] [2024-12-02 11:20:09,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185919568] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:09,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:09,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:09,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160221351] [2024-12-02 11:20:09,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:09,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:09,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:09,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:09,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:09,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-12-02 11:20:09,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 556 transitions, 1120 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:09,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:09,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-12-02 11:20:09,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:09,885 INFO L124 PetriNetUnfolderBase]: 13/597 cut-off events. [2024-12-02 11:20:09,885 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-12-02 11:20:09,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 597 events. 13/597 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 809 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 426. Up to 13 conditions per place. [2024-12-02 11:20:09,887 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/555 dead transitions. [2024-12-02 11:20:09,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 555 transitions, 1138 flow [2024-12-02 11:20:09,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:09,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-12-02 11:20:09,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-12-02 11:20:09,891 INFO L175 Difference]: Start difference. First operand has 553 places, 556 transitions, 1120 flow. Second operand 3 states and 1709 transitions. [2024-12-02 11:20:09,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 555 transitions, 1138 flow [2024-12-02 11:20:09,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 555 transitions, 1134 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:20:09,896 INFO L231 Difference]: Finished difference. Result has 552 places, 555 transitions, 1118 flow [2024-12-02 11:20:09,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=552, PETRI_TRANSITIONS=555} [2024-12-02 11:20:09,897 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -23 predicate places. [2024-12-02 11:20:09,897 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 555 transitions, 1118 flow [2024-12-02 11:20:09,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:09,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:09,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:20:09,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 11:20:09,898 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:09,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:09,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1648074247, now seen corresponding path program 1 times [2024-12-02 11:20:09,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:09,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655733004] [2024-12-02 11:20:09,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:09,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:09,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:09,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:09,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655733004] [2024-12-02 11:20:09,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655733004] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:09,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:09,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:09,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107318124] [2024-12-02 11:20:09,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:09,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:09,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:09,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:09,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:10,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 587 [2024-12-02 11:20:10,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 555 transitions, 1118 flow. Second operand has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:10,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:10,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 587 [2024-12-02 11:20:10,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:10,144 INFO L124 PetriNetUnfolderBase]: 18/662 cut-off events. [2024-12-02 11:20:10,145 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-12-02 11:20:10,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 662 events. 18/662 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1142 event pairs, 5 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 494. Up to 21 conditions per place. [2024-12-02 11:20:10,148 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 10 selfloop transitions, 2 changer transitions 0/554 dead transitions. [2024-12-02 11:20:10,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 554 transitions, 1140 flow [2024-12-02 11:20:10,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:10,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1705 transitions. [2024-12-02 11:20:10,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681998864281658 [2024-12-02 11:20:10,151 INFO L175 Difference]: Start difference. First operand has 552 places, 555 transitions, 1118 flow. Second operand 3 states and 1705 transitions. [2024-12-02 11:20:10,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 554 transitions, 1140 flow [2024-12-02 11:20:10,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 554 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:20:10,156 INFO L231 Difference]: Finished difference. Result has 551 places, 554 transitions, 1116 flow [2024-12-02 11:20:10,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1116, PETRI_PLACES=551, PETRI_TRANSITIONS=554} [2024-12-02 11:20:10,156 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -24 predicate places. [2024-12-02 11:20:10,157 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 554 transitions, 1116 flow [2024-12-02 11:20:10,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:10,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:10,158 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] [2024-12-02 11:20:10,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 11:20:10,158 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:10,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:10,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2104513640, now seen corresponding path program 1 times [2024-12-02 11:20:10,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:10,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473634846] [2024-12-02 11:20:10,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:10,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:10,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:10,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:10,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473634846] [2024-12-02 11:20:10,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473634846] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:10,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:10,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:10,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114386568] [2024-12-02 11:20:10,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:10,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:10,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:10,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:10,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:10,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-12-02 11:20:10,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 554 transitions, 1116 flow. Second operand has 3 states, 3 states have (on average 567.0) internal successors, (1701), 3 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:10,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:10,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-12-02 11:20:10,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:10,387 INFO L124 PetriNetUnfolderBase]: 34/1084 cut-off events. [2024-12-02 11:20:10,387 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-12-02 11:20:10,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 1084 events. 34/1084 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3251 event pairs, 8 based on Foata normal form. 0/1011 useless extension candidates. Maximal degree in co-relation 915. Up to 25 conditions per place. [2024-12-02 11:20:10,391 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 9 selfloop transitions, 1 changer transitions 0/552 dead transitions. [2024-12-02 11:20:10,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 552 transitions, 1132 flow [2024-12-02 11:20:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1710 transitions. [2024-12-02 11:20:10,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9710391822827938 [2024-12-02 11:20:10,394 INFO L175 Difference]: Start difference. First operand has 551 places, 554 transitions, 1116 flow. Second operand 3 states and 1710 transitions. [2024-12-02 11:20:10,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 552 transitions, 1132 flow [2024-12-02 11:20:10,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 552 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:20:10,398 INFO L231 Difference]: Finished difference. Result has 549 places, 552 transitions, 1110 flow [2024-12-02 11:20:10,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1110, PETRI_PLACES=549, PETRI_TRANSITIONS=552} [2024-12-02 11:20:10,399 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -26 predicate places. [2024-12-02 11:20:10,399 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 552 transitions, 1110 flow [2024-12-02 11:20:10,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.0) internal successors, (1701), 3 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:10,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:10,400 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] [2024-12-02 11:20:10,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 11:20:10,400 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:10,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:10,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1100205178, now seen corresponding path program 1 times [2024-12-02 11:20:10,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:10,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607867176] [2024-12-02 11:20:10,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:10,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:12,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:12,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:12,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607867176] [2024-12-02 11:20:12,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607867176] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:12,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:12,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 11:20:12,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244479396] [2024-12-02 11:20:12,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:12,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 11:20:12,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:12,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 11:20:12,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:20:13,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 587 [2024-12-02 11:20:13,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 552 transitions, 1110 flow. Second operand has 10 states, 10 states have (on average 526.3) internal successors, (5263), 10 states have internal predecessors, (5263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:13,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:13,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 587 [2024-12-02 11:20:13,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:13,360 INFO L124 PetriNetUnfolderBase]: 126/1121 cut-off events. [2024-12-02 11:20:13,360 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2024-12-02 11:20:13,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 1121 events. 126/1121 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5256 event pairs, 98 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1233. Up to 242 conditions per place. [2024-12-02 11:20:13,367 INFO L140 encePairwiseOnDemand]: 577/587 looper letters, 42 selfloop transitions, 9 changer transitions 0/551 dead transitions. [2024-12-02 11:20:13,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 551 transitions, 1210 flow [2024-12-02 11:20:13,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 11:20:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-12-02 11:20:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5302 transitions. [2024-12-02 11:20:13,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.903236797274276 [2024-12-02 11:20:13,375 INFO L175 Difference]: Start difference. First operand has 549 places, 552 transitions, 1110 flow. Second operand 10 states and 5302 transitions. [2024-12-02 11:20:13,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 551 transitions, 1210 flow [2024-12-02 11:20:13,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 551 transitions, 1209 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 11:20:13,383 INFO L231 Difference]: Finished difference. Result has 556 places, 551 transitions, 1125 flow [2024-12-02 11:20:13,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1125, PETRI_PLACES=556, PETRI_TRANSITIONS=551} [2024-12-02 11:20:13,385 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -19 predicate places. [2024-12-02 11:20:13,385 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 551 transitions, 1125 flow [2024-12-02 11:20:13,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 526.3) internal successors, (5263), 10 states have internal predecessors, (5263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:13,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:13,387 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] [2024-12-02 11:20:13,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 11:20:13,387 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:13,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1189561870, now seen corresponding path program 1 times [2024-12-02 11:20:13,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:13,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925436615] [2024-12-02 11:20:13,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:13,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:13,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:13,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925436615] [2024-12-02 11:20:13,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925436615] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:13,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:13,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:13,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426872657] [2024-12-02 11:20:13,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:13,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:13,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:13,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:13,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:13,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 587 [2024-12-02 11:20:13,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 551 transitions, 1125 flow. Second operand has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:13,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:13,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 587 [2024-12-02 11:20:13,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:13,719 INFO L124 PetriNetUnfolderBase]: 22/678 cut-off events. [2024-12-02 11:20:13,719 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-12-02 11:20:13,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 678 events. 22/678 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1290 event pairs, 9 based on Foata normal form. 0/639 useless extension candidates. Maximal degree in co-relation 521. Up to 31 conditions per place. [2024-12-02 11:20:13,724 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 12 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2024-12-02 11:20:13,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 550 transitions, 1151 flow [2024-12-02 11:20:13,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:13,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1701 transitions. [2024-12-02 11:20:13,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659284497444633 [2024-12-02 11:20:13,728 INFO L175 Difference]: Start difference. First operand has 556 places, 551 transitions, 1125 flow. Second operand 3 states and 1701 transitions. [2024-12-02 11:20:13,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 550 transitions, 1151 flow [2024-12-02 11:20:13,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 550 transitions, 1133 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-12-02 11:20:13,736 INFO L231 Difference]: Finished difference. Result has 548 places, 550 transitions, 1109 flow [2024-12-02 11:20:13,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1109, PETRI_PLACES=548, PETRI_TRANSITIONS=550} [2024-12-02 11:20:13,737 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -27 predicate places. [2024-12-02 11:20:13,737 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 550 transitions, 1109 flow [2024-12-02 11:20:13,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:13,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:13,738 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] [2024-12-02 11:20:13,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 11:20:13,738 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:13,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:13,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1481215302, now seen corresponding path program 1 times [2024-12-02 11:20:13,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:13,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173651988] [2024-12-02 11:20:13,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:13,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:13,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:20:13,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:13,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173651988] [2024-12-02 11:20:13,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173651988] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:13,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:13,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:13,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005891660] [2024-12-02 11:20:13,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:13,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:13,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:13,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:13,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:13,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 560 out of 587 [2024-12-02 11:20:13,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 550 transitions, 1109 flow. Second operand has 3 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:13,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:13,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 560 of 587 [2024-12-02 11:20:13,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:14,045 INFO L124 PetriNetUnfolderBase]: 45/1044 cut-off events. [2024-12-02 11:20:14,046 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-12-02 11:20:14,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 1044 events. 45/1044 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3609 event pairs, 20 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 905. Up to 53 conditions per place. [2024-12-02 11:20:14,051 INFO L140 encePairwiseOnDemand]: 582/587 looper letters, 13 selfloop transitions, 1 changer transitions 0/546 dead transitions. [2024-12-02 11:20:14,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 546 transitions, 1129 flow [2024-12-02 11:20:14,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1698 transitions. [2024-12-02 11:20:14,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9642248722316865 [2024-12-02 11:20:14,054 INFO L175 Difference]: Start difference. First operand has 548 places, 550 transitions, 1109 flow. Second operand 3 states and 1698 transitions. [2024-12-02 11:20:14,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 546 transitions, 1129 flow [2024-12-02 11:20:14,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 546 transitions, 1125 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:20:14,062 INFO L231 Difference]: Finished difference. Result has 544 places, 546 transitions, 1099 flow [2024-12-02 11:20:14,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1099, PETRI_PLACES=544, PETRI_TRANSITIONS=546} [2024-12-02 11:20:14,063 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -31 predicate places. [2024-12-02 11:20:14,063 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 546 transitions, 1099 flow [2024-12-02 11:20:14,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:14,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:14,063 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] [2024-12-02 11:20:14,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 11:20:14,064 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:14,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:14,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1892750420, now seen corresponding path program 1 times [2024-12-02 11:20:14,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:14,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808383423] [2024-12-02 11:20:14,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:14,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:20:14,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:14,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808383423] [2024-12-02 11:20:14,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808383423] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:14,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:14,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:14,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427747541] [2024-12-02 11:20:14,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:14,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:14,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:14,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:14,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:14,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 570 out of 587 [2024-12-02 11:20:14,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 546 transitions, 1099 flow. Second operand has 3 states, 3 states have (on average 570.6666666666666) internal successors, (1712), 3 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:14,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:14,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 570 of 587 [2024-12-02 11:20:14,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:14,267 INFO L124 PetriNetUnfolderBase]: 13/587 cut-off events. [2024-12-02 11:20:14,267 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-12-02 11:20:14,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 587 events. 13/587 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 789 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 400. Up to 11 conditions per place. [2024-12-02 11:20:14,272 INFO L140 encePairwiseOnDemand]: 585/587 looper letters, 6 selfloop transitions, 1 changer transitions 0/545 dead transitions. [2024-12-02 11:20:14,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 545 transitions, 1111 flow [2024-12-02 11:20:14,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:14,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:14,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1718 transitions. [2024-12-02 11:20:14,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9755820556501987 [2024-12-02 11:20:14,275 INFO L175 Difference]: Start difference. First operand has 544 places, 546 transitions, 1099 flow. Second operand 3 states and 1718 transitions. [2024-12-02 11:20:14,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 545 transitions, 1111 flow [2024-12-02 11:20:14,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 545 transitions, 1110 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 11:20:14,282 INFO L231 Difference]: Finished difference. Result has 544 places, 545 transitions, 1098 flow [2024-12-02 11:20:14,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1098, PETRI_PLACES=544, PETRI_TRANSITIONS=545} [2024-12-02 11:20:14,284 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -31 predicate places. [2024-12-02 11:20:14,284 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 545 transitions, 1098 flow [2024-12-02 11:20:14,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.6666666666666) internal successors, (1712), 3 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:14,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:14,284 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] [2024-12-02 11:20:14,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 11:20:14,285 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:14,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:14,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1377557941, now seen corresponding path program 1 times [2024-12-02 11:20:14,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:14,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132761855] [2024-12-02 11:20:14,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:14,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:20:14,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:14,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132761855] [2024-12-02 11:20:14,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132761855] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:14,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:14,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:14,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994592119] [2024-12-02 11:20:14,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:14,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:14,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:14,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:14,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:14,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 587 [2024-12-02 11:20:14,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 545 transitions, 1098 flow. Second operand has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:14,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:14,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 587 [2024-12-02 11:20:14,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:14,503 INFO L124 PetriNetUnfolderBase]: 23/714 cut-off events. [2024-12-02 11:20:14,503 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-12-02 11:20:14,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 714 events. 23/714 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1595 event pairs, 8 based on Foata normal form. 0/681 useless extension candidates. Maximal degree in co-relation 552. Up to 30 conditions per place. [2024-12-02 11:20:14,507 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 13 selfloop transitions, 2 changer transitions 0/544 dead transitions. [2024-12-02 11:20:14,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 544 transitions, 1126 flow [2024-12-02 11:20:14,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1702 transitions. [2024-12-02 11:20:14,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966496308915389 [2024-12-02 11:20:14,509 INFO L175 Difference]: Start difference. First operand has 544 places, 545 transitions, 1098 flow. Second operand 3 states and 1702 transitions. [2024-12-02 11:20:14,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 544 transitions, 1126 flow [2024-12-02 11:20:14,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 544 transitions, 1125 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 11:20:14,514 INFO L231 Difference]: Finished difference. Result has 544 places, 544 transitions, 1099 flow [2024-12-02 11:20:14,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1099, PETRI_PLACES=544, PETRI_TRANSITIONS=544} [2024-12-02 11:20:14,515 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -31 predicate places. [2024-12-02 11:20:14,515 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 544 transitions, 1099 flow [2024-12-02 11:20:14,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:14,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:14,516 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] [2024-12-02 11:20:14,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 11:20:14,516 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:14,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:14,517 INFO L85 PathProgramCache]: Analyzing trace with hash 20257327, now seen corresponding path program 1 times [2024-12-02 11:20:14,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:14,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781288070] [2024-12-02 11:20:14,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:14,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:14,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:20:14,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:14,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781288070] [2024-12-02 11:20:14,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781288070] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:14,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:14,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:14,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401678116] [2024-12-02 11:20:14,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:14,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:14,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:14,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:14,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:14,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 587 [2024-12-02 11:20:14,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 544 transitions, 1099 flow. Second operand has 3 states, 3 states have (on average 563.0) internal successors, (1689), 3 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:14,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:14,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 587 [2024-12-02 11:20:14,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:14,842 INFO L124 PetriNetUnfolderBase]: 44/1078 cut-off events. [2024-12-02 11:20:14,842 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2024-12-02 11:20:14,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 1078 events. 44/1078 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3643 event pairs, 2 based on Foata normal form. 0/1022 useless extension candidates. Maximal degree in co-relation 983. Up to 43 conditions per place. [2024-12-02 11:20:14,849 INFO L140 encePairwiseOnDemand]: 581/587 looper letters, 16 selfloop transitions, 3 changer transitions 0/547 dead transitions. [2024-12-02 11:20:14,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 547 transitions, 1147 flow [2024-12-02 11:20:14,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:14,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:14,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1708 transitions. [2024-12-02 11:20:14,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9699034639409426 [2024-12-02 11:20:14,852 INFO L175 Difference]: Start difference. First operand has 544 places, 544 transitions, 1099 flow. Second operand 3 states and 1708 transitions. [2024-12-02 11:20:14,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 547 transitions, 1147 flow [2024-12-02 11:20:14,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 547 transitions, 1143 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:20:14,863 INFO L231 Difference]: Finished difference. Result has 542 places, 542 transitions, 1102 flow [2024-12-02 11:20:14,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1102, PETRI_PLACES=542, PETRI_TRANSITIONS=542} [2024-12-02 11:20:14,864 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -33 predicate places. [2024-12-02 11:20:14,864 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 542 transitions, 1102 flow [2024-12-02 11:20:14,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.0) internal successors, (1689), 3 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:14,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:14,865 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] [2024-12-02 11:20:14,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-02 11:20:14,865 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:14,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:14,866 INFO L85 PathProgramCache]: Analyzing trace with hash -481240162, now seen corresponding path program 1 times [2024-12-02 11:20:14,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:14,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346434530] [2024-12-02 11:20:14,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:14,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:20:14,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:14,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346434530] [2024-12-02 11:20:14,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346434530] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:14,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:14,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:14,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984155010] [2024-12-02 11:20:14,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:14,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:14,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:14,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:14,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:14,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 587 [2024-12-02 11:20:14,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 542 transitions, 1102 flow. Second operand has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:14,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:14,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 587 [2024-12-02 11:20:14,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:15,269 INFO L124 PetriNetUnfolderBase]: 49/1463 cut-off events. [2024-12-02 11:20:15,269 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-12-02 11:20:15,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 1463 events. 49/1463 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 6309 event pairs, 10 based on Foata normal form. 0/1386 useless extension candidates. Maximal degree in co-relation 1338. Up to 38 conditions per place. [2024-12-02 11:20:15,278 INFO L140 encePairwiseOnDemand]: 585/587 looper letters, 10 selfloop transitions, 1 changer transitions 0/544 dead transitions. [2024-12-02 11:20:15,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 544 transitions, 1130 flow [2024-12-02 11:20:15,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:15,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1719 transitions. [2024-12-02 11:20:15,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9761499148211243 [2024-12-02 11:20:15,282 INFO L175 Difference]: Start difference. First operand has 542 places, 542 transitions, 1102 flow. Second operand 3 states and 1719 transitions. [2024-12-02 11:20:15,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 544 transitions, 1130 flow [2024-12-02 11:20:15,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 544 transitions, 1127 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 11:20:15,329 INFO L231 Difference]: Finished difference. Result has 542 places, 541 transitions, 1099 flow [2024-12-02 11:20:15,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1099, PETRI_PLACES=542, PETRI_TRANSITIONS=541} [2024-12-02 11:20:15,330 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -33 predicate places. [2024-12-02 11:20:15,330 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 541 transitions, 1099 flow [2024-12-02 11:20:15,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:15,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:15,331 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] [2024-12-02 11:20:15,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-02 11:20:15,332 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:15,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:15,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1707080083, now seen corresponding path program 1 times [2024-12-02 11:20:15,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:15,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996874871] [2024-12-02 11:20:15,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:15,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:20:15,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:15,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996874871] [2024-12-02 11:20:15,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996874871] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:15,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:15,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:15,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934416934] [2024-12-02 11:20:15,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:15,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:15,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:15,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:15,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:15,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 587 [2024-12-02 11:20:15,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 541 transitions, 1099 flow. Second operand has 3 states, 3 states have (on average 565.0) internal successors, (1695), 3 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:15,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:15,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 587 [2024-12-02 11:20:15,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:15,630 INFO L124 PetriNetUnfolderBase]: 30/861 cut-off events. [2024-12-02 11:20:15,630 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2024-12-02 11:20:15,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 861 events. 30/861 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2464 event pairs, 10 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 728. Up to 44 conditions per place. [2024-12-02 11:20:15,636 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 14 selfloop transitions, 2 changer transitions 0/541 dead transitions. [2024-12-02 11:20:15,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 541 transitions, 1131 flow [2024-12-02 11:20:15,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:15,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1705 transitions. [2024-12-02 11:20:15,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681998864281658 [2024-12-02 11:20:15,640 INFO L175 Difference]: Start difference. First operand has 542 places, 541 transitions, 1099 flow. Second operand 3 states and 1705 transitions. [2024-12-02 11:20:15,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 541 transitions, 1131 flow [2024-12-02 11:20:15,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 541 transitions, 1130 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 11:20:15,667 INFO L231 Difference]: Finished difference. Result has 543 places, 541 transitions, 1106 flow [2024-12-02 11:20:15,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1106, PETRI_PLACES=543, PETRI_TRANSITIONS=541} [2024-12-02 11:20:15,669 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -32 predicate places. [2024-12-02 11:20:15,669 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 541 transitions, 1106 flow [2024-12-02 11:20:15,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.0) internal successors, (1695), 3 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:15,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:15,670 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] [2024-12-02 11:20:15,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 11:20:15,670 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:15,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:15,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1384715168, now seen corresponding path program 1 times [2024-12-02 11:20:15,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:15,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855389601] [2024-12-02 11:20:15,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:15,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:20:15,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:15,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855389601] [2024-12-02 11:20:15,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855389601] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:15,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:15,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:15,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914102113] [2024-12-02 11:20:15,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:15,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:15,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:15,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:15,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:15,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 587 [2024-12-02 11:20:15,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 541 transitions, 1106 flow. Second operand has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:15,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:15,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 587 [2024-12-02 11:20:15,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:16,138 INFO L124 PetriNetUnfolderBase]: 49/1445 cut-off events. [2024-12-02 11:20:16,139 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-12-02 11:20:16,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 1445 events. 49/1445 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 6225 event pairs, 10 based on Foata normal form. 0/1377 useless extension candidates. Maximal degree in co-relation 1517. Up to 38 conditions per place. [2024-12-02 11:20:16,145 INFO L140 encePairwiseOnDemand]: 585/587 looper letters, 10 selfloop transitions, 1 changer transitions 0/543 dead transitions. [2024-12-02 11:20:16,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 543 transitions, 1134 flow [2024-12-02 11:20:16,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1719 transitions. [2024-12-02 11:20:16,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9761499148211243 [2024-12-02 11:20:16,148 INFO L175 Difference]: Start difference. First operand has 543 places, 541 transitions, 1106 flow. Second operand 3 states and 1719 transitions. [2024-12-02 11:20:16,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 543 transitions, 1134 flow [2024-12-02 11:20:16,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 543 transitions, 1132 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 11:20:16,156 INFO L231 Difference]: Finished difference. Result has 543 places, 540 transitions, 1104 flow [2024-12-02 11:20:16,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1104, PETRI_PLACES=543, PETRI_TRANSITIONS=540} [2024-12-02 11:20:16,157 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -32 predicate places. [2024-12-02 11:20:16,157 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 540 transitions, 1104 flow [2024-12-02 11:20:16,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:16,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:16,158 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] [2024-12-02 11:20:16,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-02 11:20:16,158 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting whoop_wrapper_nvram_unlocked_ioctlErr0ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:16,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:16,159 INFO L85 PathProgramCache]: Analyzing trace with hash 424076854, now seen corresponding path program 1 times [2024-12-02 11:20:16,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:16,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060318987] [2024-12-02 11:20:16,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:16,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:16,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:20:16,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:16,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060318987] [2024-12-02 11:20:16,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060318987] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:16,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:16,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:20:16,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298363680] [2024-12-02 11:20:16,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:16,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:16,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:16,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:16,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:16,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 587 [2024-12-02 11:20:16,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 540 transitions, 1104 flow. Second operand has 3 states, 3 states have (on average 570.6666666666666) internal successors, (1712), 3 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:16,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:16,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 587 [2024-12-02 11:20:16,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:16,410 INFO L124 PetriNetUnfolderBase]: 23/800 cut-off events. [2024-12-02 11:20:16,410 INFO L125 PetriNetUnfolderBase]: For 11/13 co-relation queries the response was YES. [2024-12-02 11:20:16,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 800 events. 23/800 cut-off events. For 11/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2073 event pairs, 0 based on Foata normal form. 0/773 useless extension candidates. Maximal degree in co-relation 648. Up to 24 conditions per place. [2024-12-02 11:20:16,416 INFO L140 encePairwiseOnDemand]: 585/587 looper letters, 7 selfloop transitions, 1 changer transitions 1/540 dead transitions. [2024-12-02 11:20:16,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 540 transitions, 1123 flow [2024-12-02 11:20:16,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:16,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:20:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1717 transitions. [2024-12-02 11:20:16,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9750141964792731 [2024-12-02 11:20:16,419 INFO L175 Difference]: Start difference. First operand has 543 places, 540 transitions, 1104 flow. Second operand 3 states and 1717 transitions. [2024-12-02 11:20:16,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 540 transitions, 1123 flow [2024-12-02 11:20:16,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 540 transitions, 1122 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 11:20:16,427 INFO L231 Difference]: Finished difference. Result has 543 places, 539 transitions, 1103 flow [2024-12-02 11:20:16,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1103, PETRI_PLACES=543, PETRI_TRANSITIONS=539} [2024-12-02 11:20:16,428 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -32 predicate places. [2024-12-02 11:20:16,428 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 539 transitions, 1103 flow [2024-12-02 11:20:16,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.6666666666666) internal successors, (1712), 3 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:16,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:16,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:20:16,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-02 11:20:16,429 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:16,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:16,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1493992376, now seen corresponding path program 1 times [2024-12-02 11:20:16,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:16,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803872772] [2024-12-02 11:20:16,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:16,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:20:18,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:18,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803872772] [2024-12-02 11:20:18,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803872772] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:18,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:18,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 11:20:18,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166240753] [2024-12-02 11:20:18,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:18,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 11:20:18,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:18,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 11:20:18,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:20:18,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 523 out of 587 [2024-12-02 11:20:18,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 539 transitions, 1103 flow. Second operand has 10 states, 10 states have (on average 525.0) internal successors, (5250), 10 states have internal predecessors, (5250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:18,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:18,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 523 of 587 [2024-12-02 11:20:18,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:19,577 INFO L124 PetriNetUnfolderBase]: 303/2861 cut-off events. [2024-12-02 11:20:19,578 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-12-02 11:20:19,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3530 conditions, 2861 events. 303/2861 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 22091 event pairs, 47 based on Foata normal form. 0/2715 useless extension candidates. Maximal degree in co-relation 3322. Up to 323 conditions per place. [2024-12-02 11:20:19,590 INFO L140 encePairwiseOnDemand]: 553/587 looper letters, 67 selfloop transitions, 45 changer transitions 6/597 dead transitions. [2024-12-02 11:20:19,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 597 transitions, 1461 flow [2024-12-02 11:20:19,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 11:20:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-12-02 11:20:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5346 transitions. [2024-12-02 11:20:19,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9107325383304941 [2024-12-02 11:20:19,598 INFO L175 Difference]: Start difference. First operand has 543 places, 539 transitions, 1103 flow. Second operand 10 states and 5346 transitions. [2024-12-02 11:20:19,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 597 transitions, 1461 flow [2024-12-02 11:20:19,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 597 transitions, 1460 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 11:20:19,606 INFO L231 Difference]: Finished difference. Result has 560 places, 576 transitions, 1419 flow [2024-12-02 11:20:19,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1419, PETRI_PLACES=560, PETRI_TRANSITIONS=576} [2024-12-02 11:20:19,608 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -15 predicate places. [2024-12-02 11:20:19,608 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 576 transitions, 1419 flow [2024-12-02 11:20:19,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 525.0) internal successors, (5250), 10 states have internal predecessors, (5250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:19,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:19,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:20:19,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-02 11:20:19,610 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:19,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:19,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1075568129, now seen corresponding path program 1 times [2024-12-02 11:20:19,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:19,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392936758] [2024-12-02 11:20:19,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:19,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:20:26,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:26,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392936758] [2024-12-02 11:20:26,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392936758] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:26,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:26,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2024-12-02 11:20:26,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478711744] [2024-12-02 11:20:26,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:26,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-12-02 11:20:26,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:26,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-12-02 11:20:26,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2024-12-02 11:20:31,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 587 [2024-12-02 11:20:31,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 576 transitions, 1419 flow. Second operand has 35 states, 35 states have (on average 480.25714285714287) internal successors, (16809), 35 states have internal predecessors, (16809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:31,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:31,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 587 [2024-12-02 11:20:31,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:35,329 INFO L124 PetriNetUnfolderBase]: 1164/5780 cut-off events. [2024-12-02 11:20:35,329 INFO L125 PetriNetUnfolderBase]: For 977/1069 co-relation queries the response was YES. [2024-12-02 11:20:35,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9862 conditions, 5780 events. 1164/5780 cut-off events. For 977/1069 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 50750 event pairs, 72 based on Foata normal form. 24/5558 useless extension candidates. Maximal degree in co-relation 9609. Up to 980 conditions per place. [2024-12-02 11:20:35,348 INFO L140 encePairwiseOnDemand]: 520/587 looper letters, 276 selfloop transitions, 115 changer transitions 6/833 dead transitions. [2024-12-02 11:20:35,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 833 transitions, 3373 flow [2024-12-02 11:20:35,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-12-02 11:20:35,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2024-12-02 11:20:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 16995 transitions. [2024-12-02 11:20:35,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8272085665612071 [2024-12-02 11:20:35,358 INFO L175 Difference]: Start difference. First operand has 560 places, 576 transitions, 1419 flow. Second operand 35 states and 16995 transitions. [2024-12-02 11:20:35,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 833 transitions, 3373 flow [2024-12-02 11:20:35,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 833 transitions, 3373 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-02 11:20:35,375 INFO L231 Difference]: Finished difference. Result has 601 places, 654 transitions, 2295 flow [2024-12-02 11:20:35,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2295, PETRI_PLACES=601, PETRI_TRANSITIONS=654} [2024-12-02 11:20:35,376 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 26 predicate places. [2024-12-02 11:20:35,376 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 654 transitions, 2295 flow [2024-12-02 11:20:35,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 480.25714285714287) internal successors, (16809), 35 states have internal predecessors, (16809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:35,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:35,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:20:35,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-02 11:20:35,379 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:35,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:35,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2110446327, now seen corresponding path program 2 times [2024-12-02 11:20:35,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:35,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973393463] [2024-12-02 11:20:35,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 11:20:35,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:35,442 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 11:20:35,442 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 11:20:40,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:20:40,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:40,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973393463] [2024-12-02 11:20:40,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973393463] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:40,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:40,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2024-12-02 11:20:40,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164842345] [2024-12-02 11:20:40,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:40,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-12-02 11:20:40,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:40,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-12-02 11:20:40,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2024-12-02 11:20:46,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 587 [2024-12-02 11:20:46,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 654 transitions, 2295 flow. Second operand has 35 states, 35 states have (on average 480.25714285714287) internal successors, (16809), 35 states have internal predecessors, (16809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:46,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:20:46,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 587 [2024-12-02 11:20:46,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:20:50,761 INFO L124 PetriNetUnfolderBase]: 1742/7824 cut-off events. [2024-12-02 11:20:50,761 INFO L125 PetriNetUnfolderBase]: For 6329/6711 co-relation queries the response was YES. [2024-12-02 11:20:50,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17293 conditions, 7824 events. 1742/7824 cut-off events. For 6329/6711 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 72044 event pairs, 98 based on Foata normal form. 90/7610 useless extension candidates. Maximal degree in co-relation 16991. Up to 1249 conditions per place. [2024-12-02 11:20:50,811 INFO L140 encePairwiseOnDemand]: 520/587 looper letters, 377 selfloop transitions, 176 changer transitions 0/989 dead transitions. [2024-12-02 11:20:50,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 989 transitions, 5478 flow [2024-12-02 11:20:50,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-12-02 11:20:50,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-12-02 11:20:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 17517 transitions. [2024-12-02 11:20:50,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8289324247586598 [2024-12-02 11:20:50,826 INFO L175 Difference]: Start difference. First operand has 601 places, 654 transitions, 2295 flow. Second operand 36 states and 17517 transitions. [2024-12-02 11:20:50,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 989 transitions, 5478 flow [2024-12-02 11:20:50,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 989 transitions, 5441 flow, removed 0 selfloop flow, removed 19 redundant places. [2024-12-02 11:20:50,873 INFO L231 Difference]: Finished difference. Result has 632 places, 764 transitions, 3885 flow [2024-12-02 11:20:50,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=2258, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=3885, PETRI_PLACES=632, PETRI_TRANSITIONS=764} [2024-12-02 11:20:50,874 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 57 predicate places. [2024-12-02 11:20:50,874 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 764 transitions, 3885 flow [2024-12-02 11:20:50,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 480.25714285714287) internal successors, (16809), 35 states have internal predecessors, (16809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:20:50,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:20:50,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:20:50,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-02 11:20:50,877 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:20:50,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:50,879 INFO L85 PathProgramCache]: Analyzing trace with hash 188933319, now seen corresponding path program 3 times [2024-12-02 11:20:50,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:50,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336929022] [2024-12-02 11:20:50,879 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 11:20:50,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:50,945 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-12-02 11:20:50,945 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 11:20:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:20:55,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:55,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336929022] [2024-12-02 11:20:55,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336929022] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:55,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:55,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2024-12-02 11:20:55,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584089102] [2024-12-02 11:20:55,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:55,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-12-02 11:20:55,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:55,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-12-02 11:20:55,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2024-12-02 11:21:01,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 587 [2024-12-02 11:21:01,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 764 transitions, 3885 flow. Second operand has 35 states, 35 states have (on average 480.25714285714287) internal successors, (16809), 35 states have internal predecessors, (16809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:21:01,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:21:01,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 587 [2024-12-02 11:21:01,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:21:05,985 INFO L124 PetriNetUnfolderBase]: 2017/9329 cut-off events. [2024-12-02 11:21:05,985 INFO L125 PetriNetUnfolderBase]: For 18117/18681 co-relation queries the response was YES. [2024-12-02 11:21:06,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23812 conditions, 9329 events. 2017/9329 cut-off events. For 18117/18681 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 90155 event pairs, 151 based on Foata normal form. 178/9125 useless extension candidates. Maximal degree in co-relation 23478. Up to 1074 conditions per place. [2024-12-02 11:21:06,061 INFO L140 encePairwiseOnDemand]: 520/587 looper letters, 405 selfloop transitions, 234 changer transitions 0/1075 dead transitions. [2024-12-02 11:21:06,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 1075 transitions, 7649 flow [2024-12-02 11:21:06,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-12-02 11:21:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-12-02 11:21:06,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 17505 transitions. [2024-12-02 11:21:06,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8283645655877342 [2024-12-02 11:21:06,074 INFO L175 Difference]: Start difference. First operand has 632 places, 764 transitions, 3885 flow. Second operand 36 states and 17505 transitions. [2024-12-02 11:21:06,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 1075 transitions, 7649 flow [2024-12-02 11:21:06,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 1075 transitions, 7484 flow, removed 46 selfloop flow, removed 20 redundant places. [2024-12-02 11:21:06,251 INFO L231 Difference]: Finished difference. Result has 663 places, 865 transitions, 5839 flow [2024-12-02 11:21:06,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=3724, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=764, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=5839, PETRI_PLACES=663, PETRI_TRANSITIONS=865} [2024-12-02 11:21:06,252 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 88 predicate places. [2024-12-02 11:21:06,252 INFO L471 AbstractCegarLoop]: Abstraction has has 663 places, 865 transitions, 5839 flow [2024-12-02 11:21:06,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 480.25714285714287) internal successors, (16809), 35 states have internal predecessors, (16809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:21:06,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:21:06,254 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:21:06,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-02 11:21:06,255 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:21:06,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1346421843, now seen corresponding path program 4 times [2024-12-02 11:21:06,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:06,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583350570] [2024-12-02 11:21:06,257 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-02 11:21:06,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:06,357 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-02 11:21:06,357 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 11:21:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:21:12,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:12,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583350570] [2024-12-02 11:21:12,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583350570] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:12,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:12,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-12-02 11:21:12,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350473474] [2024-12-02 11:21:12,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:12,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-12-02 11:21:12,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:12,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-12-02 11:21:12,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2024-12-02 11:21:16,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 492 out of 587 [2024-12-02 11:21:16,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 865 transitions, 5839 flow. Second operand has 27 states, 27 states have (on average 494.037037037037) internal successors, (13339), 27 states have internal predecessors, (13339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:21:16,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:21:16,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 492 of 587 [2024-12-02 11:21:16,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:21:21,187 INFO L124 PetriNetUnfolderBase]: 2335/10820 cut-off events. [2024-12-02 11:21:21,187 INFO L125 PetriNetUnfolderBase]: For 37637/38256 co-relation queries the response was YES. [2024-12-02 11:21:21,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31586 conditions, 10820 events. 2335/10820 cut-off events. For 37637/38256 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 109036 event pairs, 126 based on Foata normal form. 349/10707 useless extension candidates. Maximal degree in co-relation 31236. Up to 1580 conditions per place. [2024-12-02 11:21:21,252 INFO L140 encePairwiseOnDemand]: 530/587 looper letters, 444 selfloop transitions, 323 changer transitions 0/1217 dead transitions. [2024-12-02 11:21:21,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 1217 transitions, 11164 flow [2024-12-02 11:21:21,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-12-02 11:21:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2024-12-02 11:21:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 16517 transitions. [2024-12-02 11:21:21,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8526663569253007 [2024-12-02 11:21:21,260 INFO L175 Difference]: Start difference. First operand has 663 places, 865 transitions, 5839 flow. Second operand 33 states and 16517 transitions. [2024-12-02 11:21:21,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 1217 transitions, 11164 flow [2024-12-02 11:21:21,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 676 places, 1217 transitions, 10867 flow, removed 130 selfloop flow, removed 19 redundant places. [2024-12-02 11:21:21,401 INFO L231 Difference]: Finished difference. Result has 696 places, 1000 transitions, 8608 flow [2024-12-02 11:21:21,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=5594, PETRI_DIFFERENCE_MINUEND_PLACES=644, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=865, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=8608, PETRI_PLACES=696, PETRI_TRANSITIONS=1000} [2024-12-02 11:21:21,402 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 121 predicate places. [2024-12-02 11:21:21,402 INFO L471 AbstractCegarLoop]: Abstraction has has 696 places, 1000 transitions, 8608 flow [2024-12-02 11:21:21,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 494.037037037037) internal successors, (13339), 27 states have internal predecessors, (13339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:21:21,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:21:21,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:21:21,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-12-02 11:21:21,404 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:21:21,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:21,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1462804941, now seen corresponding path program 5 times [2024-12-02 11:21:21,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:21,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344084774] [2024-12-02 11:21:21,407 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-12-02 11:21:21,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:21,478 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 11:21:21,478 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 11:21:26,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:21:26,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:26,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344084774] [2024-12-02 11:21:26,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344084774] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:26,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:26,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2024-12-02 11:21:26,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886963980] [2024-12-02 11:21:26,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:26,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-12-02 11:21:26,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:26,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-12-02 11:21:26,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2024-12-02 11:21:31,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 587 [2024-12-02 11:21:31,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 1000 transitions, 8608 flow. Second operand has 35 states, 35 states have (on average 480.25714285714287) internal successors, (16809), 35 states have internal predecessors, (16809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:21:31,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:21:31,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 587 [2024-12-02 11:21:31,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:21:36,966 INFO L124 PetriNetUnfolderBase]: 2433/11336 cut-off events. [2024-12-02 11:21:36,967 INFO L125 PetriNetUnfolderBase]: For 66624/67609 co-relation queries the response was YES. [2024-12-02 11:21:37,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37800 conditions, 11336 events. 2433/11336 cut-off events. For 66624/67609 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 116270 event pairs, 156 based on Foata normal form. 184/11018 useless extension candidates. Maximal degree in co-relation 37415. Up to 1734 conditions per place. [2024-12-02 11:21:37,100 INFO L140 encePairwiseOnDemand]: 520/587 looper letters, 658 selfloop transitions, 256 changer transitions 0/1353 dead transitions. [2024-12-02 11:21:37,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 1353 transitions, 14354 flow [2024-12-02 11:21:37,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-12-02 11:21:37,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-12-02 11:21:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 17539 transitions. [2024-12-02 11:21:37,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8299734999053568 [2024-12-02 11:21:37,108 INFO L175 Difference]: Start difference. First operand has 696 places, 1000 transitions, 8608 flow. Second operand 36 states and 17539 transitions. [2024-12-02 11:21:37,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 731 places, 1353 transitions, 14354 flow [2024-12-02 11:21:37,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 1353 transitions, 14260 flow, removed 11 selfloop flow, removed 12 redundant places. [2024-12-02 11:21:37,417 INFO L231 Difference]: Finished difference. Result has 733 places, 1074 transitions, 10831 flow [2024-12-02 11:21:37,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=8521, PETRI_DIFFERENCE_MINUEND_PLACES=684, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1000, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=758, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=10831, PETRI_PLACES=733, PETRI_TRANSITIONS=1074} [2024-12-02 11:21:37,418 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 158 predicate places. [2024-12-02 11:21:37,418 INFO L471 AbstractCegarLoop]: Abstraction has has 733 places, 1074 transitions, 10831 flow [2024-12-02 11:21:37,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 480.25714285714287) internal successors, (16809), 35 states have internal predecessors, (16809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:21:37,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:21:37,420 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:21:37,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-02 11:21:37,420 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:21:37,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:37,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1260468431, now seen corresponding path program 6 times [2024-12-02 11:21:37,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:37,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133671436] [2024-12-02 11:21:37,424 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-12-02 11:21:37,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:37,503 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-12-02 11:21:37,503 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 11:21:44,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:21:44,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:44,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133671436] [2024-12-02 11:21:44,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133671436] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:21:44,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720301970] [2024-12-02 11:21:44,207 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-12-02 11:21:44,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:21:44,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:21:44,209 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:21:44,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 11:21:44,703 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-12-02 11:21:44,703 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 11:21:44,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-12-02 11:21:44,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:21:45,039 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:21:45,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:21:45,104 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-12-02 11:21:45,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-12-02 11:21:45,221 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:21:45,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:21:45,282 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:21:45,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:21:45,339 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:21:45,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:21:45,394 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:21:45,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:21:45,447 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:21:45,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:21:45,497 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-12-02 11:21:45,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-12-02 11:21:45,604 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:21:45,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:21:45,664 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:21:45,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:21:45,718 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:21:45,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:21:45,772 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:21:45,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:21:45,815 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-12-02 11:21:45,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-12-02 11:21:45,889 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:21:45,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:21:45,935 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:21:45,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:21:45,974 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:21:45,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:21:46,013 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 11:21:46,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 11:21:47,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-12-02 11:21:47,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-12-02 11:21:47,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-12-02 11:21:47,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-12-02 11:21:47,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2024-12-02 11:21:47,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2024-12-02 11:21:47,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 68 [2024-12-02 11:21:47,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 78 [2024-12-02 11:21:47,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 103 [2024-12-02 11:21:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:21:47,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:21:52,014 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse1 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse3 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse5 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse4 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (let ((.cse2 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse2) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse2) .cse5 .cse2)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse6 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse6) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse6) .cse5 .cse6)) v_ArrVal_1581)) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse7 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse7) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse7) .cse5 .cse7)) v_ArrVal_1581)) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse8 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse8) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse8) .cse5 .cse8)) v_ArrVal_1581)) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0) (not (= (let ((.cse9 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse9) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse9) .cse5 .cse9)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse10 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse10) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse10) .cse5 .cse10)) v_ArrVal_1581)) (= 0 (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse11 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse11) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse11) .cse5 .cse11)) v_ArrVal_1581)) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse12 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse12) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse12) .cse5 .cse12)) v_ArrVal_1581)) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0))))) is different from false [2024-12-02 11:21:56,449 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse13 0)))) (let ((.cse1 (select .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse2 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse4 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse6 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse5 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1581 (Array Int Int))) (or (= 0 (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1))) (not (= v_ArrVal_1581 (let ((.cse3 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse3) .cse6 .cse3)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_1581 (let ((.cse7 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse7) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse7) .cse6 .cse7)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_1581 (let ((.cse8 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse8) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse8) .cse6 .cse8)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0) (not (= v_ArrVal_1581 (let ((.cse9 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse9) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse9) .cse6 .cse9)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_1581 (let ((.cse10 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse10) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse10) .cse6 .cse10)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0) (not (= v_ArrVal_1581 (let ((.cse11 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse11) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse11) .cse6 .cse11)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_1581 (let ((.cse12 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse12) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse12) .cse6 .cse12)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse13) 0) (not (= v_ArrVal_1581 (let ((.cse14 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse14) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse14) .cse6 .cse14)))))))))) is different from false [2024-12-02 11:22:01,356 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse13 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse6 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8 0) .cse13 0)))) (let ((.cse0 (select .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse1 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse3 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse5 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse4 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= v_ArrVal_1581 (let ((.cse2 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse2) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse2) .cse5 .cse2)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0) (not (= v_ArrVal_1581 (let ((.cse7 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse7) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse7) .cse5 .cse7)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8) 0) (not (= v_ArrVal_1581 (let ((.cse9 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse9) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse9) .cse5 .cse9)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_1581 (let ((.cse10 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse10) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse10) .cse5 .cse10)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0) (not (= v_ArrVal_1581 (let ((.cse11 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse11) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse11) .cse5 .cse11)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= v_ArrVal_1581 (let ((.cse12 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse12) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse12) .cse5 .cse12)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse13) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_1581 (let ((.cse14 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse14) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse14) .cse5 .cse14)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_1581 (let ((.cse15 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse15) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse15) .cse5 .cse15)))))))))) is different from false [2024-12-02 11:22:05,547 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse13 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse7 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse15 0) .cse13 0) .cse7 0)))) (let ((.cse1 (select .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse2 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse4 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse6 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse5 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0) (not (= (let ((.cse3 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse3) .cse6 .cse3)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= 0 (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse7)) (not (= (let ((.cse8 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse8) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse8) .cse6 .cse8)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (let ((.cse9 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse9) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse9) .cse6 .cse9)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse10 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse10) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse10) .cse6 .cse10)) v_ArrVal_1581)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse11 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse11) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse11) .cse6 .cse11)) v_ArrVal_1581)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0) (not (= (let ((.cse12 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse12) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse12) .cse6 .cse12)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse13) 0) (not (= (let ((.cse14 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse14) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse14) .cse6 .cse14)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse15) 0) (not (= (let ((.cse16 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse16) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse16) .cse6 .cse16)) v_ArrVal_1581)))))))) is different from false [2024-12-02 11:22:09,754 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse1 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse10 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse11 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse14 0) .cse1 0) .cse10 0) .cse11 0)))) (let ((.cse2 (select .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse3 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse5 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse7 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse6 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0) (not (= v_ArrVal_1581 (let ((.cse4 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse4) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse4) .cse7 .cse4)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0) (not (= v_ArrVal_1581 (let ((.cse8 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse8) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse8) .cse7 .cse8)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= v_ArrVal_1581 (let ((.cse9 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse9) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse9) .cse7 .cse9)))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse11) 0) (not (= v_ArrVal_1581 (let ((.cse12 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse12) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse12) .cse7 .cse12)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= v_ArrVal_1581 (let ((.cse13 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse13) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse13) .cse7 .cse13)))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse14) 0) (not (= v_ArrVal_1581 (let ((.cse15 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse15) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse15) .cse7 .cse15)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_1581 (let ((.cse16 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse16) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse16) .cse7 .cse16)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_1581 (let ((.cse17 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse17) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse17) .cse7 .cse17)))))))))) is different from false [2024-12-02 11:22:14,002 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse12 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse8 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse15 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse9 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse6 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16 0) .cse12 0) .cse8 0) .cse15 0) .cse9 0)))) (let ((.cse0 (select .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse1 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse3 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse5 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse4 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= v_ArrVal_1581 (let ((.cse2 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse2) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse2) .cse5 .cse2)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= v_ArrVal_1581 (let ((.cse7 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse7) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse7) .cse5 .cse7)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse9) 0) (not (= v_ArrVal_1581 (let ((.cse10 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse10) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse10) .cse5 .cse10)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0) (not (= v_ArrVal_1581 (let ((.cse11 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse11) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse11) .cse5 .cse11)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse12) 0) (not (= v_ArrVal_1581 (let ((.cse13 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse13) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse13) .cse5 .cse13)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= v_ArrVal_1581 (let ((.cse14 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse14) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse14) .cse5 .cse14)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse15) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16) 0) (not (= v_ArrVal_1581 (let ((.cse17 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse17) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse17) .cse5 .cse17)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= v_ArrVal_1581 (let ((.cse18 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse18) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse18) .cse5 .cse18)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))))))) is different from false [2024-12-02 11:22:18,407 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse8 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse18 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse1 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse11 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse13 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16 0) .cse8 0) .cse18 0) .cse1 0) .cse11 0) .cse13 0)))) (let ((.cse2 (select .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse3 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse5 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse7 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse6 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0) (not (= v_ArrVal_1581 (let ((.cse4 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse4) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse4) .cse7 .cse4)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8) 0) (not (= v_ArrVal_1581 (let ((.cse9 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse9) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse9) .cse7 .cse9)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0) (not (= v_ArrVal_1581 (let ((.cse10 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse10) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse10) .cse7 .cse10)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse11) 0) (not (= v_ArrVal_1581 (let ((.cse12 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse12) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse12) .cse7 .cse12)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse13) 0) (not (= v_ArrVal_1581 (let ((.cse14 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse14) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse14) .cse7 .cse14)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0) (not (= v_ArrVal_1581 (let ((.cse15 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse15) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse15) .cse7 .cse15)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16) 0) (not (= v_ArrVal_1581 (let ((.cse17 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse17) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse17) .cse7 .cse17)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse18) 0) (not (= v_ArrVal_1581 (let ((.cse19 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse19) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse19) .cse7 .cse19)))))))))) is different from false [2024-12-02 11:22:22,859 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) (.cse1 (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse16 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse17 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse13 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse11 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse20 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8 0) .cse1 0) .cse16 0) .cse17 0) .cse13 0) .cse11 0) .cse20 0)))) (let ((.cse2 (select .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse3 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse5 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse7 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse6 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0) (not (= (let ((.cse4 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse4) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse4) .cse7 .cse4)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8) 0) (not (= (let ((.cse9 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse9) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse9) .cse7 .cse9)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse10 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse10) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse10) .cse7 .cse10)) v_ArrVal_1581)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse11) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0) (not (= (let ((.cse12 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse12) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse12) .cse7 .cse12)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse13) 0) (not (= (let ((.cse14 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse14) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse14) .cse7 .cse14)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse15 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse15) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse15) .cse7 .cse15)) v_ArrVal_1581)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse17) 0) (not (= (let ((.cse18 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse18) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse18) .cse7 .cse18)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse19 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse19) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse19) .cse7 .cse19)) v_ArrVal_1581)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse20) 0))))))) is different from false [2024-12-02 11:22:27,189 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) (.cse19 (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse1 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse8 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse12 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse15 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse17 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10 0) .cse19 0) .cse1 0) .cse8 0) .cse12 0) .cse15 0) .cse17 0)))) (let ((.cse2 (select .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base|)) (.cse3 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.offset| 4)) (.cse5 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.offset| 5)) (.cse7 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.offset|)) (.cse6 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.offset| 6))) (and (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0) (not (= (let ((.cse4 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse4) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse4) .cse7 .cse4)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8) 0) (not (= (let ((.cse9 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse9) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse9) .cse7 .cse9)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10) 0) (not (= (let ((.cse11 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse11) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse11) .cse7 .cse11)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse12) 0) (not (= (let ((.cse13 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse13) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse13) .cse7 .cse13)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0) (not (= (let ((.cse14 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse14) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse14) .cse7 .cse14)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= 0 (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse15)) (not (= (let ((.cse16 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse16) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse16) .cse7 .cse16)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse17) 0) (not (= (let ((.cse18 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse18) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse18) .cse7 .cse18)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= 0 (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse19)) (not (= (let ((.cse20 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse20) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse20) .cse7 .cse20)) v_ArrVal_1581)))))))) is different from false [2024-12-02 11:22:27,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:22:27,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 133 [2024-12-02 11:22:27,299 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 11:22:27,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 130 [2024-12-02 11:22:27,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:22:27,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 324 treesize of output 290 [2024-12-02 11:22:27,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:22:27,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 133 [2024-12-02 11:22:27,487 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 11:22:27,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 130 [2024-12-02 11:22:27,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 2236 treesize of output 2174 [2024-12-02 11:22:27,559 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:22:27,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 1 [2024-12-02 11:22:27,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:22:27,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 133 [2024-12-02 11:22:27,662 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 11:22:27,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 130 [2024-12-02 11:22:27,676 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 11:22:27,677 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 11:22:27,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 154 [2024-12-02 11:22:27,710 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:22:27,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 1 [2024-12-02 11:22:27,722 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:22:27,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 1 [2024-12-02 11:22:27,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:22:27,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 139 treesize of output 131 [2024-12-02 11:22:27,845 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 11:22:27,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 126 [2024-12-02 11:22:27,859 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 11:22:27,860 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 11:22:27,860 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 11:22:27,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 52 [2024-12-02 11:22:27,884 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:22:27,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 1 [2024-12-02 11:22:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:22:51,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720301970] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:22:51,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:22:51,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20, 20] total 62 [2024-12-02 11:22:51,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741303283] [2024-12-02 11:22:51,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:22:51,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-12-02 11:22:51,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:22:51,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-12-02 11:22:51,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2583, Unknown=9, NotChecked=1008, Total=3906 [2024-12-02 11:22:51,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 587 [2024-12-02 11:22:51,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 733 places, 1074 transitions, 10831 flow. Second operand has 63 states, 63 states have (on average 454.6984126984127) internal successors, (28646), 63 states have internal predecessors, (28646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:22:51,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:22:51,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 587 [2024-12-02 11:22:51,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:23:18,648 INFO L124 PetriNetUnfolderBase]: 3379/15740 cut-off events. [2024-12-02 11:23:18,648 INFO L125 PetriNetUnfolderBase]: For 108545/109048 co-relation queries the response was YES. [2024-12-02 11:23:18,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52289 conditions, 15740 events. 3379/15740 cut-off events. For 108545/109048 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 175204 event pairs, 273 based on Foata normal form. 214/15205 useless extension candidates. Maximal degree in co-relation 51861. Up to 1677 conditions per place. [2024-12-02 11:23:18,805 INFO L140 encePairwiseOnDemand]: 533/587 looper letters, 800 selfloop transitions, 316 changer transitions 0/1527 dead transitions. [2024-12-02 11:23:18,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 764 places, 1527 transitions, 18667 flow [2024-12-02 11:23:18,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-12-02 11:23:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-12-02 11:23:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 14871 transitions. [2024-12-02 11:23:18,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7916844122657581 [2024-12-02 11:23:18,810 INFO L175 Difference]: Start difference. First operand has 733 places, 1074 transitions, 10831 flow. Second operand 32 states and 14871 transitions. [2024-12-02 11:23:18,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 764 places, 1527 transitions, 18667 flow [2024-12-02 11:23:19,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 744 places, 1527 transitions, 18114 flow, removed 240 selfloop flow, removed 20 redundant places. [2024-12-02 11:23:19,266 INFO L231 Difference]: Finished difference. Result has 762 places, 1209 transitions, 14139 flow [2024-12-02 11:23:19,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=10279, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1074, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=808, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=14139, PETRI_PLACES=762, PETRI_TRANSITIONS=1209} [2024-12-02 11:23:19,267 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 187 predicate places. [2024-12-02 11:23:19,267 INFO L471 AbstractCegarLoop]: Abstraction has has 762 places, 1209 transitions, 14139 flow [2024-12-02 11:23:19,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 454.6984126984127) internal successors, (28646), 63 states have internal predecessors, (28646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:23:19,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:23:19,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:23:19,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 11:23:19,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-12-02 11:23:19,470 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:23:19,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:23:19,473 INFO L85 PathProgramCache]: Analyzing trace with hash 462882173, now seen corresponding path program 7 times [2024-12-02 11:23:19,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:23:19,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697384976] [2024-12-02 11:23:19,473 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-12-02 11:23:19,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:23:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:23:26,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:23:26,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:23:26,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697384976] [2024-12-02 11:23:26,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697384976] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:23:26,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387397427] [2024-12-02 11:23:26,015 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-12-02 11:23:26,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:23:26,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:23:26,017 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:23:26,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 11:23:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:23:26,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 107 conjuncts are in the unsatisfiable core [2024-12-02 11:23:26,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:23:26,937 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:23:26,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:23:27,036 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:23:27,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:23:27,130 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:23:27,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:23:27,222 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:23:27,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:23:27,306 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:23:27,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:23:27,394 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:23:27,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:23:27,491 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:23:27,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:23:27,577 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:23:27,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:23:27,659 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:23:27,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:23:27,756 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:23:27,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:23:27,855 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:23:27,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:23:27,950 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:23:27,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:23:28,043 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:23:28,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:23:28,135 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:23:28,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:23:28,224 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:23:28,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:23:28,315 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:23:28,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:23:28,393 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 11:23:28,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 11:23:30,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-12-02 11:23:30,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-12-02 11:23:30,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-12-02 11:23:30,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-12-02 11:23:31,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2024-12-02 11:23:31,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2024-12-02 11:23:31,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 68 [2024-12-02 11:23:31,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 78 [2024-12-02 11:23:32,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 46 [2024-12-02 11:23:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:23:32,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:23:32,601 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))))) is different from false [2024-12-02 11:23:32,639 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))))) is different from false [2024-12-02 11:23:33,686 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse1 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse4 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse3 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2 0) .cse1 0) .cse4 0) .cse3 0)))) (and (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= 0 (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse3))) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse4) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))))) is different from false [2024-12-02 11:23:33,731 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse2 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse3 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse4 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse5 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0)))) (and (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse3) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse4) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse5) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))))) is different from false [2024-12-02 11:23:35,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:23:35,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 89 [2024-12-02 11:23:35,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:23:35,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 100 treesize of output 50 [2024-12-02 11:23:35,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-12-02 11:23:35,961 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:23:35,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-12-02 11:23:35,968 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:23:35,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-12-02 11:23:35,976 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:23:35,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-12-02 11:23:35,985 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:23:35,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-12-02 11:23:35,993 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:23:35,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-12-02 11:23:36,001 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:23:36,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-12-02 11:23:36,010 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:23:36,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-12-02 11:24:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:24:00,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387397427] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:24:00,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:24:00,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 20, 20] total 69 [2024-12-02 11:24:00,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666914235] [2024-12-02 11:24:00,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:24:00,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-12-02 11:24:00,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:24:00,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-12-02 11:24:00,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=3822, Unknown=83, NotChecked=524, Total=4830 [2024-12-02 11:24:01,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 587 [2024-12-02 11:24:01,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 762 places, 1209 transitions, 14139 flow. Second operand has 70 states, 70 states have (on average 438.7) internal successors, (30709), 70 states have internal predecessors, (30709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:24:01,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:24:01,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 587 [2024-12-02 11:24:01,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:24:21,883 INFO L124 PetriNetUnfolderBase]: 3512/15306 cut-off events. [2024-12-02 11:24:21,883 INFO L125 PetriNetUnfolderBase]: For 132108/132643 co-relation queries the response was YES. [2024-12-02 11:24:22,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57348 conditions, 15306 events. 3512/15306 cut-off events. For 132108/132643 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 166074 event pairs, 205 based on Foata normal form. 220/14804 useless extension candidates. Maximal degree in co-relation 56897. Up to 2643 conditions per place. [2024-12-02 11:24:22,090 INFO L140 encePairwiseOnDemand]: 509/587 looper letters, 679 selfloop transitions, 444 changer transitions 0/1518 dead transitions. [2024-12-02 11:24:22,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 798 places, 1518 transitions, 20704 flow [2024-12-02 11:24:22,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-12-02 11:24:22,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2024-12-02 11:24:22,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 16407 transitions. [2024-12-02 11:24:22,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7554215203278236 [2024-12-02 11:24:22,096 INFO L175 Difference]: Start difference. First operand has 762 places, 1209 transitions, 14139 flow. Second operand 37 states and 16407 transitions. [2024-12-02 11:24:22,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 798 places, 1518 transitions, 20704 flow [2024-12-02 11:24:22,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 786 places, 1518 transitions, 20065 flow, removed 307 selfloop flow, removed 12 redundant places. [2024-12-02 11:24:22,781 INFO L231 Difference]: Finished difference. Result has 798 places, 1289 transitions, 16729 flow [2024-12-02 11:24:22,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=13590, PETRI_DIFFERENCE_MINUEND_PLACES=750, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=367, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=787, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=16729, PETRI_PLACES=798, PETRI_TRANSITIONS=1289} [2024-12-02 11:24:22,781 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 223 predicate places. [2024-12-02 11:24:22,782 INFO L471 AbstractCegarLoop]: Abstraction has has 798 places, 1289 transitions, 16729 flow [2024-12-02 11:24:22,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 438.7) internal successors, (30709), 70 states have internal predecessors, (30709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:24:22,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:24:22,784 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:24:22,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-12-02 11:24:22,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-12-02 11:24:22,985 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:24:22,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:24:22,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1706730917, now seen corresponding path program 8 times [2024-12-02 11:24:22,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:24:22,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997467779] [2024-12-02 11:24:22,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 11:24:22,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:24:23,028 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 11:24:23,028 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 11:24:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:24:27,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:24:27,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997467779] [2024-12-02 11:24:27,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997467779] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:24:27,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086957011] [2024-12-02 11:24:27,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 11:24:27,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:24:27,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:24:27,959 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:24:27,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 11:24:28,436 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 11:24:28,437 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 11:24:28,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-12-02 11:24:28,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:24:29,133 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:24:29,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:24:29,233 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:24:29,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:24:29,338 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:24:29,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:24:29,427 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:24:29,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:24:29,521 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:24:29,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:24:29,618 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:24:29,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:24:29,696 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:24:29,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:24:29,788 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:24:29,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:24:29,880 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:24:29,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:24:29,969 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:24:29,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:24:30,062 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:24:30,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:24:30,146 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:24:30,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:24:30,239 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:24:30,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:24:30,315 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-12-02 11:24:30,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-12-02 11:24:30,496 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:24:30,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:24:30,582 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:24:30,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:24:30,660 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 11:24:30,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 11:24:32,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-12-02 11:24:33,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-12-02 11:24:33,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-12-02 11:24:33,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-12-02 11:24:33,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2024-12-02 11:24:33,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2024-12-02 11:24:33,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 68 [2024-12-02 11:24:34,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 78 [2024-12-02 11:24:34,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 103 [2024-12-02 11:24:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:24:34,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:24:38,960 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse1 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse3 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse5 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse4 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse2 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse2) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse2) .cse5 .cse2)) v_ArrVal_1970)) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0) (not (= (let ((.cse6 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse6) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse6) .cse5 .cse6)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (let ((.cse7 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse7) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse7) .cse5 .cse7)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse8 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse8) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse8) .cse5 .cse8)) v_ArrVal_1970)) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (let ((.cse9 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse9) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse9) .cse5 .cse9)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse10 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse10) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse10) .cse5 .cse10)) v_ArrVal_1970)) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (let ((.cse11 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse11) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse11) .cse5 .cse11)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0) (not (= (let ((.cse12 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse12) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse12) .cse5 .cse12)) v_ArrVal_1970)))))) is different from false [2024-12-02 11:24:43,364 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse6 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10 0)))) (let ((.cse0 (select .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse1 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse3 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse5 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse4 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse2 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse2) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse2) .cse5 .cse2)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse7 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse7) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse7) .cse5 .cse7)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0) (not (= (let ((.cse8 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse8) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse8) .cse5 .cse8)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse9 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse9) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse9) .cse5 .cse9)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (let ((.cse11 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse11) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse11) .cse5 .cse11)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse12 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse12) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse12) .cse5 .cse12)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (let ((.cse13 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse13) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse13) .cse5 .cse13)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0) (not (= (let ((.cse14 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse14) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse14) .cse5 .cse14)) v_ArrVal_1970)))))))) is different from false [2024-12-02 11:24:47,616 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse7 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse14 0) .cse7 0)))) (let ((.cse1 (select .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse2 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse4 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse6 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse5 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1970 (Array Int Int))) (or (= 0 (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1))) (not (= (let ((.cse3 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse3) .cse6 .cse3)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse7) 0) (not (= (let ((.cse8 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse8) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse8) .cse6 .cse8)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse9 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse9) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse9) .cse6 .cse9)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse10 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse10) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse10) .cse6 .cse10)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse11 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse11) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse11) .cse6 .cse11)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse12 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse12) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse12) .cse6 .cse12)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse13 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse13) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse13) .cse6 .cse13)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse14) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (let ((.cse15 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse15) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse15) .cse6 .cse15)) v_ArrVal_1970)))))))) is different from false [2024-12-02 11:24:51,833 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse13 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse7 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse6 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse15 0) .cse13 0) .cse7 0)))) (let ((.cse0 (select .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse1 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse3 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse5 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse4 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse2 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse2) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse2) .cse5 .cse2)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse7) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse8 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse8) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse8) .cse5 .cse8)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse9 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse9) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse9) .cse5 .cse9)) v_ArrVal_1970)) (= 0 (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0) (not (= (let ((.cse10 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse10) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse10) .cse5 .cse10)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse11 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse11) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse11) .cse5 .cse11)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse12 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse12) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse12) .cse5 .cse12)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse13) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse14 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse14) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse14) .cse5 .cse14)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse15) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (let ((.cse16 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse16) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse16) .cse5 .cse16)) v_ArrVal_1970)))))))) is different from false [2024-12-02 11:24:57,240 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse9 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse14 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse1 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse12 0) .cse9 0) .cse14 0) .cse1 0)))) (let ((.cse2 (select .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse3 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse5 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse7 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse6 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0) (not (= (let ((.cse4 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse4) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse4) .cse7 .cse4)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse8 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse8) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse8) .cse7 .cse8)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse9) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse10 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse10) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse10) .cse7 .cse10)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse11 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse11) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse11) .cse7 .cse11)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse12) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse13 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse13) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse13) .cse7 .cse13)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse14) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse15 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse15) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse15) .cse7 .cse15)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse16 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse16) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse16) .cse7 .cse16)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse17 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse17) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse17) .cse7 .cse17)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))))))) is different from false [2024-12-02 11:25:01,481 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse16 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse11 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse14 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse10 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8 0) .cse16 0) .cse11 0) .cse14 0) .cse10 0)))) (let ((.cse1 (select .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse2 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse4 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse6 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse5 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0) (not (= v_ArrVal_1970 (let ((.cse3 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse3) .cse6 .cse3)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse7 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse7) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse7) .cse6 .cse7)))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse9 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse9) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse9) .cse6 .cse9)))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse11) 0) (not (= v_ArrVal_1970 (let ((.cse12 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse12) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse12) .cse6 .cse12)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse13 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse13) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse13) .cse6 .cse13)))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse14) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_1970 (let ((.cse15 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse15) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse15) .cse6 .cse15)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16) 0) (not (= v_ArrVal_1970 (let ((.cse17 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse17) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse17) .cse6 .cse17)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0) (not (= v_ArrVal_1970 (let ((.cse18 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse18) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse18) .cse6 .cse18)))))))))) is different from false [2024-12-02 11:25:05,790 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse10 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse12 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse17 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse14 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse7 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse6 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16 0) .cse10 0) .cse12 0) .cse17 0) .cse14 0) .cse7 0)))) (let ((.cse0 (select .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse1 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse3 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse5 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse4 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse2 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse2) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse2) .cse5 .cse2)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse7) 0) (not (= (let ((.cse8 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse8) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse8) .cse5 .cse8)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse9 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse9) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse9) .cse5 .cse9)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse11 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse11) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse11) .cse5 .cse11)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse12) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse13 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse13) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse13) .cse5 .cse13)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse14) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse15 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse15) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse15) .cse5 .cse15)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse17) 0) (not (= (let ((.cse18 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse18) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse18) .cse5 .cse18)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse19 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse19) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse19) .cse5 .cse19)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))))))) is different from false [2024-12-02 11:25:10,139 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) (.cse20 (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse1 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse17 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse12 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse14 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse9 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10 0) .cse20 0) .cse1 0) .cse17 0) .cse12 0) .cse14 0) .cse9 0)))) (let ((.cse2 (select .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse3 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse5 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse7 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse6 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0) (not (= v_ArrVal_1970 (let ((.cse4 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse4) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse4) .cse7 .cse4)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse8 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse8) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse8) .cse7 .cse8)))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse9) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10) 0) (not (= v_ArrVal_1970 (let ((.cse11 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse11) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse11) .cse7 .cse11)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse12) 0) (not (= v_ArrVal_1970 (let ((.cse13 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse13) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse13) .cse7 .cse13)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse14) 0) (not (= v_ArrVal_1970 (let ((.cse15 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse15) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse15) .cse7 .cse15)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse16 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse16) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse16) .cse7 .cse16)))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse17) 0) (not (= v_ArrVal_1970 (let ((.cse18 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse18) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse18) .cse7 .cse18)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse19 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse19) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse19) .cse7 .cse19)))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse20) 0))))))) is different from false [2024-12-02 11:25:16,052 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) (.cse16 (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse18 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse14 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse8 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse7 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse20 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse6 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse11 0) .cse16 0) .cse18 0) .cse14 0) .cse8 0) .cse7 0) .cse20 0)))) (let ((.cse0 (select .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base|)) (.cse1 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.offset| 4)) (.cse3 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.offset| 5)) (.cse5 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.offset|)) (.cse4 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.offset| 6))) (and (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse2 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse2) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse2) .cse5 .cse2)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse7) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8) 0) (not (= v_ArrVal_1970 (let ((.cse9 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse9) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse9) .cse5 .cse9)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse10 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse10) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse10) .cse5 .cse10)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse11) 0) (not (= v_ArrVal_1970 (let ((.cse12 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse12) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse12) .cse5 .cse12)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse13 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse13) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse13) .cse5 .cse13)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse14) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse15 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse15) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse15) .cse5 .cse15)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse17 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse17) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse17) .cse5 .cse17)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse18) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse19 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse19) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse19) .cse5 .cse19)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse20) 0))))))) is different from false [2024-12-02 11:25:16,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:25:16,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 139 treesize of output 131 [2024-12-02 11:25:16,219 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 11:25:16,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 126 [2024-12-02 11:25:16,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:25:16,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1144 treesize of output 1106 [2024-12-02 11:25:16,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:25:16,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 133 [2024-12-02 11:25:16,392 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 11:25:16,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 130 [2024-12-02 11:25:16,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 2000 treesize of output 1938 [2024-12-02 11:25:16,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:25:16,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 133 [2024-12-02 11:25:16,593 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 11:25:16,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 130 [2024-12-02 11:25:16,610 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 11:25:16,610 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 11:25:16,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 86 [2024-12-02 11:25:16,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:25:16,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 133 [2024-12-02 11:25:16,721 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 11:25:16,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 130 [2024-12-02 11:25:16,740 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 11:25:16,741 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 11:25:16,741 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 11:25:16,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 52 [2024-12-02 11:25:16,762 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:25:16,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 1 [2024-12-02 11:25:16,773 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:25:16,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 1 [2024-12-02 11:25:16,782 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:25:16,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 1 [2024-12-02 11:25:16,794 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:25:16,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 1 [2024-12-02 11:25:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:25:52,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086957011] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:25:52,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:25:52,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 20, 20] total 70 [2024-12-02 11:25:52,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889527177] [2024-12-02 11:25:52,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:25:52,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-12-02 11:25:52,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:25:52,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-12-02 11:25:52,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=3440, Unknown=9, NotChecked=1152, Total=4970 [2024-12-02 11:25:52,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 587 [2024-12-02 11:25:52,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 798 places, 1289 transitions, 16729 flow. Second operand has 71 states, 71 states have (on average 425.1830985915493) internal successors, (30188), 71 states have internal predecessors, (30188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:25:52,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:25:52,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 587 [2024-12-02 11:25:52,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:27:00,383 INFO L124 PetriNetUnfolderBase]: 4721/20932 cut-off events. [2024-12-02 11:27:00,384 INFO L125 PetriNetUnfolderBase]: For 198543/199234 co-relation queries the response was YES. [2024-12-02 11:27:00,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79631 conditions, 20932 events. 4721/20932 cut-off events. For 198543/199234 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 244915 event pairs, 185 based on Foata normal form. 385/20278 useless extension candidates. Maximal degree in co-relation 79128. Up to 3451 conditions per place. [2024-12-02 11:27:00,699 INFO L140 encePairwiseOnDemand]: 508/587 looper letters, 1031 selfloop transitions, 757 changer transitions 0/2169 dead transitions. [2024-12-02 11:27:00,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 864 places, 2169 transitions, 32827 flow [2024-12-02 11:27:00,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-12-02 11:27:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2024-12-02 11:27:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 28874 transitions. [2024-12-02 11:27:00,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.73416562841669 [2024-12-02 11:27:00,709 INFO L175 Difference]: Start difference. First operand has 798 places, 1289 transitions, 16729 flow. Second operand 67 states and 28874 transitions. [2024-12-02 11:27:00,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 864 places, 2169 transitions, 32827 flow [2024-12-02 11:27:01,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 841 places, 2169 transitions, 32579 flow, removed 51 selfloop flow, removed 23 redundant places. [2024-12-02 11:27:01,926 INFO L231 Difference]: Finished difference. Result has 870 places, 1662 transitions, 26049 flow [2024-12-02 11:27:01,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=16507, PETRI_DIFFERENCE_MINUEND_PLACES=775, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=410, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=743, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=26049, PETRI_PLACES=870, PETRI_TRANSITIONS=1662} [2024-12-02 11:27:01,927 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 295 predicate places. [2024-12-02 11:27:01,927 INFO L471 AbstractCegarLoop]: Abstraction has has 870 places, 1662 transitions, 26049 flow [2024-12-02 11:27:01,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 425.1830985915493) internal successors, (30188), 71 states have internal predecessors, (30188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:27:01,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:27:01,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:27:01,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-12-02 11:27:02,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-12-02 11:27:02,130 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:27:02,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:27:02,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1890884779, now seen corresponding path program 9 times [2024-12-02 11:27:02,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:27:02,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914529449] [2024-12-02 11:27:02,133 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 11:27:02,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:27:02,316 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-12-02 11:27:02,316 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 11:27:08,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:27:08,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:27:08,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914529449] [2024-12-02 11:27:08,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914529449] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:27:08,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645710193] [2024-12-02 11:27:08,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 11:27:08,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:27:08,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:27:08,403 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:27:08,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 11:27:08,891 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-12-02 11:27:08,891 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 11:27:08,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-12-02 11:27:08,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:27:09,901 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:27:09,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:27:10,047 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:27:10,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:27:10,203 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:27:10,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:27:10,355 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:27:10,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:27:10,497 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:27:10,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:27:10,642 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:27:10,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:27:10,794 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:27:10,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:27:10,952 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:27:10,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:27:11,082 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-12-02 11:27:11,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-12-02 11:27:11,397 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:27:11,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:27:11,545 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:27:11,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:27:11,710 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:27:11,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:27:11,851 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:27:11,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:27:11,970 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:27:11,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:27:12,126 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:27:12,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:27:12,283 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:27:12,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:27:12,409 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 11:27:12,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 11:27:15,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-12-02 11:27:16,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-12-02 11:27:16,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-12-02 11:27:16,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-12-02 11:27:16,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2024-12-02 11:27:16,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2024-12-02 11:27:17,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 68 [2024-12-02 11:27:18,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 78 [2024-12-02 11:27:18,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 81 [2024-12-02 11:27:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:27:18,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:27:23,056 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse1 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse6 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse5 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse3 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse4 (select v_ArrVal_2166 .cse3)) (.cse2 (select v_ArrVal_2166 .cse5))) (or (not (= v_ArrVal_2166 (store (store (store (store .cse0 .cse1 .cse2) .cse3 .cse4) .cse5 .cse2) .cse6 .cse2))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= .cse4 .cse2))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse8 (select v_ArrVal_2166 .cse3)) (.cse7 (select v_ArrVal_2166 .cse5))) (or (not (= v_ArrVal_2166 (store (store (store (store .cse0 .cse1 .cse7) .cse3 .cse8) .cse5 .cse7) .cse6 .cse7))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= .cse8 .cse7))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse10 (select v_ArrVal_2166 .cse3)) (.cse9 (select v_ArrVal_2166 .cse5))) (or (not (= v_ArrVal_2166 (store (store (store (store .cse0 .cse1 .cse9) .cse3 .cse10) .cse5 .cse9) .cse6 .cse9))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0) (not (= .cse10 .cse9))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse12 (select v_ArrVal_2166 .cse3)) (.cse11 (select v_ArrVal_2166 .cse5))) (or (not (= v_ArrVal_2166 (store (store (store (store .cse0 .cse1 .cse11) .cse3 .cse12) .cse5 .cse11) .cse6 .cse11))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0) (not (= .cse12 .cse11))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse14 (select v_ArrVal_2166 .cse3)) (.cse13 (select v_ArrVal_2166 .cse5))) (or (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_2166 (store (store (store (store .cse0 .cse1 .cse13) .cse3 .cse14) .cse5 .cse13) .cse6 .cse13))) (not (= .cse14 .cse13))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse16 (select v_ArrVal_2166 .cse3)) (.cse15 (select v_ArrVal_2166 .cse5))) (or (not (= v_ArrVal_2166 (store (store (store (store .cse0 .cse1 .cse15) .cse3 .cse16) .cse5 .cse15) .cse6 .cse15))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= .cse16 .cse15))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse18 (select v_ArrVal_2166 .cse3)) (.cse17 (select v_ArrVal_2166 .cse5))) (or (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_2166 (store (store (store (store .cse0 .cse1 .cse17) .cse3 .cse18) .cse5 .cse17) .cse6 .cse17))) (not (= .cse18 .cse17))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse20 (select v_ArrVal_2166 .cse3)) (.cse19 (select v_ArrVal_2166 .cse5))) (or (not (= v_ArrVal_2166 (store (store (store (store .cse0 .cse1 .cse19) .cse3 .cse20) .cse5 .cse19) .cse6 .cse19))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0) (not (= .cse20 .cse19))))))) is different from false [2024-12-02 11:27:28,721 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse7 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10 0)))) (let ((.cse0 (select .cse7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse1 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse6 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse5 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse3 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse4 (select v_ArrVal_2166 .cse3)) (.cse2 (select v_ArrVal_2166 .cse5))) (or (not (= (store (store (store (store .cse0 .cse1 .cse2) .cse3 .cse4) .cse5 .cse2) .cse6 .cse2) v_ArrVal_2166)) (not (= .cse4 .cse2)) (= (select (select (store .cse7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse9 (select v_ArrVal_2166 .cse3)) (.cse8 (select v_ArrVal_2166 .cse5))) (or (= (select (select (store .cse7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (store (store (store (store .cse0 .cse1 .cse8) .cse3 .cse9) .cse5 .cse8) .cse6 .cse8) v_ArrVal_2166)) (not (= .cse9 .cse8))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse12 (select v_ArrVal_2166 .cse3)) (.cse11 (select v_ArrVal_2166 .cse5))) (or (= (select (select (store .cse7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10) 0) (not (= (store (store (store (store .cse0 .cse1 .cse11) .cse3 .cse12) .cse5 .cse11) .cse6 .cse11) v_ArrVal_2166)) (not (= .cse12 .cse11))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse14 (select v_ArrVal_2166 .cse3)) (.cse13 (select v_ArrVal_2166 .cse5))) (or (= (select (select (store .cse7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0) (not (= (store (store (store (store .cse0 .cse1 .cse13) .cse3 .cse14) .cse5 .cse13) .cse6 .cse13) v_ArrVal_2166)) (not (= .cse14 .cse13))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse16 (select v_ArrVal_2166 .cse3)) (.cse15 (select v_ArrVal_2166 .cse5))) (or (= (select (select (store .cse7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (store (store (store (store .cse0 .cse1 .cse15) .cse3 .cse16) .cse5 .cse15) .cse6 .cse15) v_ArrVal_2166)) (not (= .cse16 .cse15))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse18 (select v_ArrVal_2166 .cse3)) (.cse17 (select v_ArrVal_2166 .cse5))) (or (= (select (select (store .cse7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0) (not (= (store (store (store (store .cse0 .cse1 .cse17) .cse3 .cse18) .cse5 .cse17) .cse6 .cse17) v_ArrVal_2166)) (not (= .cse18 .cse17))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse20 (select v_ArrVal_2166 .cse3)) (.cse19 (select v_ArrVal_2166 .cse5))) (or (= (select (select (store .cse7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (store (store (store (store .cse0 .cse1 .cse19) .cse3 .cse20) .cse5 .cse19) .cse6 .cse19) v_ArrVal_2166)) (not (= .cse20 .cse19))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse22 (select v_ArrVal_2166 .cse3)) (.cse21 (select v_ArrVal_2166 .cse5))) (or (= (select (select (store .cse7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (store (store (store (store .cse0 .cse1 .cse21) .cse3 .cse22) .cse5 .cse21) .cse6 .cse21) v_ArrVal_2166)) (not (= .cse22 .cse21))))))))) is different from false [2024-12-02 11:27:34,184 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse11 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1 0) .cse11 0)))) (let ((.cse2 (select .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse3 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse8 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse7 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse5 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse6 (select v_ArrVal_2166 .cse5)) (.cse4 (select v_ArrVal_2166 .cse7))) (or (= 0 (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1)) (not (= (store (store (store (store .cse2 .cse3 .cse4) .cse5 .cse6) .cse7 .cse4) .cse8 .cse4) v_ArrVal_2166)) (not (= .cse6 .cse4))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse10 (select v_ArrVal_2166 .cse5)) (.cse9 (select v_ArrVal_2166 .cse7))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (store (store (store (store .cse2 .cse3 .cse9) .cse5 .cse10) .cse7 .cse9) .cse8 .cse9) v_ArrVal_2166)) (not (= .cse10 .cse9))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse13 (select v_ArrVal_2166 .cse5)) (.cse12 (select v_ArrVal_2166 .cse7))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse11) 0) (not (= (store (store (store (store .cse2 .cse3 .cse12) .cse5 .cse13) .cse7 .cse12) .cse8 .cse12) v_ArrVal_2166)) (not (= .cse13 .cse12))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse15 (select v_ArrVal_2166 .cse5)) (.cse14 (select v_ArrVal_2166 .cse7))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (store (store (store (store .cse2 .cse3 .cse14) .cse5 .cse15) .cse7 .cse14) .cse8 .cse14) v_ArrVal_2166)) (not (= .cse15 .cse14))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse17 (select v_ArrVal_2166 .cse5)) (.cse16 (select v_ArrVal_2166 .cse7))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0) (not (= (store (store (store (store .cse2 .cse3 .cse16) .cse5 .cse17) .cse7 .cse16) .cse8 .cse16) v_ArrVal_2166)) (not (= .cse17 .cse16))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse19 (select v_ArrVal_2166 .cse5)) (.cse18 (select v_ArrVal_2166 .cse7))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0) (not (= (store (store (store (store .cse2 .cse3 .cse18) .cse5 .cse19) .cse7 .cse18) .cse8 .cse18) v_ArrVal_2166)) (not (= .cse19 .cse18))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse21 (select v_ArrVal_2166 .cse5)) (.cse20 (select v_ArrVal_2166 .cse7))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0) (not (= (store (store (store (store .cse2 .cse3 .cse20) .cse5 .cse21) .cse7 .cse20) .cse8 .cse20) v_ArrVal_2166)) (not (= .cse21 .cse20))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse23 (select v_ArrVal_2166 .cse5)) (.cse22 (select v_ArrVal_2166 .cse7))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (store (store (store (store .cse2 .cse3 .cse22) .cse5 .cse23) .cse7 .cse22) .cse8 .cse22) v_ArrVal_2166)) (not (= .cse23 .cse22))))))))) is different from false [2024-12-02 11:27:38,473 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse17 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse12 0) .cse17 0)))) (let ((.cse3 (select .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base|)) (.cse4 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.offset| 4)) (.cse7 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.offset|)) (.cse6 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.offset| 6)) (.cse5 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.offset| 5))) (and (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse1 (select v_ArrVal_2166 .cse5)) (.cse2 (select v_ArrVal_2166 .cse6))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0) (not (= .cse1 .cse2)) (not (= v_ArrVal_2166 (store (store (store (store .cse3 .cse4 .cse2) .cse5 .cse1) .cse6 .cse2) .cse7 .cse2)))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse8 (select v_ArrVal_2166 .cse5)) (.cse9 (select v_ArrVal_2166 .cse6))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= .cse8 .cse9)) (not (= v_ArrVal_2166 (store (store (store (store .cse3 .cse4 .cse9) .cse5 .cse8) .cse6 .cse9) .cse7 .cse9)))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse10 (select v_ArrVal_2166 .cse5)) (.cse11 (select v_ArrVal_2166 .cse6))) (or (not (= .cse10 .cse11)) (not (= v_ArrVal_2166 (store (store (store (store .cse3 .cse4 .cse11) .cse5 .cse10) .cse6 .cse11) .cse7 .cse11))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse13 (select v_ArrVal_2166 .cse5)) (.cse14 (select v_ArrVal_2166 .cse6))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse12) 0) (not (= .cse13 .cse14)) (not (= v_ArrVal_2166 (store (store (store (store .cse3 .cse4 .cse14) .cse5 .cse13) .cse6 .cse14) .cse7 .cse14)))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse15 (select v_ArrVal_2166 .cse5)) (.cse16 (select v_ArrVal_2166 .cse6))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= .cse15 .cse16)) (not (= v_ArrVal_2166 (store (store (store (store .cse3 .cse4 .cse16) .cse5 .cse15) .cse6 .cse16) .cse7 .cse16)))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse18 (select v_ArrVal_2166 .cse5)) (.cse19 (select v_ArrVal_2166 .cse6))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse17) 0) (not (= .cse18 .cse19)) (not (= v_ArrVal_2166 (store (store (store (store .cse3 .cse4 .cse19) .cse5 .cse18) .cse6 .cse19) .cse7 .cse19)))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse20 (select v_ArrVal_2166 .cse5)) (.cse21 (select v_ArrVal_2166 .cse6))) (or (not (= .cse20 .cse21)) (not (= v_ArrVal_2166 (store (store (store (store .cse3 .cse4 .cse21) .cse5 .cse20) .cse6 .cse21) .cse7 .cse21))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse22 (select v_ArrVal_2166 .cse5)) (.cse23 (select v_ArrVal_2166 .cse6))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= .cse22 .cse23)) (not (= v_ArrVal_2166 (store (store (store (store .cse3 .cse4 .cse23) .cse5 .cse22) .cse6 .cse23) .cse7 .cse23)))))))))) is different from false [2024-12-02 11:27:44,259 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse12 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse7 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse17 0) .cse12 0)))) (let ((.cse0 (select .cse7 |c_~#nvram_mutex~0.base|)) (.cse1 (+ |c_~#nvram_mutex~0.offset| 4)) (.cse6 (+ 7 |c_~#nvram_mutex~0.offset|)) (.cse5 (+ 6 |c_~#nvram_mutex~0.offset|)) (.cse3 (+ 5 |c_~#nvram_mutex~0.offset|))) (and (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse4 (select v_ArrVal_2166 .cse3)) (.cse2 (select v_ArrVal_2166 .cse5))) (or (not (= (store (store (store (store .cse0 .cse1 .cse2) .cse3 .cse4) .cse5 .cse2) .cse6 .cse2) v_ArrVal_2166)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= .cse4 .cse2))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse9 (select v_ArrVal_2166 .cse3)) (.cse8 (select v_ArrVal_2166 .cse5))) (or (not (= (store (store (store (store .cse0 .cse1 .cse8) .cse3 .cse9) .cse5 .cse8) .cse6 .cse8) v_ArrVal_2166)) (not (= .cse9 .cse8)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse11 (select v_ArrVal_2166 .cse3)) (.cse10 (select v_ArrVal_2166 .cse5))) (or (not (= (store (store (store (store .cse0 .cse1 .cse10) .cse3 .cse11) .cse5 .cse10) .cse6 .cse10) v_ArrVal_2166)) (not (= .cse11 .cse10)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse12) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse14 (select v_ArrVal_2166 .cse3)) (.cse13 (select v_ArrVal_2166 .cse5))) (or (not (= (store (store (store (store .cse0 .cse1 .cse13) .cse3 .cse14) .cse5 .cse13) .cse6 .cse13) v_ArrVal_2166)) (not (= .cse14 .cse13)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse16 (select v_ArrVal_2166 .cse3)) (.cse15 (select v_ArrVal_2166 .cse5))) (or (not (= (store (store (store (store .cse0 .cse1 .cse15) .cse3 .cse16) .cse5 .cse15) .cse6 .cse15) v_ArrVal_2166)) (not (= .cse16 .cse15)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse17) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse19 (select v_ArrVal_2166 .cse3)) (.cse18 (select v_ArrVal_2166 .cse5))) (or (not (= (store (store (store (store .cse0 .cse1 .cse18) .cse3 .cse19) .cse5 .cse18) .cse6 .cse18) v_ArrVal_2166)) (not (= .cse19 .cse18)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse21 (select v_ArrVal_2166 .cse3)) (.cse20 (select v_ArrVal_2166 .cse5))) (or (not (= (store (store (store (store .cse0 .cse1 .cse20) .cse3 .cse21) .cse5 .cse20) .cse6 .cse20) v_ArrVal_2166)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= .cse21 .cse20))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse23 (select v_ArrVal_2166 .cse3)) (.cse22 (select v_ArrVal_2166 .cse5))) (or (not (= (store (store (store (store .cse0 .cse1 .cse22) .cse3 .cse23) .cse5 .cse22) .cse6 .cse22) v_ArrVal_2166)) (not (= .cse23 .cse22)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)))))))) is different from false [2024-12-02 11:27:48,574 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse13 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse24 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse7 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10 0) .cse13 0) .cse24 0)))) (let ((.cse2 (select .cse7 |c_~#nvram_mutex~0.base|)) (.cse3 (+ |c_~#nvram_mutex~0.offset| 4)) (.cse6 (+ 7 |c_~#nvram_mutex~0.offset|)) (.cse5 (+ 6 |c_~#nvram_mutex~0.offset|)) (.cse4 (+ 5 |c_~#nvram_mutex~0.offset|))) (and (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse0 (select v_ArrVal_2166 .cse4)) (.cse1 (select v_ArrVal_2166 .cse5))) (or (not (= .cse0 .cse1)) (not (= (store (store (store (store .cse2 .cse3 .cse1) .cse4 .cse0) .cse5 .cse1) .cse6 .cse1) v_ArrVal_2166)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse8 (select v_ArrVal_2166 .cse4)) (.cse9 (select v_ArrVal_2166 .cse5))) (or (not (= .cse8 .cse9)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10) 0) (not (= (store (store (store (store .cse2 .cse3 .cse9) .cse4 .cse8) .cse5 .cse9) .cse6 .cse9) v_ArrVal_2166))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse11 (select v_ArrVal_2166 .cse4)) (.cse12 (select v_ArrVal_2166 .cse5))) (or (not (= .cse11 .cse12)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse13) 0) (not (= (store (store (store (store .cse2 .cse3 .cse12) .cse4 .cse11) .cse5 .cse12) .cse6 .cse12) v_ArrVal_2166))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse14 (select v_ArrVal_2166 .cse4)) (.cse15 (select v_ArrVal_2166 .cse5))) (or (not (= .cse14 .cse15)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (store (store (store (store .cse2 .cse3 .cse15) .cse4 .cse14) .cse5 .cse15) .cse6 .cse15) v_ArrVal_2166))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse16 (select v_ArrVal_2166 .cse4)) (.cse17 (select v_ArrVal_2166 .cse5))) (or (not (= .cse16 .cse17)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (store (store (store (store .cse2 .cse3 .cse17) .cse4 .cse16) .cse5 .cse17) .cse6 .cse17) v_ArrVal_2166))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse18 (select v_ArrVal_2166 .cse4)) (.cse19 (select v_ArrVal_2166 .cse5))) (or (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0) (not (= .cse18 .cse19)) (not (= (store (store (store (store .cse2 .cse3 .cse19) .cse4 .cse18) .cse5 .cse19) .cse6 .cse19) v_ArrVal_2166))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse20 (select v_ArrVal_2166 .cse4)) (.cse21 (select v_ArrVal_2166 .cse5))) (or (not (= .cse20 .cse21)) (not (= (store (store (store (store .cse2 .cse3 .cse21) .cse4 .cse20) .cse5 .cse21) .cse6 .cse21) v_ArrVal_2166)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse22 (select v_ArrVal_2166 .cse4)) (.cse23 (select v_ArrVal_2166 .cse5))) (or (not (= .cse22 .cse23)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse24) 0) (not (= (store (store (store (store .cse2 .cse3 .cse23) .cse4 .cse22) .cse5 .cse23) .cse6 .cse23) v_ArrVal_2166))))))))) is different from false [2024-12-02 11:27:53,170 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse15 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse18 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse19 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse7 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8 0) .cse15 0) .cse18 0) .cse19 0)))) (let ((.cse2 (select .cse7 |c_~#nvram_mutex~0.base|)) (.cse3 (+ |c_~#nvram_mutex~0.offset| 4)) (.cse6 (+ 7 |c_~#nvram_mutex~0.offset|)) (.cse5 (+ 6 |c_~#nvram_mutex~0.offset|)) (.cse4 (+ 5 |c_~#nvram_mutex~0.offset|))) (and (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse0 (select v_ArrVal_2166 .cse4)) (.cse1 (select v_ArrVal_2166 .cse5))) (or (not (= .cse0 .cse1)) (not (= (store (store (store (store .cse2 .cse3 .cse1) .cse4 .cse0) .cse5 .cse1) .cse6 .cse1) v_ArrVal_2166)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse9 (select v_ArrVal_2166 .cse4)) (.cse10 (select v_ArrVal_2166 .cse5))) (or (not (= .cse9 .cse10)) (not (= (store (store (store (store .cse2 .cse3 .cse10) .cse4 .cse9) .cse5 .cse10) .cse6 .cse10) v_ArrVal_2166)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse11 (select v_ArrVal_2166 .cse4)) (.cse12 (select v_ArrVal_2166 .cse5))) (or (not (= .cse11 .cse12)) (not (= (store (store (store (store .cse2 .cse3 .cse12) .cse4 .cse11) .cse5 .cse12) .cse6 .cse12) v_ArrVal_2166)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse13 (select v_ArrVal_2166 .cse4)) (.cse14 (select v_ArrVal_2166 .cse5))) (or (not (= .cse13 .cse14)) (not (= (store (store (store (store .cse2 .cse3 .cse14) .cse4 .cse13) .cse5 .cse14) .cse6 .cse14) v_ArrVal_2166)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse15) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse16 (select v_ArrVal_2166 .cse4)) (.cse17 (select v_ArrVal_2166 .cse5))) (or (not (= .cse16 .cse17)) (not (= (store (store (store (store .cse2 .cse3 .cse17) .cse4 .cse16) .cse5 .cse17) .cse6 .cse17) v_ArrVal_2166)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse18) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse20 (select v_ArrVal_2166 .cse4)) (.cse21 (select v_ArrVal_2166 .cse5))) (or (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse19) 0) (not (= .cse20 .cse21)) (not (= (store (store (store (store .cse2 .cse3 .cse21) .cse4 .cse20) .cse5 .cse21) .cse6 .cse21) v_ArrVal_2166))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse22 (select v_ArrVal_2166 .cse4)) (.cse23 (select v_ArrVal_2166 .cse5))) (or (not (= .cse22 .cse23)) (not (= (store (store (store (store .cse2 .cse3 .cse23) .cse4 .cse22) .cse5 .cse23) .cse6 .cse23) v_ArrVal_2166)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse24 (select v_ArrVal_2166 .cse4)) (.cse25 (select v_ArrVal_2166 .cse5))) (or (not (= .cse24 .cse25)) (not (= (store (store (store (store .cse2 .cse3 .cse25) .cse4 .cse24) .cse5 .cse25) .cse6 .cse25) v_ArrVal_2166)) (= (select (select (store .cse7 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)))))))) is different from false [2024-12-02 11:27:57,682 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse24 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse10 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse19 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse16 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse13 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse2 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse24 0) .cse10 0) .cse19 0) .cse16 0) .cse13 0)))) (let ((.cse3 (select .cse2 |c_~#nvram_mutex~0.base|)) (.cse4 (+ |c_~#nvram_mutex~0.offset| 4)) (.cse7 (+ 7 |c_~#nvram_mutex~0.offset|)) (.cse6 (+ 6 |c_~#nvram_mutex~0.offset|)) (.cse5 (+ 5 |c_~#nvram_mutex~0.offset|))) (and (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse0 (select v_ArrVal_2166 .cse5)) (.cse1 (select v_ArrVal_2166 .cse6))) (or (not (= .cse0 .cse1)) (= (select (select (store .cse2 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (store (store (store (store .cse3 .cse4 .cse1) .cse5 .cse0) .cse6 .cse1) .cse7 .cse1) v_ArrVal_2166))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse8 (select v_ArrVal_2166 .cse5)) (.cse9 (select v_ArrVal_2166 .cse6))) (or (not (= .cse8 .cse9)) (= (select (select (store .cse2 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10) 0) (not (= (store (store (store (store .cse3 .cse4 .cse9) .cse5 .cse8) .cse6 .cse9) .cse7 .cse9) v_ArrVal_2166))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse11 (select v_ArrVal_2166 .cse5)) (.cse12 (select v_ArrVal_2166 .cse6))) (or (not (= .cse11 .cse12)) (= (select (select (store .cse2 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse13) 0) (not (= (store (store (store (store .cse3 .cse4 .cse12) .cse5 .cse11) .cse6 .cse12) .cse7 .cse12) v_ArrVal_2166))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse14 (select v_ArrVal_2166 .cse5)) (.cse15 (select v_ArrVal_2166 .cse6))) (or (not (= .cse14 .cse15)) (not (= (store (store (store (store .cse3 .cse4 .cse15) .cse5 .cse14) .cse6 .cse15) .cse7 .cse15) v_ArrVal_2166)) (= (select (select (store .cse2 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse17 (select v_ArrVal_2166 .cse5)) (.cse18 (select v_ArrVal_2166 .cse6))) (or (not (= .cse17 .cse18)) (not (= (store (store (store (store .cse3 .cse4 .cse18) .cse5 .cse17) .cse6 .cse18) .cse7 .cse18) v_ArrVal_2166)) (= (select (select (store .cse2 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse20 (select v_ArrVal_2166 .cse5)) (.cse21 (select v_ArrVal_2166 .cse6))) (or (= (select (select (store .cse2 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse19) 0) (not (= .cse20 .cse21)) (not (= (store (store (store (store .cse3 .cse4 .cse21) .cse5 .cse20) .cse6 .cse21) .cse7 .cse21) v_ArrVal_2166))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse22 (select v_ArrVal_2166 .cse5)) (.cse23 (select v_ArrVal_2166 .cse6))) (or (not (= .cse22 .cse23)) (not (= (store (store (store (store .cse3 .cse4 .cse23) .cse5 .cse22) .cse6 .cse23) .cse7 .cse23) v_ArrVal_2166)) (= (select (select (store .cse2 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse24) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse25 (select v_ArrVal_2166 .cse5)) (.cse26 (select v_ArrVal_2166 .cse6))) (or (not (= .cse25 .cse26)) (= (select (select (store .cse2 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0) (not (= (store (store (store (store .cse3 .cse4 .cse26) .cse5 .cse25) .cse6 .cse26) .cse7 .cse26) v_ArrVal_2166))))))))) is different from false [2024-12-02 11:28:03,135 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse24 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse25 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse9 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse15 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse14 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1 0) .cse24 0) .cse25 0) .cse9 0) .cse15 0) .cse14 0)))) (let ((.cse4 (select .cse0 |c_~#nvram_mutex~0.base|)) (.cse5 (+ |c_~#nvram_mutex~0.offset| 4)) (.cse8 (+ 7 |c_~#nvram_mutex~0.offset|)) (.cse7 (+ 6 |c_~#nvram_mutex~0.offset|)) (.cse6 (+ 5 |c_~#nvram_mutex~0.offset|))) (and (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse2 (select v_ArrVal_2166 .cse6)) (.cse3 (select v_ArrVal_2166 .cse7))) (or (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0) (not (= .cse2 .cse3)) (not (= v_ArrVal_2166 (store (store (store (store .cse4 .cse5 .cse3) .cse6 .cse2) .cse7 .cse3) .cse8 .cse3)))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse10 (select v_ArrVal_2166 .cse6)) (.cse11 (select v_ArrVal_2166 .cse7))) (or (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse9) 0) (not (= .cse10 .cse11)) (not (= v_ArrVal_2166 (store (store (store (store .cse4 .cse5 .cse11) .cse6 .cse10) .cse7 .cse11) .cse8 .cse11)))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse12 (select v_ArrVal_2166 .cse6)) (.cse13 (select v_ArrVal_2166 .cse7))) (or (not (= .cse12 .cse13)) (not (= v_ArrVal_2166 (store (store (store (store .cse4 .cse5 .cse13) .cse6 .cse12) .cse7 .cse13) .cse8 .cse13))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse14) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse16 (select v_ArrVal_2166 .cse6)) (.cse17 (select v_ArrVal_2166 .cse7))) (or (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse15) 0) (not (= .cse16 .cse17)) (not (= v_ArrVal_2166 (store (store (store (store .cse4 .cse5 .cse17) .cse6 .cse16) .cse7 .cse17) .cse8 .cse17)))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse18 (select v_ArrVal_2166 .cse6)) (.cse19 (select v_ArrVal_2166 .cse7))) (or (not (= .cse18 .cse19)) (not (= v_ArrVal_2166 (store (store (store (store .cse4 .cse5 .cse19) .cse6 .cse18) .cse7 .cse19) .cse8 .cse19))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse20 (select v_ArrVal_2166 .cse6)) (.cse21 (select v_ArrVal_2166 .cse7))) (or (not (= .cse20 .cse21)) (not (= v_ArrVal_2166 (store (store (store (store .cse4 .cse5 .cse21) .cse6 .cse20) .cse7 .cse21) .cse8 .cse21))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse22 (select v_ArrVal_2166 .cse6)) (.cse23 (select v_ArrVal_2166 .cse7))) (or (not (= .cse22 .cse23)) (not (= v_ArrVal_2166 (store (store (store (store .cse4 .cse5 .cse23) .cse6 .cse22) .cse7 .cse23) .cse8 .cse23))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse24) 0)))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse26 (select v_ArrVal_2166 .cse6)) (.cse27 (select v_ArrVal_2166 .cse7))) (or (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse25) 0) (not (= .cse26 .cse27)) (not (= v_ArrVal_2166 (store (store (store (store .cse4 .cse5 .cse27) .cse6 .cse26) .cse7 .cse27) .cse8 .cse27)))))))))) is different from false [2024-12-02 11:28:08,349 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) (.cse11 (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse20 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse3 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse23 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse19 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse28 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse2 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16 0) .cse11 0) .cse20 0) .cse3 0) .cse23 0) .cse19 0) .cse28 0)))) (let ((.cse4 (select .cse2 |c_~#nvram_mutex~0.base|)) (.cse5 (+ |c_~#nvram_mutex~0.offset| 4)) (.cse8 (+ 7 |c_~#nvram_mutex~0.offset|)) (.cse7 (+ 6 |c_~#nvram_mutex~0.offset|)) (.cse6 (+ 5 |c_~#nvram_mutex~0.offset|))) (and (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse0 (select v_ArrVal_2166 .cse6)) (.cse1 (select v_ArrVal_2166 .cse7))) (or (not (= .cse0 .cse1)) (= (select (select (store .cse2 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse3) 0) (not (= v_ArrVal_2166 (store (store (store (store .cse4 .cse5 .cse1) .cse6 .cse0) .cse7 .cse1) .cse8 .cse1)))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse9 (select v_ArrVal_2166 .cse6)) (.cse10 (select v_ArrVal_2166 .cse7))) (or (not (= .cse9 .cse10)) (= (select (select (store .cse2 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0) (not (= v_ArrVal_2166 (store (store (store (store .cse4 .cse5 .cse10) .cse6 .cse9) .cse7 .cse10) .cse8 .cse10)))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse12 (select v_ArrVal_2166 .cse6)) (.cse13 (select v_ArrVal_2166 .cse7))) (or (= (select (select (store .cse2 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse11) 0) (not (= .cse12 .cse13)) (not (= v_ArrVal_2166 (store (store (store (store .cse4 .cse5 .cse13) .cse6 .cse12) .cse7 .cse13) .cse8 .cse13)))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse14 (select v_ArrVal_2166 .cse6)) (.cse15 (select v_ArrVal_2166 .cse7))) (or (not (= .cse14 .cse15)) (= (select (select (store .cse2 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16) 0) (not (= v_ArrVal_2166 (store (store (store (store .cse4 .cse5 .cse15) .cse6 .cse14) .cse7 .cse15) .cse8 .cse15)))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse17 (select v_ArrVal_2166 .cse6)) (.cse18 (select v_ArrVal_2166 .cse7))) (or (not (= .cse17 .cse18)) (= (select (select (store .cse2 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse19) 0) (not (= v_ArrVal_2166 (store (store (store (store .cse4 .cse5 .cse18) .cse6 .cse17) .cse7 .cse18) .cse8 .cse18)))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse21 (select v_ArrVal_2166 .cse6)) (.cse22 (select v_ArrVal_2166 .cse7))) (or (= (select (select (store .cse2 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse20) 0) (not (= .cse21 .cse22)) (not (= v_ArrVal_2166 (store (store (store (store .cse4 .cse5 .cse22) .cse6 .cse21) .cse7 .cse22) .cse8 .cse22)))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse24 (select v_ArrVal_2166 .cse6)) (.cse25 (select v_ArrVal_2166 .cse7))) (or (= (select (select (store .cse2 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse23) 0) (not (= .cse24 .cse25)) (not (= v_ArrVal_2166 (store (store (store (store .cse4 .cse5 .cse25) .cse6 .cse24) .cse7 .cse25) .cse8 .cse25)))))) (forall ((v_ArrVal_2166 (Array Int Int))) (let ((.cse26 (select v_ArrVal_2166 .cse6)) (.cse27 (select v_ArrVal_2166 .cse7))) (or (not (= .cse26 .cse27)) (= (select (select (store .cse2 |c_~#nvram_mutex~0.base| v_ArrVal_2166) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse28) 0) (not (= v_ArrVal_2166 (store (store (store (store .cse4 .cse5 .cse27) .cse6 .cse26) .cse7 .cse27) .cse8 .cse27)))))))))) is different from false [2024-12-02 11:28:08,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:28:08,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 133 [2024-12-02 11:28:08,591 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 11:28:08,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 130 [2024-12-02 11:28:08,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:28:08,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 324 treesize of output 290 [2024-12-02 11:28:08,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:28:08,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 133 [2024-12-02 11:28:08,850 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 11:28:08,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 130 [2024-12-02 11:28:08,901 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 11:28:08,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 138 [2024-12-02 11:28:09,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:28:09,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 133 [2024-12-02 11:28:09,112 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 11:28:09,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 130 [2024-12-02 11:28:09,156 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 11:28:09,157 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 11:28:09,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 86 [2024-12-02 11:28:09,205 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:28:09,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 1 [2024-12-02 11:28:09,224 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:28:09,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 1 [2024-12-02 11:28:09,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:28:09,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 139 treesize of output 131 [2024-12-02 11:28:09,389 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 11:28:09,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 126 [2024-12-02 11:28:09,409 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 11:28:09,409 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 11:28:09,410 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 11:28:09,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 52 [2024-12-02 11:28:09,463 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:28:09,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 1 [2024-12-02 11:28:09,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:28:09,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 133 [2024-12-02 11:28:09,688 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 11:28:09,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 130 [2024-12-02 11:28:09,715 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 11:28:09,715 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 11:28:09,716 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 11:28:09,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 52 [2024-12-02 11:29:11,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:29:11,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645710193] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:29:11,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:29:11,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 20, 20] total 70 [2024-12-02 11:29:11,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125419247] [2024-12-02 11:29:11,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:29:11,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-12-02 11:29:11,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:29:11,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-12-02 11:29:11,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=3328, Unknown=10, NotChecked=1270, Total=4970 [2024-12-02 11:29:12,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 587 [2024-12-02 11:29:12,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 870 places, 1662 transitions, 26049 flow. Second operand has 71 states, 71 states have (on average 425.1830985915493) internal successors, (30188), 71 states have internal predecessors, (30188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:29:12,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:29:12,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 587 [2024-12-02 11:29:12,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:30:53,588 INFO L124 PetriNetUnfolderBase]: 5359/24224 cut-off events. [2024-12-02 11:30:53,588 INFO L125 PetriNetUnfolderBase]: For 305475/306383 co-relation queries the response was YES. [2024-12-02 11:30:53,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100361 conditions, 24224 events. 5359/24224 cut-off events. For 305475/306383 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 293824 event pairs, 156 based on Foata normal form. 532/23613 useless extension candidates. Maximal degree in co-relation 99831. Up to 2853 conditions per place. [2024-12-02 11:30:54,049 INFO L140 encePairwiseOnDemand]: 503/587 looper letters, 826 selfloop transitions, 1073 changer transitions 0/2280 dead transitions. [2024-12-02 11:30:54,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 922 places, 2280 transitions, 41325 flow [2024-12-02 11:30:54,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-12-02 11:30:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2024-12-02 11:30:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 22812 transitions. [2024-12-02 11:30:54,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7332454758766995 [2024-12-02 11:30:54,058 INFO L175 Difference]: Start difference. First operand has 870 places, 1662 transitions, 26049 flow. Second operand 53 states and 22812 transitions. [2024-12-02 11:30:54,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 922 places, 2280 transitions, 41325 flow [2024-12-02 11:30:56,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 902 places, 2280 transitions, 40480 flow, removed 402 selfloop flow, removed 20 redundant places. [2024-12-02 11:30:56,428 INFO L231 Difference]: Finished difference. Result has 928 places, 1967 transitions, 36416 flow [2024-12-02 11:30:56,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=25294, PETRI_DIFFERENCE_MINUEND_PLACES=850, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=801, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=778, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=36416, PETRI_PLACES=928, PETRI_TRANSITIONS=1967} [2024-12-02 11:30:56,430 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 353 predicate places. [2024-12-02 11:30:56,430 INFO L471 AbstractCegarLoop]: Abstraction has has 928 places, 1967 transitions, 36416 flow [2024-12-02 11:30:56,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 425.1830985915493) internal successors, (30188), 71 states have internal predecessors, (30188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:30:56,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:30:56,433 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:30:56,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-12-02 11:30:56,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-12-02 11:30:56,633 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:30:56,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:30:56,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1659466949, now seen corresponding path program 10 times [2024-12-02 11:30:56,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:30:56,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159947796] [2024-12-02 11:30:56,636 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-02 11:30:56,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:30:56,703 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-02 11:30:56,703 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 11:31:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:31:05,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:31:05,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159947796] [2024-12-02 11:31:05,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159947796] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:31:05,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402281342] [2024-12-02 11:31:05,392 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-02 11:31:05,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:31:05,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:31:05,394 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:31:05,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 11:31:05,926 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-02 11:31:05,926 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 11:31:05,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-12-02 11:31:05,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:31:07,703 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:31:07,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:31:07,956 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:31:07,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:31:08,246 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 11:31:08,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 11:31:08,504 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-12-02 11:31:08,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-12-02 11:31:09,198 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-12-02 11:31:09,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-12-02 11:31:09,617 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-12-02 11:31:09,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2024-12-02 11:31:10,228 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-12-02 11:31:10,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2024-12-02 11:31:10,882 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-12-02 11:31:10,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-12-02 11:31:11,349 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-12-02 11:31:11,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-12-02 11:31:11,748 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-12-02 11:31:11,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2024-12-02 11:31:12,420 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-12-02 11:31:12,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-12-02 11:31:12,890 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-12-02 11:31:12,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-12-02 11:31:13,386 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-12-02 11:31:13,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-12-02 11:31:14,366 INFO L349 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2024-12-02 11:31:14,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2024-12-02 11:31:15,347 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2024-12-02 11:31:15,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2024-12-02 11:31:16,094 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2024-12-02 11:31:16,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2024-12-02 11:31:16,726 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-12-02 11:31:16,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-12-02 11:31:23,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-12-02 11:31:23,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-12-02 11:31:24,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-12-02 11:31:24,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-12-02 11:31:24,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2024-12-02 11:31:25,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2024-12-02 11:31:25,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 68 [2024-12-02 11:31:26,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 78 [2024-12-02 11:31:26,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 46 [2024-12-02 11:31:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:31:27,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:31:27,842 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= 0 (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)))) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0))))) is different from false [2024-12-02 11:31:27,933 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse1 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0))))) is different from false [2024-12-02 11:31:28,030 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse3 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse2 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1 0) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse3) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))))) is different from false [2024-12-02 11:31:28,924 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse4 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse1 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse3 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse2 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse5 0) .cse4 0) .cse1 0) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= 0 (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)))) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse3) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse4) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse5) 0))))) is different from false [2024-12-02 11:31:30,200 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse3 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse4 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse6 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse1 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse5 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2 0) .cse3 0) .cse4 0) .cse6 0) .cse1 0) .cse5 0)))) (and (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse3) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse4) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse5) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse6) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_2360) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))))) is different from false [2024-12-02 11:31:35,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:31:35,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 91 [2024-12-02 11:31:35,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:31:35,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 104 treesize of output 52 [2024-12-02 11:31:35,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-12-02 11:31:35,561 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:31:35,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-12-02 11:31:35,575 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:31:35,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-12-02 11:31:35,589 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:31:35,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-12-02 11:31:35,602 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:31:35,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-12-02 11:31:35,615 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:31:35,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 1 [2024-12-02 11:31:35,627 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:31:35,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-12-02 11:31:35,642 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:31:35,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-12-02 11:31:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:31:48,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402281342] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:31:48,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:31:48,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22, 22] total 62 [2024-12-02 11:31:48,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68082263] [2024-12-02 11:31:48,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:31:48,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-12-02 11:31:48,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:31:48,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-12-02 11:31:48,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=2909, Unknown=75, NotChecked=580, Total=3906 [2024-12-02 11:31:48,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 587 [2024-12-02 11:31:48,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 928 places, 1967 transitions, 36416 flow. Second operand has 63 states, 63 states have (on average 438.6984126984127) internal successors, (27638), 63 states have internal predecessors, (27638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:31:48,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:31:48,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 587 [2024-12-02 11:31:48,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:32:39,531 INFO L124 PetriNetUnfolderBase]: 5607/24416 cut-off events. [2024-12-02 11:32:39,531 INFO L125 PetriNetUnfolderBase]: For 410580/411260 co-relation queries the response was YES. [2024-12-02 11:32:39,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114923 conditions, 24416 events. 5607/24416 cut-off events. For 410580/411260 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 292820 event pairs, 401 based on Foata normal form. 364/23551 useless extension candidates. Maximal degree in co-relation 114365. Up to 4557 conditions per place. [2024-12-02 11:32:40,061 INFO L140 encePairwiseOnDemand]: 529/587 looper letters, 1285 selfloop transitions, 799 changer transitions 0/2479 dead transitions. [2024-12-02 11:32:40,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 970 places, 2479 transitions, 49742 flow [2024-12-02 11:32:40,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-12-02 11:32:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2024-12-02 11:32:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 19133 transitions. [2024-12-02 11:32:40,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.758012757022305 [2024-12-02 11:32:40,067 INFO L175 Difference]: Start difference. First operand has 928 places, 1967 transitions, 36416 flow. Second operand 43 states and 19133 transitions. [2024-12-02 11:32:40,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 970 places, 2479 transitions, 49742 flow [2024-12-02 11:32:44,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 944 places, 2479 transitions, 49176 flow, removed 210 selfloop flow, removed 26 redundant places. [2024-12-02 11:32:44,192 INFO L231 Difference]: Finished difference. Result has 969 places, 2159 transitions, 43754 flow [2024-12-02 11:32:44,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=35894, PETRI_DIFFERENCE_MINUEND_PLACES=902, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1967, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=623, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=43754, PETRI_PLACES=969, PETRI_TRANSITIONS=2159} [2024-12-02 11:32:44,193 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 394 predicate places. [2024-12-02 11:32:44,194 INFO L471 AbstractCegarLoop]: Abstraction has has 969 places, 2159 transitions, 43754 flow [2024-12-02 11:32:44,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 438.6984126984127) internal successors, (27638), 63 states have internal predecessors, (27638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:32:44,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:32:44,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:32:44,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-12-02 11:32:44,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-12-02 11:32:44,397 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-12-02 11:32:44,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:32:44,401 INFO L85 PathProgramCache]: Analyzing trace with hash 478591421, now seen corresponding path program 11 times [2024-12-02 11:32:44,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:32:44,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674731472] [2024-12-02 11:32:44,401 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-12-02 11:32:44,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:32:44,492 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 11:32:44,492 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 11:32:53,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:32:53,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:32:53,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674731472] [2024-12-02 11:32:53,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674731472] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:32:53,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686788970] [2024-12-02 11:32:53,669 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-12-02 11:32:53,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:32:53,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:32:53,671 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:32:53,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe98061-1e1b-4f29-bd8e-dbc00c33f005/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 11:32:54,252 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 11:32:54,252 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 11:32:54,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-12-02 11:32:54,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:32:56,092 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-12-02 11:32:56,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-12-02 11:32:56,812 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-12-02 11:32:56,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-12-02 11:32:57,277 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-12-02 11:32:57,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-12-02 11:32:57,738 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-12-02 11:32:57,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-12-02 11:32:58,734 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2024-12-02 11:32:58,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2024-12-02 11:32:59,453 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2024-12-02 11:32:59,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2024-12-02 11:33:00,169 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2024-12-02 11:33:00,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2024-12-02 11:33:00,891 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2024-12-02 11:33:00,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2024-12-02 11:33:01,606 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2024-12-02 11:33:01,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2024-12-02 11:33:02,321 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2024-12-02 11:33:02,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2024-12-02 11:33:03,092 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2024-12-02 11:33:03,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2024-12-02 11:33:03,725 INFO L349 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2024-12-02 11:33:03,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2024-12-02 11:33:04,706 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2024-12-02 11:33:04,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2024-12-02 11:33:05,452 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2024-12-02 11:33:05,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2024-12-02 11:33:06,169 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2024-12-02 11:33:06,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2024-12-02 11:33:06,905 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2024-12-02 11:33:06,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2024-12-02 11:33:07,539 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-12-02 11:33:07,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-12-02 11:33:13,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-12-02 11:33:13,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-12-02 11:33:13,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-12-02 11:33:14,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-12-02 11:33:14,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2024-12-02 11:33:16,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2024-12-02 11:33:17,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 68 [2024-12-02 11:33:17,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 78 [2024-12-02 11:33:18,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 46 [2024-12-02 11:33:18,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:33:18,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:33:19,404 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= 0 (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)))) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))))) is different from false [2024-12-02 11:33:22,009 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse2 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse3 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1 0) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse3) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0))))) is different from false [2024-12-02 11:33:23,264 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse2 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse1 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse4 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse3 0) .cse2 0) .cse1 0) .cse4 0)))) (and (forall ((v_ArrVal_2554 (Array Int Int))) (= 0 (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= 0 (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse3))) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse4) 0))))) is different from false [2024-12-02 11:33:25,755 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) (.cse1 (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse3 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse6 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse5 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse2 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse4 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse7 0) .cse1 0) .cse3 0) .cse6 0) .cse5 0) .cse2 0) .cse4 0)))) (and (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse3) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse4) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse5) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse6) 0)) (forall ((v_ArrVal_2554 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_2554) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse7) 0))))) is different from false [2024-12-02 11:33:25,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:33:25,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 91 [2024-12-02 11:33:25,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:33:25,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 104 treesize of output 52 [2024-12-02 11:33:25,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-12-02 11:33:25,925 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:33:25,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-12-02 11:33:25,941 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:33:25,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-12-02 11:33:25,956 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:33:25,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 1 [2024-12-02 11:33:25,972 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:33:25,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-12-02 11:33:25,987 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:33:25,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-12-02 11:33:26,003 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:33:26,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-12-02 11:33:26,018 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-12-02 11:33:26,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-12-02 11:33:46,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 11:33:46,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686788970] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:33:46,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:33:46,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 22] total 68 [2024-12-02 11:33:46,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309724777] [2024-12-02 11:33:46,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:33:46,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-12-02 11:33:46,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:33:46,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-12-02 11:33:46,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=3703, Unknown=109, NotChecked=516, Total=4692 [2024-12-02 11:33:46,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 587 [2024-12-02 11:33:46,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 969 places, 2159 transitions, 43754 flow. Second operand has 69 states, 69 states have (on average 434.8695652173913) internal successors, (30006), 69 states have internal predecessors, (30006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:33:46,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:33:46,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 587 [2024-12-02 11:33:46,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand