/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-driver-races/char_generic_nvram_nvram_llseek_write_nvram.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:20:54,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:20:54,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:20:54,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:20:54,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:20:54,859 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:20:54,869 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:20:54,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:20:54,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:20:54,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:20:54,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:20:54,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:20:54,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:20:54,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:20:54,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:20:54,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:20:54,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:20:54,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:20:54,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:20:54,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:20:54,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:20:54,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:20:54,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:20:54,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:20:54,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:20:54,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:20:54,906 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:20:54,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:20:54,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:20:54,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:20:54,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:20:54,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:20:54,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:20:54,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:20:54,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:20:54,912 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:20:54,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:20:54,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:20:54,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:20:54,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:20:54,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:20:54,915 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 03:20:54,941 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:20:54,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:20:54,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:20:54,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:20:54,943 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:20:54,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:20:54,943 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:20:54,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:20:54,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:20:54,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:20:54,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:20:54,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:20:54,945 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:20:54,945 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:20:54,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:20:54,945 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:20:54,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:20:54,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:20:54,945 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:20:54,945 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:20:54,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:20:54,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:20:54,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:20:54,946 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:20:54,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:20:54,946 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:20:54,946 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:20:54,946 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:20:54,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 03:20:55,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:20:55,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:20:55,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:20:55,259 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:20:55,259 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:20:55,260 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-driver-races/char_generic_nvram_nvram_llseek_write_nvram.i [2022-12-13 03:20:56,348 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:20:56,763 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:20:56,764 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-driver-races/char_generic_nvram_nvram_llseek_write_nvram.i [2022-12-13 03:20:56,809 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd933b04/44d703ac106744cab47f2c30c9f3fc89/FLAGb65d3301e [2022-12-13 03:20:56,827 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd933b04/44d703ac106744cab47f2c30c9f3fc89 [2022-12-13 03:20:56,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:20:56,831 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:20:56,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:20:56,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:20:56,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:20:56,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:20:56" (1/1) ... [2022-12-13 03:20:56,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3abc3c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:20:56, skipping insertion in model container [2022-12-13 03:20:56,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:20:56" (1/1) ... [2022-12-13 03:20:56,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:20:56,912 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:20:57,181 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-driver-races/char_generic_nvram_nvram_llseek_write_nvram.i[5469,5482] [2022-12-13 03:20:57,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:20:57,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:20:57,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:20:57,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:20:57,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:20:57,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:20:57,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:20:57,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:20:57,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:20:57,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:20:57,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:20:57,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:20:57,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:20:57,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:20:57,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:20:57,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:20:57,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:20:57,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:20:57,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:20:57,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:20:57,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:20:57,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:20:58,189 WARN L623 FunctionHandler]: Unknown extern function cpu_relax [2022-12-13 03:20:58,193 WARN L623 FunctionHandler]: Unknown extern function smp_rmb [2022-12-13 03:20:58,197 WARN L623 FunctionHandler]: Unknown extern function smp_rmb [2022-12-13 03:20:58,204 WARN L623 FunctionHandler]: Unknown extern function smp_rmb [2022-12-13 03:20:58,304 WARN L623 FunctionHandler]: Unknown extern function set_normalized_timespec [2022-12-13 03:20:58,314 WARN L623 FunctionHandler]: Unknown extern function set_normalized_timespec [2022-12-13 03:20:58,439 WARN L623 FunctionHandler]: Unknown extern function __iter_div_u64_rem [2022-12-13 03:20:58,700 WARN L623 FunctionHandler]: Unknown extern function atomic_add_unless [2022-12-13 03:20:58,712 WARN L623 FunctionHandler]: Unknown extern function atomic_add_unless [2022-12-13 03:20:58,754 WARN L623 FunctionHandler]: Unknown extern function kobject_get [2022-12-13 03:20:58,757 WARN L623 FunctionHandler]: Unknown extern function kobject_put [2022-12-13 03:20:58,929 WARN L623 FunctionHandler]: Unknown extern function bit_spin_lock [2022-12-13 03:20:58,932 WARN L623 FunctionHandler]: Unknown extern function __bit_spin_unlock [2022-12-13 03:20:58,934 WARN L623 FunctionHandler]: Unknown extern function bit_spin_is_locked [2022-12-13 03:20:58,996 WARN L623 FunctionHandler]: Unknown extern function d_instantiate [2022-12-13 03:20:58,996 WARN L623 FunctionHandler]: Unknown extern function d_rehash [2022-12-13 03:20:58,998 WARN L623 FunctionHandler]: Unknown extern function d_instantiate_unique [2022-12-13 03:20:58,999 WARN L623 FunctionHandler]: Unknown extern function d_rehash [2022-12-13 03:20:59,097 WARN L623 FunctionHandler]: Unknown extern function timespec_trunc [2022-12-13 03:20:59,119 WARN L623 FunctionHandler]: Unknown extern function __tty_alloc_driver [2022-12-13 03:20:59,223 WARN L623 FunctionHandler]: Unknown extern function llist_add_batch [2022-12-13 03:20:59,226 WARN L623 FunctionHandler]: Unknown extern function __xchg_wrong_size [2022-12-13 03:20:59,321 WARN L623 FunctionHandler]: Unknown extern function tty_termios_baud_rate [2022-12-13 03:20:59,436 WARN L623 FunctionHandler]: Unknown extern function tty_unlock [2022-12-13 03:20:59,437 WARN L623 FunctionHandler]: Unknown extern function tty_wait_until_sent [2022-12-13 03:20:59,437 WARN L623 FunctionHandler]: Unknown extern function tty_lock [2022-12-13 03:21:00,056 WARN L611 FunctionHandler]: implicit declaration of function __builtin_constant_p [2022-12-13 03:21:00,056 WARN L623 FunctionHandler]: Unknown extern function ____ilog2_NaN [2022-12-13 03:21:00,059 WARN L623 FunctionHandler]: Unknown extern function ____ilog2_NaN [2022-12-13 03:21:00,062 WARN L623 FunctionHandler]: Unknown extern function ____ilog2_NaN [2022-12-13 03:21:00,067 WARN L623 FunctionHandler]: Unknown extern function ____ilog2_NaN [2022-12-13 03:21:00,428 WARN L623 FunctionHandler]: Unknown extern function nvram_read_byte [2022-12-13 03:21:00,432 WARN L623 FunctionHandler]: Unknown extern function nvram_write_byte [2022-12-13 03:21:00,438 WARN L623 FunctionHandler]: Unknown extern function nvram_sync [2022-12-13 03:21:00,444 WARN L623 FunctionHandler]: Unknown extern function misc_register [2022-12-13 03:21:00,444 WARN L623 FunctionHandler]: Unknown extern function nvram_get_size [2022-12-13 03:21:00,447 WARN L623 FunctionHandler]: Unknown extern function misc_deregister [2022-12-13 03:21:00,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:21:00,477 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:21:00,496 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-driver-races/char_generic_nvram_nvram_llseek_write_nvram.i[5469,5482] [2022-12-13 03:21:00,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:21:00,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:21:00,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:21:00,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:21:00,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:21:00,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:21:00,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:21:00,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:21:00,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:21:00,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:21:00,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:21:00,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:21:00,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:21:00,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:21:00,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:21:00,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:21:00,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:21:00,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:21:00,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:21:00,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:21:00,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:21:00,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:21:00,527 WARN L623 FunctionHandler]: Unknown extern function cpu_relax [2022-12-13 03:21:00,527 WARN L623 FunctionHandler]: Unknown extern function smp_rmb [2022-12-13 03:21:00,527 WARN L623 FunctionHandler]: Unknown extern function smp_rmb [2022-12-13 03:21:00,528 WARN L623 FunctionHandler]: Unknown extern function smp_rmb [2022-12-13 03:21:00,531 WARN L623 FunctionHandler]: Unknown extern function set_normalized_timespec [2022-12-13 03:21:00,534 WARN L623 FunctionHandler]: Unknown extern function set_normalized_timespec [2022-12-13 03:21:00,536 WARN L623 FunctionHandler]: Unknown extern function __iter_div_u64_rem [2022-12-13 03:21:00,546 WARN L623 FunctionHandler]: Unknown extern function atomic_add_unless [2022-12-13 03:21:00,547 WARN L623 FunctionHandler]: Unknown extern function atomic_add_unless [2022-12-13 03:21:00,549 WARN L623 FunctionHandler]: Unknown extern function kobject_get [2022-12-13 03:21:00,550 WARN L623 FunctionHandler]: Unknown extern function kobject_put [2022-12-13 03:21:00,555 WARN L623 FunctionHandler]: Unknown extern function bit_spin_lock [2022-12-13 03:21:00,555 WARN L623 FunctionHandler]: Unknown extern function __bit_spin_unlock [2022-12-13 03:21:00,556 WARN L623 FunctionHandler]: Unknown extern function bit_spin_is_locked [2022-12-13 03:21:00,558 WARN L623 FunctionHandler]: Unknown extern function d_instantiate [2022-12-13 03:21:00,558 WARN L623 FunctionHandler]: Unknown extern function d_rehash [2022-12-13 03:21:00,558 WARN L623 FunctionHandler]: Unknown extern function d_instantiate_unique [2022-12-13 03:21:00,558 WARN L623 FunctionHandler]: Unknown extern function d_rehash [2022-12-13 03:21:00,565 WARN L623 FunctionHandler]: Unknown extern function timespec_trunc [2022-12-13 03:21:00,566 WARN L623 FunctionHandler]: Unknown extern function __tty_alloc_driver [2022-12-13 03:21:00,569 WARN L623 FunctionHandler]: Unknown extern function llist_add_batch [2022-12-13 03:21:00,570 WARN L623 FunctionHandler]: Unknown extern function __xchg_wrong_size [2022-12-13 03:21:00,572 WARN L623 FunctionHandler]: Unknown extern function tty_termios_baud_rate [2022-12-13 03:21:00,575 WARN L623 FunctionHandler]: Unknown extern function tty_unlock [2022-12-13 03:21:00,575 WARN L623 FunctionHandler]: Unknown extern function tty_wait_until_sent [2022-12-13 03:21:00,575 WARN L623 FunctionHandler]: Unknown extern function tty_lock [2022-12-13 03:21:00,624 WARN L611 FunctionHandler]: implicit declaration of function __builtin_constant_p [2022-12-13 03:21:00,624 WARN L623 FunctionHandler]: Unknown extern function ____ilog2_NaN [2022-12-13 03:21:00,626 WARN L623 FunctionHandler]: Unknown extern function ____ilog2_NaN [2022-12-13 03:21:00,630 WARN L623 FunctionHandler]: Unknown extern function ____ilog2_NaN [2022-12-13 03:21:00,633 WARN L623 FunctionHandler]: Unknown extern function ____ilog2_NaN [2022-12-13 03:21:00,671 WARN L623 FunctionHandler]: Unknown extern function nvram_read_byte [2022-12-13 03:21:00,673 WARN L623 FunctionHandler]: Unknown extern function nvram_write_byte [2022-12-13 03:21:00,673 WARN L623 FunctionHandler]: Unknown extern function nvram_sync [2022-12-13 03:21:00,675 WARN L623 FunctionHandler]: Unknown extern function misc_register [2022-12-13 03:21:00,675 WARN L623 FunctionHandler]: Unknown extern function nvram_get_size [2022-12-13 03:21:00,675 WARN L623 FunctionHandler]: Unknown extern function misc_deregister [2022-12-13 03:21:00,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:21:01,131 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:21:01,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:21:01 WrapperNode [2022-12-13 03:21:01,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:21:01,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:21:01,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:21:01,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:21:01,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:21:01" (1/1) ... [2022-12-13 03:21:01,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:21:01" (1/1) ... [2022-12-13 03:21:01,262 INFO L138 Inliner]: procedures = 1354, calls = 1452, calls flagged for inlining = 347, calls inlined = 15, statements flattened = 314 [2022-12-13 03:21:01,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:21:01,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:21:01,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:21:01,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:21:01,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:21:01" (1/1) ... [2022-12-13 03:21:01,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:21:01" (1/1) ... [2022-12-13 03:21:01,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:21:01" (1/1) ... [2022-12-13 03:21:01,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:21:01" (1/1) ... [2022-12-13 03:21:01,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:21:01" (1/1) ... [2022-12-13 03:21:01,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:21:01" (1/1) ... [2022-12-13 03:21:01,305 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:21:01" (1/1) ... [2022-12-13 03:21:01,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:21:01" (1/1) ... [2022-12-13 03:21:01,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:21:01,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:21:01,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:21:01,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:21:01,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:21:01" (1/1) ... [2022-12-13 03:21:01,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:21:01,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:21:01,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 03:21:01,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 03:21:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 03:21:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 03:21:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:21:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:21:01,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:21:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-12-13 03:21:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:21:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:21:01,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:21:01,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 03:21:01,434 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_write_nvram [2022-12-13 03:21:01,434 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_write_nvram [2022-12-13 03:21:01,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:21:01,434 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_nvram_llseek [2022-12-13 03:21:01,434 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_nvram_llseek [2022-12-13 03:21:01,435 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 03:21:01,790 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:21:01,791 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:21:02,139 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:21:02,145 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:21:02,145 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 03:21:02,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:21:02 BoogieIcfgContainer [2022-12-13 03:21:02,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:21:02,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:21:02,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:21:02,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:21:02,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:20:56" (1/3) ... [2022-12-13 03:21:02,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d66f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:21:02, skipping insertion in model container [2022-12-13 03:21:02,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:21:01" (2/3) ... [2022-12-13 03:21:02,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d66f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:21:02, skipping insertion in model container [2022-12-13 03:21:02,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:21:02" (3/3) ... [2022-12-13 03:21:02,152 INFO L112 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_nvram_llseek_write_nvram.i [2022-12-13 03:21:02,164 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:21:02,165 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 03:21:02,165 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:21:02,226 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 03:21:02,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 330 places, 338 transitions, 692 flow [2022-12-13 03:21:02,329 INFO L130 PetriNetUnfolder]: 15/336 cut-off events. [2022-12-13 03:21:02,329 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 03:21:02,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 336 events. 15/336 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 320 event pairs, 0 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 274. Up to 5 conditions per place. [2022-12-13 03:21:02,336 INFO L82 GeneralOperation]: Start removeDead. Operand has 330 places, 338 transitions, 692 flow [2022-12-13 03:21:02,341 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 320 places, 328 transitions, 665 flow [2022-12-13 03:21:02,343 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:02,355 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 320 places, 328 transitions, 665 flow [2022-12-13 03:21:02,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 320 places, 328 transitions, 665 flow [2022-12-13 03:21:02,407 INFO L130 PetriNetUnfolder]: 15/328 cut-off events. [2022-12-13 03:21:02,407 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 03:21:02,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 328 events. 15/328 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 304 event pairs, 0 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 274. Up to 5 conditions per place. [2022-12-13 03:21:02,416 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 320 places, 328 transitions, 665 flow [2022-12-13 03:21:02,417 INFO L226 LiptonReduction]: Number of co-enabled transitions 10680 [2022-12-13 03:22:01,560 WARN L233 SmtUtils]: Spent 10.53s on a formula simplification that was a NOOP. DAG size: 381 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 03:22:09,816 WARN L233 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 329 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 03:22:19,805 WARN L233 SmtUtils]: Spent 9.99s on a formula simplification that was a NOOP. DAG size: 381 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 03:22:28,085 WARN L233 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 329 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 03:22:38,993 WARN L233 SmtUtils]: Spent 10.23s on a formula simplification that was a NOOP. DAG size: 422 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 03:22:49,372 WARN L233 SmtUtils]: Spent 10.37s on a formula simplification that was a NOOP. DAG size: 422 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 03:23:08,714 WARN L233 SmtUtils]: Spent 19.33s on a formula simplification that was a NOOP. DAG size: 422 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 03:23:25,754 WARN L233 SmtUtils]: Spent 17.04s on a formula simplification that was a NOOP. DAG size: 422 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 03:24:55,635 WARN L233 SmtUtils]: Spent 1.45m on a formula simplification. DAG size of input: 522 DAG size of output: 515 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 03:25:33,299 WARN L233 SmtUtils]: Spent 37.66s on a formula simplification that was a NOOP. DAG size: 503 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 03:27:17,595 WARN L233 SmtUtils]: Spent 1.74m on a formula simplification. DAG size of input: 534 DAG size of output: 525 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 03:28:18,144 WARN L233 SmtUtils]: Spent 1.01m on a formula simplification that was a NOOP. DAG size: 512 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 03:28:18,149 INFO L241 LiptonReduction]: Total number of compositions: 311 [2022-12-13 03:28:18,158 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:28:18,162 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@33f67d19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:28:18,162 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 03:28:18,187 INFO L130 PetriNetUnfolder]: 9/130 cut-off events. [2022-12-13 03:28:18,187 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 03:28:18,187 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:28:18,187 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 03:28:18,188 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:28:18,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:28:18,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1764301391, now seen corresponding path program 1 times [2022-12-13 03:28:18,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:28:18,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319968413] [2022-12-13 03:28:18,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:28:18,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:28:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:28:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:28:18,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:28:18,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319968413] [2022-12-13 03:28:18,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319968413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:28:18,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:28:18,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:28:18,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3278618] [2022-12-13 03:28:18,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:28:18,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:28:18,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:28:19,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:28:19,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:28:19,007 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 149 [2022-12-13 03:28:19,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 149 transitions, 307 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:28:19,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:28:19,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 149 [2022-12-13 03:28:19,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:28:22,050 INFO L130 PetriNetUnfolder]: 20400/32528 cut-off events. [2022-12-13 03:28:22,050 INFO L131 PetriNetUnfolder]: For 195/195 co-relation queries the response was YES. [2022-12-13 03:28:22,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64975 conditions, 32528 events. 20400/32528 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 2959. Compared 265236 event pairs, 15403 based on Foata normal form. 0/6698 useless extension candidates. Maximal degree in co-relation 64139. Up to 27226 conditions per place. [2022-12-13 03:28:22,113 INFO L137 encePairwiseOnDemand]: 136/149 looper letters, 148 selfloop transitions, 9 changer transitions 45/209 dead transitions. [2022-12-13 03:28:22,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 209 transitions, 837 flow [2022-12-13 03:28:22,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:28:22,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:28:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2022-12-13 03:28:22,122 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5100671140939598 [2022-12-13 03:28:22,126 INFO L295 CegarLoopForPetriNet]: 145 programPoint places, 0 predicate places. [2022-12-13 03:28:22,126 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 209 transitions, 837 flow [2022-12-13 03:28:22,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 164 transitions, 657 flow [2022-12-13 03:28:22,274 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:28:22,275 INFO L89 Accepts]: Start accepts. Operand has 142 places, 164 transitions, 657 flow [2022-12-13 03:28:22,278 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:28:22,278 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:28:22,278 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 164 transitions, 657 flow [2022-12-13 03:28:22,284 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 164 transitions, 657 flow [2022-12-13 03:28:22,284 INFO L226 LiptonReduction]: Number of co-enabled transitions 1194 [2022-12-13 03:28:22,300 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:28:22,301 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 03:28:22,301 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 164 transitions, 657 flow [2022-12-13 03:28:22,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:28:22,301 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:28:22,302 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:28:22,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:28:22,302 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting whoop_wrapper_nvram_llseekErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:28:22,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:28:22,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1143323380, now seen corresponding path program 1 times [2022-12-13 03:28:22,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:28:22,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877383759] [2022-12-13 03:28:22,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:28:22,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:28:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:28:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:28:22,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:28:22,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877383759] [2022-12-13 03:28:22,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877383759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:28:22,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:28:22,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:28:22,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700568967] [2022-12-13 03:28:22,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:28:22,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:28:22,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:28:22,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:28:22,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:28:22,654 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 144 [2022-12-13 03:28:22,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 164 transitions, 657 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:28:22,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:28:22,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 144 [2022-12-13 03:28:22,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:28:25,893 INFO L130 PetriNetUnfolder]: 19785/33201 cut-off events. [2022-12-13 03:28:25,894 INFO L131 PetriNetUnfolder]: For 261/261 co-relation queries the response was YES. [2022-12-13 03:28:25,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98511 conditions, 33201 events. 19785/33201 cut-off events. For 261/261 co-relation queries the response was YES. Maximal size of possible extension queue 2927. Compared 289891 event pairs, 11263 based on Foata normal form. 23/7818 useless extension candidates. Maximal degree in co-relation 97429. Up to 28872 conditions per place. [2022-12-13 03:28:25,953 INFO L137 encePairwiseOnDemand]: 140/144 looper letters, 79 selfloop transitions, 3 changer transitions 172/261 dead transitions. [2022-12-13 03:28:25,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 261 transitions, 1557 flow [2022-12-13 03:28:25,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:28:25,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:28:25,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2022-12-13 03:28:25,957 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5902777777777778 [2022-12-13 03:28:25,958 INFO L295 CegarLoopForPetriNet]: 145 programPoint places, -2 predicate places. [2022-12-13 03:28:25,958 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 261 transitions, 1557 flow [2022-12-13 03:28:25,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 89 transitions, 518 flow [2022-12-13 03:28:26,083 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:28:26,084 INFO L89 Accepts]: Start accepts. Operand has 80 places, 89 transitions, 518 flow [2022-12-13 03:28:26,084 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:28:26,084 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:28:26,084 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 89 transitions, 518 flow [2022-12-13 03:28:26,086 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 89 transitions, 518 flow [2022-12-13 03:28:26,087 INFO L226 LiptonReduction]: Number of co-enabled transitions 600 [2022-12-13 03:28:26,100 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:28:26,105 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 03:28:26,105 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 89 transitions, 518 flow [2022-12-13 03:28:26,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:28:26,105 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:28:26,105 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:28:26,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:28:26,106 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:28:26,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:28:26,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1141227127, now seen corresponding path program 1 times [2022-12-13 03:28:26,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:28:26,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209995709] [2022-12-13 03:28:26,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:28:26,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:28:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:28:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:28:26,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:28:26,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209995709] [2022-12-13 03:28:26,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209995709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:28:26,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:28:26,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:28:26,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184561702] [2022-12-13 03:28:26,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:28:26,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:28:26,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:28:26,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:28:26,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:28:26,718 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 72 [2022-12-13 03:28:26,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 89 transitions, 518 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:28:26,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:28:26,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 72 [2022-12-13 03:28:26,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:28:27,647 INFO L130 PetriNetUnfolder]: 2900/6810 cut-off events. [2022-12-13 03:28:27,648 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-12-13 03:28:27,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26601 conditions, 6810 events. 2900/6810 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 1314. Compared 69475 event pairs, 831 based on Foata normal form. 91/2731 useless extension candidates. Maximal degree in co-relation 26047. Up to 5121 conditions per place. [2022-12-13 03:28:27,664 INFO L137 encePairwiseOnDemand]: 67/72 looper letters, 59 selfloop transitions, 7 changer transitions 98/171 dead transitions. [2022-12-13 03:28:27,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 171 transitions, 1344 flow [2022-12-13 03:28:27,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:28:27,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:28:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2022-12-13 03:28:27,665 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49722222222222223 [2022-12-13 03:28:27,666 INFO L295 CegarLoopForPetriNet]: 145 programPoint places, -61 predicate places. [2022-12-13 03:28:27,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 171 transitions, 1344 flow [2022-12-13 03:28:27,675 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 73 transitions, 560 flow [2022-12-13 03:28:27,699 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:28:27,700 INFO L89 Accepts]: Start accepts. Operand has 62 places, 73 transitions, 560 flow [2022-12-13 03:28:27,701 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:28:27,701 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:28:27,701 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 73 transitions, 560 flow [2022-12-13 03:28:27,703 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 73 transitions, 560 flow [2022-12-13 03:28:27,703 INFO L226 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-13 03:28:27,707 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:28:27,708 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 03:28:27,708 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 73 transitions, 560 flow [2022-12-13 03:28:27,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:28:27,709 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:28:27,709 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:28:27,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:28:27,709 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:28:27,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:28:27,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1427206036, now seen corresponding path program 1 times [2022-12-13 03:28:27,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:28:27,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467156157] [2022-12-13 03:28:27,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:28:27,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:28:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:28:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:28:32,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:28:32,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467156157] [2022-12-13 03:28:32,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467156157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:28:32,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:28:32,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:28:32,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195975021] [2022-12-13 03:28:32,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:28:32,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:28:32,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:28:32,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:28:32,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:28:32,069 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2022-12-13 03:28:32,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 73 transitions, 560 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:28:32,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:28:32,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2022-12-13 03:28:32,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:28:33,081 INFO L130 PetriNetUnfolder]: 2149/5234 cut-off events. [2022-12-13 03:28:33,081 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-12-13 03:28:33,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25276 conditions, 5234 events. 2149/5234 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 52423 event pairs, 154 based on Foata normal form. 45/2326 useless extension candidates. Maximal degree in co-relation 24504. Up to 2673 conditions per place. [2022-12-13 03:28:33,095 INFO L137 encePairwiseOnDemand]: 41/48 looper letters, 91 selfloop transitions, 13 changer transitions 45/156 dead transitions. [2022-12-13 03:28:33,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 156 transitions, 1528 flow [2022-12-13 03:28:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 03:28:33,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 03:28:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2022-12-13 03:28:33,096 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-13 03:28:33,097 INFO L295 CegarLoopForPetriNet]: 145 programPoint places, -76 predicate places. [2022-12-13 03:28:33,097 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 156 transitions, 1528 flow [2022-12-13 03:28:33,106 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 111 transitions, 1075 flow [2022-12-13 03:28:33,124 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:28:33,124 INFO L89 Accepts]: Start accepts. Operand has 69 places, 111 transitions, 1075 flow [2022-12-13 03:28:33,125 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:28:33,125 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:28:33,125 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 111 transitions, 1075 flow [2022-12-13 03:28:33,127 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 111 transitions, 1075 flow [2022-12-13 03:28:33,127 INFO L226 LiptonReduction]: Number of co-enabled transitions 392 [2022-12-13 03:28:33,130 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:28:33,131 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 03:28:33,131 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 111 transitions, 1075 flow [2022-12-13 03:28:33,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:28:33,131 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:28:33,131 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:28:33,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:28:33,131 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:28:33,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:28:33,131 INFO L85 PathProgramCache]: Analyzing trace with hash 617435610, now seen corresponding path program 2 times [2022-12-13 03:28:33,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:28:33,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559846481] [2022-12-13 03:28:33,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:28:33,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:28:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:28:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:28:33,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:28:33,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559846481] [2022-12-13 03:28:33,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559846481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:28:33,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:28:33,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:28:33,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766788317] [2022-12-13 03:28:33,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:28:33,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:28:33,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:28:33,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:28:33,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:28:33,677 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2022-12-13 03:28:33,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 111 transitions, 1075 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:28:33,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:28:33,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2022-12-13 03:28:33,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:28:34,442 INFO L130 PetriNetUnfolder]: 1547/3796 cut-off events. [2022-12-13 03:28:34,442 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 03:28:34,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22006 conditions, 3796 events. 1547/3796 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 36862 event pairs, 112 based on Foata normal form. 45/1651 useless extension candidates. Maximal degree in co-relation 21809. Up to 2317 conditions per place. [2022-12-13 03:28:34,451 INFO L137 encePairwiseOnDemand]: 41/48 looper letters, 90 selfloop transitions, 10 changer transitions 36/143 dead transitions. [2022-12-13 03:28:34,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 143 transitions, 1670 flow [2022-12-13 03:28:34,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:28:34,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:28:34,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2022-12-13 03:28:34,453 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-13 03:28:34,454 INFO L295 CegarLoopForPetriNet]: 145 programPoint places, -71 predicate places. [2022-12-13 03:28:34,455 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 143 transitions, 1670 flow [2022-12-13 03:28:34,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 107 transitions, 1232 flow [2022-12-13 03:28:34,478 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:28:34,478 INFO L89 Accepts]: Start accepts. Operand has 73 places, 107 transitions, 1232 flow [2022-12-13 03:28:34,480 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:28:34,480 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:28:34,480 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 107 transitions, 1232 flow [2022-12-13 03:28:34,482 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 107 transitions, 1232 flow [2022-12-13 03:28:34,482 INFO L226 LiptonReduction]: Number of co-enabled transitions 314 [2022-12-13 03:28:34,516 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:28:34,517 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:28:34,520 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:28:34,520 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:28:34,522 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1487] L6734-14-->L6739: Formula: (let ((.cse0 (mod |v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~i~2#1_In_3| 4294967296))) (and (= (store |v_#memory_$Pointer$.offset_In_5| |v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.base_In_3| (store (select |v_#memory_$Pointer$.offset_In_5| |v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.base_In_3|) |v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.offset_In_3| (select (select |v_#memory_$Pointer$.offset_Out_10| |v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.base_In_3|) |v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.offset_In_3|))) |v_#memory_$Pointer$.offset_Out_10|) (= (store |v_#memory_$Pointer$.base_In_5| |v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.base_In_3| (store (select |v_#memory_$Pointer$.base_In_5| |v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.base_In_3|) |v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.offset_In_3| (select (select |v_#memory_$Pointer$.base_Out_10| |v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.base_In_3|) |v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.offset_In_3|))) |v_#memory_$Pointer$.base_Out_10|) (or (not (< .cse0 (mod v_~nvram_len~0_In_15 4294967296))) (not (< 0 (mod |v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~count#1_In_1| 4294967296)))) (= (store |v_#memory_int_In_23| |v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.base_In_3| (store (select |v_#memory_int_In_23| |v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.base_In_3|) |v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.offset_In_3| .cse0)) |v_#memory_int_Out_10|))) InVars {whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~i~2#1=|v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~i~2#1_In_3|, whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.offset=|v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.offset_In_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_In_5|, #memory_int=|v_#memory_int_In_23|, ~nvram_len~0=v_~nvram_len~0_In_15, whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~count#1=|v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~count#1_In_1|, whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.base=|v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.base_In_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_In_5|} OutVars{whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~i~2#1=|v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~i~2#1_In_3|, whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.offset=|v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.offset_In_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_Out_10|, #memory_int=|v_#memory_int_Out_10|, ~nvram_len~0=v_~nvram_len~0_In_15, whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~count#1=|v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~count#1_In_1|, whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.base=|v_whoop_wrapper_write_nvramThread1of1ForFork0_write_nvram_~ppos#1.base_In_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_Out_10|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] and [1420] L6861-3-->L6862-3: Formula: (and (= |v_#pthreadsForks_55| (+ |v_#pthreadsForks_56| 1)) (= (store |v_#memory_int_394| |v_ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.base_61| (store (select |v_#memory_int_394| |v_ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.base_61|) |v_ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.offset_61| |v_ULTIMATE.start_main_#t~pre1183#1_49|)) |v_#memory_int_393|) (= (store |v_#memory_$Pointer$.base_178| |v_ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.base_61| (store (select |v_#memory_$Pointer$.base_178| |v_ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.base_61|) |v_ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.offset_61| (select (select |v_#memory_$Pointer$.base_177| |v_ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.base_61|) |v_ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.offset_61|))) |v_#memory_$Pointer$.base_177|) (= |v_#memory_$Pointer$.offset_177| (store |v_#memory_$Pointer$.offset_178| |v_ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.base_61| (store (select |v_#memory_$Pointer$.offset_178| |v_ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.base_61|) |v_ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.offset_61| (select (select |v_#memory_$Pointer$.offset_177| |v_ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.base_61|) |v_ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.offset_61|)))) (= |v_ULTIMATE.start_main_#t~pre1183#1_49| |v_#pthreadsForks_56|)) InVars {ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.base=|v_ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.base_61|, ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.offset=|v_ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.offset_61|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_178|, #pthreadsForks=|v_#pthreadsForks_56|, #memory_int=|v_#memory_int_394|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_178|} OutVars{ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.base=|v_ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.base_61|, ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.offset=|v_ULTIMATE.start_main_~#pthread_t_nvram_llseek~0#1.offset_61|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_177|, #pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_#t~pre1181#1=|v_ULTIMATE.start_main_#t~pre1181#1_43|, ULTIMATE.start_main_#t~pre1183#1=|v_ULTIMATE.start_main_#t~pre1183#1_49|, #memory_int=|v_#memory_int_393|, ULTIMATE.start_main_#t~nondet1182#1=|v_ULTIMATE.start_main_#t~nondet1182#1_25|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_177|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #pthreadsForks, ULTIMATE.start_main_#t~pre1181#1, ULTIMATE.start_main_#t~pre1183#1, #memory_int, ULTIMATE.start_main_#t~nondet1182#1, #memory_$Pointer$.offset] [2022-12-13 03:28:34,694 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:28:34,695 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-13 03:28:34,695 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 106 transitions, 1222 flow [2022-12-13 03:28:34,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:28:34,695 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:28:34,695 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:28:34,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:28:34,695 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting whoop_wrapper_nvram_llseekErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:28:34,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:28:34,696 INFO L85 PathProgramCache]: Analyzing trace with hash 617042373, now seen corresponding path program 1 times [2022-12-13 03:28:34,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:28:34,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122589769] [2022-12-13 03:28:34,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:28:34,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:28:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:28:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:28:35,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:28:35,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122589769] [2022-12-13 03:28:35,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122589769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:28:35,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:28:35,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:28:35,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826036132] [2022-12-13 03:28:35,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:28:35,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:28:35,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:28:35,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:28:35,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:28:35,280 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2022-12-13 03:28:35,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 106 transitions, 1222 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:28:35,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:28:35,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2022-12-13 03:28:35,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:28:36,021 INFO L130 PetriNetUnfolder]: 1101/2656 cut-off events. [2022-12-13 03:28:36,021 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-13 03:28:36,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17916 conditions, 2656 events. 1101/2656 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 23770 event pairs, 77 based on Foata normal form. 38/1186 useless extension candidates. Maximal degree in co-relation 17377. Up to 2220 conditions per place. [2022-12-13 03:28:36,027 INFO L137 encePairwiseOnDemand]: 43/49 looper letters, 70 selfloop transitions, 11 changer transitions 32/120 dead transitions. [2022-12-13 03:28:36,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 120 transitions, 1619 flow [2022-12-13 03:28:36,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 03:28:36,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 03:28:36,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2022-12-13 03:28:36,029 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38010204081632654 [2022-12-13 03:28:36,029 INFO L295 CegarLoopForPetriNet]: 145 programPoint places, -66 predicate places. [2022-12-13 03:28:36,029 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 120 transitions, 1619 flow [2022-12-13 03:28:36,034 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 88 transitions, 1165 flow [2022-12-13 03:28:36,045 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:28:36,045 INFO L89 Accepts]: Start accepts. Operand has 79 places, 88 transitions, 1165 flow [2022-12-13 03:28:36,046 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:28:36,046 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:28:36,046 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 88 transitions, 1165 flow [2022-12-13 03:28:36,048 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 88 transitions, 1165 flow [2022-12-13 03:28:36,048 INFO L226 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-13 03:28:36,050 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:28:36,050 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 03:28:36,050 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 88 transitions, 1165 flow [2022-12-13 03:28:36,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:28:36,050 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:28:36,051 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:28:36,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:28:36,051 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:28:36,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:28:36,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1504642341, now seen corresponding path program 1 times [2022-12-13 03:28:36,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:28:36,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847736516] [2022-12-13 03:28:36,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:28:36,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:28:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:28:36,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:28:36,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:28:36,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847736516] [2022-12-13 03:28:36,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847736516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:28:36,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:28:36,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:28:36,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609911835] [2022-12-13 03:28:36,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:28:36,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:28:36,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:28:36,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:28:36,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:28:36,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2022-12-13 03:28:36,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 88 transitions, 1165 flow. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:28:36,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:28:36,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2022-12-13 03:28:36,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:28:37,628 INFO L130 PetriNetUnfolder]: 266/550 cut-off events. [2022-12-13 03:28:37,629 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 03:28:37,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4262 conditions, 550 events. 266/550 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 2856 event pairs, 77 based on Foata normal form. 45/353 useless extension candidates. Maximal degree in co-relation 4182. Up to 364 conditions per place. [2022-12-13 03:28:37,631 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 66 selfloop transitions, 7 changer transitions 24/104 dead transitions. [2022-12-13 03:28:37,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 104 transitions, 1583 flow [2022-12-13 03:28:37,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:28:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:28:37,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-12-13 03:28:37,632 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3843537414965986 [2022-12-13 03:28:37,632 INFO L295 CegarLoopForPetriNet]: 145 programPoint places, -61 predicate places. [2022-12-13 03:28:37,633 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 104 transitions, 1583 flow [2022-12-13 03:28:37,635 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 80 transitions, 1194 flow [2022-12-13 03:28:37,637 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:28:37,637 INFO L89 Accepts]: Start accepts. Operand has 83 places, 80 transitions, 1194 flow [2022-12-13 03:28:37,638 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:28:37,638 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:28:37,638 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 80 transitions, 1194 flow [2022-12-13 03:28:37,639 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 80 transitions, 1194 flow [2022-12-13 03:28:37,639 INFO L226 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-13 03:28:37,640 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:28:37,640 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 03:28:37,640 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 80 transitions, 1194 flow [2022-12-13 03:28:37,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:28:37,640 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:28:37,640 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:28:37,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:28:37,641 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:28:37,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:28:37,641 INFO L85 PathProgramCache]: Analyzing trace with hash 617349120, now seen corresponding path program 3 times [2022-12-13 03:28:37,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:28:37,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499201197] [2022-12-13 03:28:37,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:28:37,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:28:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:28:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:28:38,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:28:38,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499201197] [2022-12-13 03:28:38,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499201197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:28:38,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:28:38,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:28:38,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81904404] [2022-12-13 03:28:38,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:28:38,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:28:38,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:28:38,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:28:38,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:28:38,097 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2022-12-13 03:28:38,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 80 transitions, 1194 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:28:38,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:28:38,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2022-12-13 03:28:38,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:28:38,878 INFO L130 PetriNetUnfolder]: 162/341 cut-off events. [2022-12-13 03:28:38,878 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 03:28:38,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2970 conditions, 341 events. 162/341 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 1543 event pairs, 35 based on Foata normal form. 45/242 useless extension candidates. Maximal degree in co-relation 2881. Up to 228 conditions per place. [2022-12-13 03:28:38,880 INFO L137 encePairwiseOnDemand]: 43/48 looper letters, 36 selfloop transitions, 4 changer transitions 35/79 dead transitions. [2022-12-13 03:28:38,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 79 transitions, 1322 flow [2022-12-13 03:28:38,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:28:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:28:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-12-13 03:28:38,881 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31547619047619047 [2022-12-13 03:28:38,882 INFO L295 CegarLoopForPetriNet]: 145 programPoint places, -57 predicate places. [2022-12-13 03:28:38,883 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 79 transitions, 1322 flow [2022-12-13 03:28:38,884 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 44 transitions, 737 flow [2022-12-13 03:28:38,885 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:28:38,885 INFO L89 Accepts]: Start accepts. Operand has 66 places, 44 transitions, 737 flow [2022-12-13 03:28:38,886 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:28:38,886 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:28:38,886 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 44 transitions, 737 flow [2022-12-13 03:28:38,887 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 44 transitions, 737 flow [2022-12-13 03:28:38,887 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 03:28:38,887 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:28:38,890 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 03:28:38,890 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 44 transitions, 737 flow [2022-12-13 03:28:38,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:28:38,890 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:28:38,890 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:28:38,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:28:38,890 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting whoop_wrapper_nvram_llseekErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:28:38,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:28:38,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1427512783, now seen corresponding path program 2 times [2022-12-13 03:28:38,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:28:38,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133533847] [2022-12-13 03:28:38,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:28:38,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:28:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:28:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:28:39,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:28:39,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133533847] [2022-12-13 03:28:39,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133533847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:28:39,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:28:39,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:28:39,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189275851] [2022-12-13 03:28:39,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:28:39,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:28:39,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:28:39,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:28:39,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:28:39,480 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-13 03:28:39,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 44 transitions, 737 flow. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:28:39,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:28:39,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-13 03:28:39,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:28:39,972 INFO L130 PetriNetUnfolder]: 48/116 cut-off events. [2022-12-13 03:28:39,972 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 03:28:39,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 116 events. 48/116 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 378 event pairs, 0 based on Foata normal form. 38/105 useless extension candidates. Maximal degree in co-relation 1067. Up to 87 conditions per place. [2022-12-13 03:28:39,973 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 0 selfloop transitions, 0 changer transitions 43/43 dead transitions. [2022-12-13 03:28:39,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 43 transitions, 797 flow [2022-12-13 03:28:39,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:28:39,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:28:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-12-13 03:28:39,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-13 03:28:39,974 INFO L295 CegarLoopForPetriNet]: 145 programPoint places, -74 predicate places. [2022-12-13 03:28:39,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 43 transitions, 797 flow [2022-12-13 03:28:39,974 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 03:28:39,975 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:28:39,975 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:28:39,975 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:28:39,975 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:28:39,975 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:28:39,976 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 03:28:39,976 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 03:28:39,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:28:39,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 03:28:39,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-13 03:28:39,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 03:28:39,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_nvram_llseekErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-12-13 03:28:39,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-13 03:28:39,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location whoop_wrapper_nvram_llseekErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 03:28:39,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:28:39,979 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2022-12-13 03:28:39,983 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:28:39,983 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:28:39,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:28:39 BasicIcfg [2022-12-13 03:28:39,985 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:28:39,985 INFO L158 Benchmark]: Toolchain (without parser) took 463155.04ms. Allocated memory was 163.6MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 130.1MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 675.0MB. Max. memory is 8.0GB. [2022-12-13 03:28:39,985 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 163.6MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:28:39,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 4300.39ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 130.1MB in the beginning and 116.5MB in the end (delta: 13.5MB). Peak memory consumption was 139.7MB. Max. memory is 8.0GB. [2022-12-13 03:28:39,986 INFO L158 Benchmark]: Boogie Procedure Inliner took 130.27ms. Allocated memory is still 197.1MB. Free memory was 116.0MB in the beginning and 107.1MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-12-13 03:28:39,986 INFO L158 Benchmark]: Boogie Preprocessor took 57.80ms. Allocated memory is still 197.1MB. Free memory was 107.1MB in the beginning and 102.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-12-13 03:28:39,986 INFO L158 Benchmark]: RCFGBuilder took 825.34ms. Allocated memory is still 197.1MB. Free memory was 102.9MB in the beginning and 134.6MB in the end (delta: -31.7MB). Peak memory consumption was 41.2MB. Max. memory is 8.0GB. [2022-12-13 03:28:39,986 INFO L158 Benchmark]: TraceAbstraction took 457836.47ms. Allocated memory was 197.1MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 133.0MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 644.9MB. Max. memory is 8.0GB. [2022-12-13 03:28:39,988 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 163.6MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 4300.39ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 130.1MB in the beginning and 116.5MB in the end (delta: 13.5MB). Peak memory consumption was 139.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 130.27ms. Allocated memory is still 197.1MB. Free memory was 116.0MB in the beginning and 107.1MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.80ms. Allocated memory is still 197.1MB. Free memory was 107.1MB in the beginning and 102.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 825.34ms. Allocated memory is still 197.1MB. Free memory was 102.9MB in the beginning and 134.6MB in the end (delta: -31.7MB). Peak memory consumption was 41.2MB. Max. memory is 8.0GB. * TraceAbstraction took 457836.47ms. Allocated memory was 197.1MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 133.0MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 644.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 435.7s, 320 PlacesBefore, 145 PlacesAfterwards, 328 TransitionsBefore, 149 TransitionsAfterwards, 10680 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 175 TrivialYvCompositions, 119 ConcurrentYvCompositions, 13 ChoiceCompositions, 311 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33740, independent: 33574, independent conditional: 33574, independent unconditional: 0, dependent: 165, dependent conditional: 165, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33740, independent: 33574, independent conditional: 0, independent unconditional: 33574, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33740, independent: 33574, independent conditional: 0, independent unconditional: 33574, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33740, independent: 33574, independent conditional: 0, independent unconditional: 33574, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11194, independent: 11141, independent conditional: 0, independent unconditional: 11141, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11194, independent: 11099, independent conditional: 0, independent unconditional: 11099, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 95, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2366, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 2162, unknown conditional: 0, unknown unconditional: 2162] ], Cache Queries: [ total: 33740, independent: 22433, independent conditional: 0, independent unconditional: 22433, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 11194, unknown conditional: 0, unknown unconditional: 11194] , Statistics on independence cache: Total cache size (in pairs): 58900, Positive cache size: 58848, Positive conditional cache size: 0, Positive unconditional cache size: 58848, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 142 PlacesBefore, 142 PlacesAfterwards, 164 TransitionsBefore, 164 TransitionsAfterwards, 1194 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 111 TransitionsBefore, 111 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 73 PlacesBefore, 72 PlacesAfterwards, 107 TransitionsBefore, 106 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3, Positive cache size: 3, Positive conditional cache size: 3, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 79 PlacesBefore, 79 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3, Positive cache size: 3, Positive conditional cache size: 3, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 83 PlacesBefore, 83 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3, Positive cache size: 3, Positive conditional cache size: 3, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3, Positive cache size: 3, Positive conditional cache size: 3, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3, Positive cache size: 3, Positive conditional cache size: 3, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 174]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 174]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 452 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 457.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 435.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1195 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1195 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2087 IncrementalHoareTripleChecker+Invalid, 2114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 10 mSDtfsCounter, 2087 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1232occurred in iteration=5, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 781 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 03:28:40,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...