./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c0e62a2f55ddaeb08563a2d9bb0bfed8d8d740037b0faa92e9ebf8fe89adc120 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 20:39:56,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:39:56,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:39:56,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:39:56,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:39:56,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:39:56,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:39:56,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:39:56,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:39:56,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:39:56,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:39:57,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:39:57,000 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:39:57,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:39:57,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:39:57,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:39:57,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:39:57,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:39:57,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:39:57,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:39:57,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:39:57,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:39:57,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:39:57,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:39:57,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:39:57,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:39:57,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:39:57,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:39:57,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:39:57,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:39:57,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:39:57,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:39:57,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:39:57,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:39:57,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:39:57,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:39:57,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:39:57,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:39:57,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:39:57,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:39:57,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:39:57,018 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-12-13 20:39:57,031 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:39:57,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:39:57,031 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:39:57,031 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:39:57,032 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:39:57,032 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:39:57,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:39:57,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:39:57,032 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:39:57,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:39:57,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:39:57,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:39:57,041 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 20:39:57,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:39:57,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 20:39:57,041 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:39:57,042 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:39:57,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 20:39:57,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:39:57,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:39:57,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:39:57,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:39:57,043 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:39:57,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:39:57,043 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 20:39:57,044 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:39:57,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:39:57,044 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:39:57,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 20:39:57,044 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:39:57,044 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:39:57,045 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:39:57,045 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c0e62a2f55ddaeb08563a2d9bb0bfed8d8d740037b0faa92e9ebf8fe89adc120 [2022-12-13 20:39:57,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:39:57,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:39:57,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:39:57,248 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:39:57,248 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:39:57,249 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2022-12-13 20:39:59,725 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:39:59,976 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:39:59,976 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2022-12-13 20:39:59,990 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/data/0cf120eee/ef371d89e4e245e8b99dd541c0bb3eed/FLAGd447aa80b [2022-12-13 20:40:00,303 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/data/0cf120eee/ef371d89e4e245e8b99dd541c0bb3eed [2022-12-13 20:40:00,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:40:00,307 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:40:00,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:40:00,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:40:00,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:40:00,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:40:00" (1/1) ... [2022-12-13 20:40:00,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@543f9b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:00, skipping insertion in model container [2022-12-13 20:40:00,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:40:00" (1/1) ... [2022-12-13 20:40:00,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:40:00,367 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:40:00,554 WARN L1266 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2022-12-13 20:40:00,555 WARN L1266 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2022-12-13 20:40:00,574 WARN L623 FunctionHandler]: Unknown extern function __bad_percpu_size [2022-12-13 20:40:00,581 WARN L623 FunctionHandler]: Unknown extern function __bitmap_weight [2022-12-13 20:40:00,594 WARN L623 FunctionHandler]: Unknown extern function _raw_spin_lock [2022-12-13 20:40:00,598 WARN L623 FunctionHandler]: Unknown extern function _raw_spin_unlock [2022-12-13 20:40:00,602 WARN L623 FunctionHandler]: Unknown extern function _raw_spin_unlock_irqrestore [2022-12-13 20:40:00,608 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 20:40:00,634 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2022-12-13 20:40:00,675 WARN L623 FunctionHandler]: Unknown extern function torture_random [2022-12-13 20:40:00,676 WARN L623 FunctionHandler]: Unknown extern function __const_udelay [2022-12-13 20:40:00,683 WARN L623 FunctionHandler]: Unknown extern function torture_random [2022-12-13 20:40:00,684 WARN L623 FunctionHandler]: Unknown extern function __const_udelay [2022-12-13 20:40:00,684 WARN L623 FunctionHandler]: Unknown extern function torture_random [2022-12-13 20:40:00,685 WARN L623 FunctionHandler]: Unknown extern function __udelay [2022-12-13 20:40:00,693 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,694 WARN L623 FunctionHandler]: Unknown extern function set_user_nice [2022-12-13 20:40:00,694 WARN L623 FunctionHandler]: Unknown extern function torture_random [2022-12-13 20:40:00,695 WARN L623 FunctionHandler]: Unknown extern function schedule_timeout_uninterruptible [2022-12-13 20:40:00,698 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 20:40:00,700 WARN L623 FunctionHandler]: Unknown extern function stutter_wait [2022-12-13 20:40:00,701 WARN L623 FunctionHandler]: Unknown extern function torture_must_stop [2022-12-13 20:40:00,701 WARN L623 FunctionHandler]: Unknown extern function torture_kthread_stopping [2022-12-13 20:40:00,706 WARN L623 FunctionHandler]: Unknown extern function sprintf [2022-12-13 20:40:00,707 WARN L623 FunctionHandler]: Unknown extern function sprintf [2022-12-13 20:40:00,711 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,711 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,712 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 20:40:00,714 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,714 WARN L623 FunctionHandler]: Unknown extern function schedule_timeout_interruptible [2022-12-13 20:40:00,715 WARN L623 FunctionHandler]: Unknown extern function torture_shutdown_absorb [2022-12-13 20:40:00,715 WARN L623 FunctionHandler]: Unknown extern function torture_must_stop [2022-12-13 20:40:00,715 WARN L623 FunctionHandler]: Unknown extern function torture_kthread_stopping [2022-12-13 20:40:00,717 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,718 WARN L623 FunctionHandler]: Unknown extern function torture_cleanup [2022-12-13 20:40:00,719 WARN L623 FunctionHandler]: Unknown extern function _torture_stop_kthread [2022-12-13 20:40:00,719 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 20:40:00,720 WARN L623 FunctionHandler]: Unknown extern function _torture_stop_kthread [2022-12-13 20:40:00,720 WARN L623 FunctionHandler]: Unknown extern function torture_onoff_failures [2022-12-13 20:40:00,724 WARN L623 FunctionHandler]: Unknown extern function torture_init_begin [2022-12-13 20:40:00,725 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,726 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,726 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,727 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,727 WARN L623 FunctionHandler]: Unknown extern function torture_init_end [2022-12-13 20:40:00,729 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,730 WARN L623 FunctionHandler]: Unknown extern function torture_onoff_init [2022-12-13 20:40:00,731 WARN L623 FunctionHandler]: Unknown extern function torture_shuffle_init [2022-12-13 20:40:00,731 WARN L623 FunctionHandler]: Unknown extern function torture_shutdown_init [2022-12-13 20:40:00,732 WARN L623 FunctionHandler]: Unknown extern function torture_stutter_init [2022-12-13 20:40:00,733 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,733 WARN L623 FunctionHandler]: Unknown extern function _torture_create_kthread [2022-12-13 20:40:00,734 WARN L623 FunctionHandler]: Unknown extern function _torture_create_kthread [2022-12-13 20:40:00,735 WARN L623 FunctionHandler]: Unknown extern function torture_init_end [2022-12-13 20:40:00,735 WARN L623 FunctionHandler]: Unknown extern function torture_init_end [2022-12-13 20:40:00,749 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-12-13 20:40:00,751 WARN L623 FunctionHandler]: Unknown extern function ldv_release_1 [2022-12-13 20:40:00,752 WARN L623 FunctionHandler]: Unknown extern function ldv_probe_1 [2022-12-13 20:40:00,754 WARN L623 FunctionHandler]: Unknown extern function ldv_release_3 [2022-12-13 20:40:00,754 WARN L623 FunctionHandler]: Unknown extern function ldv_probe_3 [2022-12-13 20:40:00,756 WARN L623 FunctionHandler]: Unknown extern function ldv_release_2 [2022-12-13 20:40:00,756 WARN L623 FunctionHandler]: Unknown extern function ldv_probe_2 [2022-12-13 20:40:00,757 WARN L623 FunctionHandler]: Unknown extern function ldv_check_final_state [2022-12-13 20:40:00,762 WARN L623 FunctionHandler]: Unknown extern function ldv_some_page [2022-12-13 20:40:00,767 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 20:40:00,769 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 20:40:00,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:40:00,797 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:40:00,838 WARN L1266 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2022-12-13 20:40:00,838 WARN L1266 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2022-12-13 20:40:00,840 WARN L623 FunctionHandler]: Unknown extern function __bad_percpu_size [2022-12-13 20:40:00,841 WARN L623 FunctionHandler]: Unknown extern function __bitmap_weight [2022-12-13 20:40:00,842 WARN L623 FunctionHandler]: Unknown extern function _raw_spin_lock [2022-12-13 20:40:00,843 WARN L623 FunctionHandler]: Unknown extern function _raw_spin_unlock [2022-12-13 20:40:00,843 WARN L623 FunctionHandler]: Unknown extern function _raw_spin_unlock_irqrestore [2022-12-13 20:40:00,844 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 20:40:00,847 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2022-12-13 20:40:00,849 WARN L623 FunctionHandler]: Unknown extern function torture_random [2022-12-13 20:40:00,849 WARN L623 FunctionHandler]: Unknown extern function __const_udelay [2022-12-13 20:40:00,851 WARN L623 FunctionHandler]: Unknown extern function torture_random [2022-12-13 20:40:00,851 WARN L623 FunctionHandler]: Unknown extern function __const_udelay [2022-12-13 20:40:00,852 WARN L623 FunctionHandler]: Unknown extern function torture_random [2022-12-13 20:40:00,852 WARN L623 FunctionHandler]: Unknown extern function __udelay [2022-12-13 20:40:00,854 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,855 WARN L623 FunctionHandler]: Unknown extern function set_user_nice [2022-12-13 20:40:00,855 WARN L623 FunctionHandler]: Unknown extern function torture_random [2022-12-13 20:40:00,856 WARN L623 FunctionHandler]: Unknown extern function schedule_timeout_uninterruptible [2022-12-13 20:40:00,856 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 20:40:00,858 WARN L623 FunctionHandler]: Unknown extern function stutter_wait [2022-12-13 20:40:00,858 WARN L623 FunctionHandler]: Unknown extern function torture_must_stop [2022-12-13 20:40:00,859 WARN L623 FunctionHandler]: Unknown extern function torture_kthread_stopping [2022-12-13 20:40:00,861 WARN L623 FunctionHandler]: Unknown extern function sprintf [2022-12-13 20:40:00,862 WARN L623 FunctionHandler]: Unknown extern function sprintf [2022-12-13 20:40:00,864 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,864 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,865 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 20:40:00,865 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,865 WARN L623 FunctionHandler]: Unknown extern function schedule_timeout_interruptible [2022-12-13 20:40:00,866 WARN L623 FunctionHandler]: Unknown extern function torture_shutdown_absorb [2022-12-13 20:40:00,866 WARN L623 FunctionHandler]: Unknown extern function torture_must_stop [2022-12-13 20:40:00,867 WARN L623 FunctionHandler]: Unknown extern function torture_kthread_stopping [2022-12-13 20:40:00,867 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,868 WARN L623 FunctionHandler]: Unknown extern function torture_cleanup [2022-12-13 20:40:00,868 WARN L623 FunctionHandler]: Unknown extern function _torture_stop_kthread [2022-12-13 20:40:00,869 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 20:40:00,869 WARN L623 FunctionHandler]: Unknown extern function _torture_stop_kthread [2022-12-13 20:40:00,869 WARN L623 FunctionHandler]: Unknown extern function torture_onoff_failures [2022-12-13 20:40:00,871 WARN L623 FunctionHandler]: Unknown extern function torture_init_begin [2022-12-13 20:40:00,871 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,872 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,872 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,873 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,873 WARN L623 FunctionHandler]: Unknown extern function torture_init_end [2022-12-13 20:40:00,874 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,875 WARN L623 FunctionHandler]: Unknown extern function torture_onoff_init [2022-12-13 20:40:00,876 WARN L623 FunctionHandler]: Unknown extern function torture_shuffle_init [2022-12-13 20:40:00,876 WARN L623 FunctionHandler]: Unknown extern function torture_shutdown_init [2022-12-13 20:40:00,877 WARN L623 FunctionHandler]: Unknown extern function torture_stutter_init [2022-12-13 20:40:00,877 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:40:00,878 WARN L623 FunctionHandler]: Unknown extern function _torture_create_kthread [2022-12-13 20:40:00,879 WARN L623 FunctionHandler]: Unknown extern function _torture_create_kthread [2022-12-13 20:40:00,879 WARN L623 FunctionHandler]: Unknown extern function torture_init_end [2022-12-13 20:40:00,879 WARN L623 FunctionHandler]: Unknown extern function torture_init_end [2022-12-13 20:40:00,881 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-12-13 20:40:00,882 WARN L623 FunctionHandler]: Unknown extern function ldv_release_1 [2022-12-13 20:40:00,882 WARN L623 FunctionHandler]: Unknown extern function ldv_probe_1 [2022-12-13 20:40:00,884 WARN L623 FunctionHandler]: Unknown extern function ldv_release_3 [2022-12-13 20:40:00,884 WARN L623 FunctionHandler]: Unknown extern function ldv_probe_3 [2022-12-13 20:40:00,885 WARN L623 FunctionHandler]: Unknown extern function ldv_release_2 [2022-12-13 20:40:00,886 WARN L623 FunctionHandler]: Unknown extern function ldv_probe_2 [2022-12-13 20:40:00,886 WARN L623 FunctionHandler]: Unknown extern function ldv_check_final_state [2022-12-13 20:40:00,888 WARN L623 FunctionHandler]: Unknown extern function ldv_some_page [2022-12-13 20:40:00,890 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 20:40:00,891 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 20:40:00,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:40:00,912 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:40:00,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:00 WrapperNode [2022-12-13 20:40:00,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:40:00,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:40:00,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:40:00,913 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:40:00,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:00" (1/1) ... [2022-12-13 20:40:00,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:00" (1/1) ... [2022-12-13 20:40:00,982 INFO L138 Inliner]: procedures = 114, calls = 288, calls flagged for inlining = 49, calls inlined = 38, statements flattened = 870 [2022-12-13 20:40:00,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:40:00,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:40:00,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:40:00,983 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:40:00,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:00" (1/1) ... [2022-12-13 20:40:00,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:00" (1/1) ... [2022-12-13 20:40:00,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:00" (1/1) ... [2022-12-13 20:40:00,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:00" (1/1) ... [2022-12-13 20:40:01,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:00" (1/1) ... [2022-12-13 20:40:01,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:00" (1/1) ... [2022-12-13 20:40:01,032 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:00" (1/1) ... [2022-12-13 20:40:01,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:00" (1/1) ... [2022-12-13 20:40:01,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:40:01,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:40:01,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:40:01,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:40:01,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:00" (1/1) ... [2022-12-13 20:40:01,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:40:01,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:40:01,069 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:40:01,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:40:01,103 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2022-12-13 20:40:01,103 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2022-12-13 20:40:01,103 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_lock [2022-12-13 20:40:01,103 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_lock [2022-12-13 20:40:01,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-12-13 20:40:01,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-12-13 20:40:01,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 20:40:01,103 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2022-12-13 20:40:01,104 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2022-12-13 20:40:01,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2022-12-13 20:40:01,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2022-12-13 20:40:01,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-12-13 20:40:01,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-12-13 20:40:01,104 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2022-12-13 20:40:01,104 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2022-12-13 20:40:01,104 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2022-12-13 20:40:01,104 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2022-12-13 20:40:01,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-12-13 20:40:01,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-12-13 20:40:01,105 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-12-13 20:40:01,105 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-12-13 20:40:01,105 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2022-12-13 20:40:01,105 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2022-12-13 20:40:01,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 20:40:01,105 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-12-13 20:40:01,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-12-13 20:40:01,105 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2022-12-13 20:40:01,105 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2022-12-13 20:40:01,105 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2022-12-13 20:40:01,105 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2022-12-13 20:40:01,106 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2022-12-13 20:40:01,106 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2022-12-13 20:40:01,106 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 20:40:01,106 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 20:40:01,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 20:40:01,106 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2022-12-13 20:40:01,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2022-12-13 20:40:01,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:40:01,106 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-12-13 20:40:01,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-12-13 20:40:01,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 20:40:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 20:40:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2022-12-13 20:40:01,107 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2022-12-13 20:40:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 20:40:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2022-12-13 20:40:01,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2022-12-13 20:40:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2022-12-13 20:40:01,107 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2022-12-13 20:40:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 20:40:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 20:40:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_delay [2022-12-13 20:40:01,107 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_delay [2022-12-13 20:40:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-12-13 20:40:01,108 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-12-13 20:40:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_unlock [2022-12-13 20:40:01,108 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_unlock [2022-12-13 20:40:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2022-12-13 20:40:01,108 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2022-12-13 20:40:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:40:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-12-13 20:40:01,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-12-13 20:40:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2022-12-13 20:40:01,108 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2022-12-13 20:40:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:40:01,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:40:01,292 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:40:01,294 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:40:01,387 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-12-13 20:40:01,854 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:40:01,861 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:40:01,861 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 20:40:01,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:40:01 BoogieIcfgContainer [2022-12-13 20:40:01,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:40:01,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:40:01,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:40:01,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:40:01,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:40:00" (1/3) ... [2022-12-13 20:40:01,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a90ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:40:01, skipping insertion in model container [2022-12-13 20:40:01,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:40:00" (2/3) ... [2022-12-13 20:40:01,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a90ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:40:01, skipping insertion in model container [2022-12-13 20:40:01,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:40:01" (3/3) ... [2022-12-13 20:40:01,869 INFO L112 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2022-12-13 20:40:01,883 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:40:01,883 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 20:40:01,922 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:40:01,927 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=true, mAutomataTypeConcurrency=PETRI_NET, 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;@6d4031b0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:40:01,927 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 20:40:01,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 344 states, 255 states have (on average 1.407843137254902) internal successors, (359), 271 states have internal predecessors, (359), 61 states have call successors, (61), 27 states have call predecessors, (61), 26 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2022-12-13 20:40:01,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 20:40:01,941 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:40:01,942 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:01,942 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:40:01,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:01,946 INFO L85 PathProgramCache]: Analyzing trace with hash -623334791, now seen corresponding path program 1 times [2022-12-13 20:40:01,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:01,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076807071] [2022-12-13 20:40:01,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:01,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:02,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:40:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:02,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 20:40:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:02,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 20:40:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:02,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 20:40:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:02,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 20:40:02,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:02,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076807071] [2022-12-13 20:40:02,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076807071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:40:02,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:40:02,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:40:02,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063017473] [2022-12-13 20:40:02,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:40:02,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:40:02,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:02,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:40:02,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:40:02,285 INFO L87 Difference]: Start difference. First operand has 344 states, 255 states have (on average 1.407843137254902) internal successors, (359), 271 states have internal predecessors, (359), 61 states have call successors, (61), 27 states have call predecessors, (61), 26 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 20:40:03,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:03,102 INFO L93 Difference]: Finished difference Result 1001 states and 1410 transitions. [2022-12-13 20:40:03,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:40:03,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-12-13 20:40:03,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:03,114 INFO L225 Difference]: With dead ends: 1001 [2022-12-13 20:40:03,114 INFO L226 Difference]: Without dead ends: 565 [2022-12-13 20:40:03,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:40:03,120 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 624 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 20:40:03,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 727 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 20:40:03,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-12-13 20:40:03,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 521. [2022-12-13 20:40:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 394 states have (on average 1.3756345177664975) internal successors, (542), 405 states have internal predecessors, (542), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2022-12-13 20:40:03,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 709 transitions. [2022-12-13 20:40:03,190 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 709 transitions. Word has length 45 [2022-12-13 20:40:03,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:40:03,190 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 709 transitions. [2022-12-13 20:40:03,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 20:40:03,191 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 709 transitions. [2022-12-13 20:40:03,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 20:40:03,195 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:40:03,195 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:03,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:40:03,195 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:40:03,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:03,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1815099580, now seen corresponding path program 1 times [2022-12-13 20:40:03,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:03,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303155886] [2022-12-13 20:40:03,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:03,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:03,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:40:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:03,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 20:40:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:03,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 20:40:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:03,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 20:40:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 20:40:03,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:03,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303155886] [2022-12-13 20:40:03,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303155886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:40:03,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:40:03,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:40:03,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279381350] [2022-12-13 20:40:03,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:40:03,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:40:03,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:03,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:40:03,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:40:03,320 INFO L87 Difference]: Start difference. First operand 521 states and 709 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 20:40:03,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:03,728 INFO L93 Difference]: Finished difference Result 1063 states and 1456 transitions. [2022-12-13 20:40:03,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:40:03,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-12-13 20:40:03,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:03,731 INFO L225 Difference]: With dead ends: 1063 [2022-12-13 20:40:03,731 INFO L226 Difference]: Without dead ends: 562 [2022-12-13 20:40:03,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:40:03,733 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 530 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 20:40:03,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 493 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 20:40:03,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-12-13 20:40:03,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 521. [2022-12-13 20:40:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 394 states have (on average 1.3730964467005076) internal successors, (541), 405 states have internal predecessors, (541), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2022-12-13 20:40:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 708 transitions. [2022-12-13 20:40:03,765 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 708 transitions. Word has length 47 [2022-12-13 20:40:03,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:40:03,766 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 708 transitions. [2022-12-13 20:40:03,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 20:40:03,766 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 708 transitions. [2022-12-13 20:40:03,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-13 20:40:03,768 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:40:03,768 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:03,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 20:40:03,768 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:40:03,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:03,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1714265753, now seen corresponding path program 1 times [2022-12-13 20:40:03,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:03,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601784251] [2022-12-13 20:40:03,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:03,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:03,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:40:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:03,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 20:40:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:03,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 20:40:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:03,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 20:40:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 20:40:03,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:03,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601784251] [2022-12-13 20:40:03,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601784251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:40:03,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:40:03,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:40:03,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605998629] [2022-12-13 20:40:03,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:40:03,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:40:03,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:03,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:40:03,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:40:03,861 INFO L87 Difference]: Start difference. First operand 521 states and 708 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 20:40:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:04,538 INFO L93 Difference]: Finished difference Result 1040 states and 1462 transitions. [2022-12-13 20:40:04,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:40:04,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2022-12-13 20:40:04,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:04,545 INFO L225 Difference]: With dead ends: 1040 [2022-12-13 20:40:04,545 INFO L226 Difference]: Without dead ends: 1011 [2022-12-13 20:40:04,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:40:04,547 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 616 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 20:40:04,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 766 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 20:40:04,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-12-13 20:40:04,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 924. [2022-12-13 20:40:04,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 711 states have (on average 1.410689170182841) internal successors, (1003), 735 states have internal predecessors, (1003), 143 states have call successors, (143), 69 states have call predecessors, (143), 69 states have return successors, (147), 131 states have call predecessors, (147), 138 states have call successors, (147) [2022-12-13 20:40:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1293 transitions. [2022-12-13 20:40:04,604 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1293 transitions. Word has length 50 [2022-12-13 20:40:04,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:40:04,604 INFO L495 AbstractCegarLoop]: Abstraction has 924 states and 1293 transitions. [2022-12-13 20:40:04,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 20:40:04,604 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1293 transitions. [2022-12-13 20:40:04,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 20:40:04,607 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:40:04,607 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:04,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 20:40:04,607 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:40:04,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:04,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1240627471, now seen corresponding path program 1 times [2022-12-13 20:40:04,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:04,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786329416] [2022-12-13 20:40:04,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:04,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:04,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:40:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:04,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 20:40:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:04,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 20:40:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:04,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 20:40:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:04,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:40:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:04,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 20:40:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 20:40:04,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:04,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786329416] [2022-12-13 20:40:04,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786329416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:40:04,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:40:04,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:40:04,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646109124] [2022-12-13 20:40:04,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:40:04,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:40:04,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:04,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:40:04,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:40:04,722 INFO L87 Difference]: Start difference. First operand 924 states and 1293 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 20:40:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:05,743 INFO L93 Difference]: Finished difference Result 2728 states and 3817 transitions. [2022-12-13 20:40:05,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 20:40:05,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2022-12-13 20:40:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:05,753 INFO L225 Difference]: With dead ends: 2728 [2022-12-13 20:40:05,753 INFO L226 Difference]: Without dead ends: 1824 [2022-12-13 20:40:05,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:40:05,756 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 1114 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 20:40:05,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 931 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 20:40:05,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2022-12-13 20:40:05,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1643. [2022-12-13 20:40:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1643 states, 1272 states have (on average 1.4111635220125787) internal successors, (1795), 1312 states have internal predecessors, (1795), 247 states have call successors, (247), 126 states have call predecessors, (247), 123 states have return successors, (246), 228 states have call predecessors, (246), 242 states have call successors, (246) [2022-12-13 20:40:05,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2288 transitions. [2022-12-13 20:40:05,831 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 2288 transitions. Word has length 65 [2022-12-13 20:40:05,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:40:05,832 INFO L495 AbstractCegarLoop]: Abstraction has 1643 states and 2288 transitions. [2022-12-13 20:40:05,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 20:40:05,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2288 transitions. [2022-12-13 20:40:05,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 20:40:05,835 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:40:05,835 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:05,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 20:40:05,835 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:40:05,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:05,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1517613762, now seen corresponding path program 1 times [2022-12-13 20:40:05,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:05,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890204450] [2022-12-13 20:40:05,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:05,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:05,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:40:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:05,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 20:40:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:05,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 20:40:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:05,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 20:40:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:05,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:40:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:05,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 20:40:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:05,925 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 20:40:05,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:05,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890204450] [2022-12-13 20:40:05,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890204450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:40:05,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:40:05,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:40:05,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800521170] [2022-12-13 20:40:05,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:40:05,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:40:05,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:05,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:40:05,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:40:05,926 INFO L87 Difference]: Start difference. First operand 1643 states and 2288 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 20:40:06,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:06,593 INFO L93 Difference]: Finished difference Result 4057 states and 5823 transitions. [2022-12-13 20:40:06,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:40:06,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2022-12-13 20:40:06,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:06,601 INFO L225 Difference]: With dead ends: 4057 [2022-12-13 20:40:06,601 INFO L226 Difference]: Without dead ends: 2434 [2022-12-13 20:40:06,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:40:06,604 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 565 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 20:40:06,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1293 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 20:40:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2022-12-13 20:40:06,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 1647. [2022-12-13 20:40:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1276 states have (on average 1.4098746081504703) internal successors, (1799), 1316 states have internal predecessors, (1799), 247 states have call successors, (247), 126 states have call predecessors, (247), 123 states have return successors, (246), 228 states have call predecessors, (246), 242 states have call successors, (246) [2022-12-13 20:40:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2292 transitions. [2022-12-13 20:40:06,684 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2292 transitions. Word has length 73 [2022-12-13 20:40:06,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:40:06,685 INFO L495 AbstractCegarLoop]: Abstraction has 1647 states and 2292 transitions. [2022-12-13 20:40:06,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 20:40:06,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2292 transitions. [2022-12-13 20:40:06,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 20:40:06,687 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:40:06,688 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:06,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 20:40:06,688 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:40:06,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:06,688 INFO L85 PathProgramCache]: Analyzing trace with hash -531774080, now seen corresponding path program 1 times [2022-12-13 20:40:06,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:06,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456293349] [2022-12-13 20:40:06,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:06,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:06,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:40:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:06,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 20:40:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:06,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 20:40:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:06,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 20:40:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:06,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:40:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:06,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 20:40:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:06,791 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 20:40:06,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:06,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456293349] [2022-12-13 20:40:06,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456293349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:40:06,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:40:06,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 20:40:06,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923507397] [2022-12-13 20:40:06,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:40:06,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:40:06,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:06,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:40:06,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:40:06,794 INFO L87 Difference]: Start difference. First operand 1647 states and 2292 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 20:40:07,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:07,464 INFO L93 Difference]: Finished difference Result 3438 states and 4800 transitions. [2022-12-13 20:40:07,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 20:40:07,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2022-12-13 20:40:07,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:07,470 INFO L225 Difference]: With dead ends: 3438 [2022-12-13 20:40:07,470 INFO L226 Difference]: Without dead ends: 1783 [2022-12-13 20:40:07,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:40:07,473 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 368 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 20:40:07,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1153 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 20:40:07,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2022-12-13 20:40:07,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1627. [2022-12-13 20:40:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1260 states have (on average 1.4055555555555554) internal successors, (1771), 1300 states have internal predecessors, (1771), 243 states have call successors, (243), 126 states have call predecessors, (243), 123 states have return successors, (242), 224 states have call predecessors, (242), 238 states have call successors, (242) [2022-12-13 20:40:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 2256 transitions. [2022-12-13 20:40:07,547 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 2256 transitions. Word has length 73 [2022-12-13 20:40:07,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:40:07,547 INFO L495 AbstractCegarLoop]: Abstraction has 1627 states and 2256 transitions. [2022-12-13 20:40:07,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 20:40:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2256 transitions. [2022-12-13 20:40:07,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 20:40:07,548 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:40:07,548 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:07,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 20:40:07,549 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:40:07,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:07,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1778660840, now seen corresponding path program 1 times [2022-12-13 20:40:07,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:07,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070532059] [2022-12-13 20:40:07,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:07,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:07,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:40:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:07,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 20:40:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:07,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 20:40:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:07,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 20:40:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:07,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:40:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:07,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 20:40:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 20:40:07,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:07,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070532059] [2022-12-13 20:40:07,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070532059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:40:07,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:40:07,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:40:07,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038801096] [2022-12-13 20:40:07,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:40:07,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:40:07,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:07,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:40:07,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:40:07,629 INFO L87 Difference]: Start difference. First operand 1627 states and 2256 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 20:40:08,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:08,440 INFO L93 Difference]: Finished difference Result 4848 states and 6728 transitions. [2022-12-13 20:40:08,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 20:40:08,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 71 [2022-12-13 20:40:08,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:08,453 INFO L225 Difference]: With dead ends: 4848 [2022-12-13 20:40:08,453 INFO L226 Difference]: Without dead ends: 3241 [2022-12-13 20:40:08,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:40:08,462 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 764 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 20:40:08,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 1010 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 20:40:08,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2022-12-13 20:40:08,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 2912. [2022-12-13 20:40:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2912 states, 2254 states have (on average 1.4006211180124224) internal successors, (3157), 2330 states have internal predecessors, (3157), 428 states have call successors, (428), 230 states have call predecessors, (428), 229 states have return successors, (431), 395 states have call predecessors, (431), 423 states have call successors, (431) [2022-12-13 20:40:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2912 states and 4016 transitions. [2022-12-13 20:40:08,582 INFO L78 Accepts]: Start accepts. Automaton has 2912 states and 4016 transitions. Word has length 71 [2022-12-13 20:40:08,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:40:08,582 INFO L495 AbstractCegarLoop]: Abstraction has 2912 states and 4016 transitions. [2022-12-13 20:40:08,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 20:40:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2912 states and 4016 transitions. [2022-12-13 20:40:08,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-13 20:40:08,585 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:40:08,585 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:08,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 20:40:08,585 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:40:08,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:08,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1495438409, now seen corresponding path program 1 times [2022-12-13 20:40:08,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:08,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655695184] [2022-12-13 20:40:08,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:08,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:08,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:40:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:08,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 20:40:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:08,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 20:40:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:08,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 20:40:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:08,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 20:40:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:08,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:40:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:08,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 20:40:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:08,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 20:40:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:08,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 20:40:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:08,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 20:40:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:08,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:40:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:08,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 20:40:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 20:40:08,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:08,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655695184] [2022-12-13 20:40:08,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655695184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:40:08,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:40:08,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 20:40:08,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585916581] [2022-12-13 20:40:08,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:40:08,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:40:08,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:08,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:40:08,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:40:08,782 INFO L87 Difference]: Start difference. First operand 2912 states and 4016 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 20:40:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:10,050 INFO L93 Difference]: Finished difference Result 7751 states and 10760 transitions. [2022-12-13 20:40:10,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 20:40:10,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2022-12-13 20:40:10,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:10,063 INFO L225 Difference]: With dead ends: 7751 [2022-12-13 20:40:10,064 INFO L226 Difference]: Without dead ends: 4859 [2022-12-13 20:40:10,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-12-13 20:40:10,069 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 791 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:40:10,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 2220 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-13 20:40:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4859 states. [2022-12-13 20:40:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4859 to 4378. [2022-12-13 20:40:10,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4378 states, 3408 states have (on average 1.3952464788732395) internal successors, (4755), 3524 states have internal predecessors, (4755), 627 states have call successors, (627), 341 states have call predecessors, (627), 342 states have return successors, (634), 580 states have call predecessors, (634), 622 states have call successors, (634) [2022-12-13 20:40:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4378 states to 4378 states and 6016 transitions. [2022-12-13 20:40:10,276 INFO L78 Accepts]: Start accepts. Automaton has 4378 states and 6016 transitions. Word has length 117 [2022-12-13 20:40:10,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:40:10,277 INFO L495 AbstractCegarLoop]: Abstraction has 4378 states and 6016 transitions. [2022-12-13 20:40:10,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 20:40:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 4378 states and 6016 transitions. [2022-12-13 20:40:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-12-13 20:40:10,281 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:40:10,281 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:10,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 20:40:10,281 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:40:10,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:10,282 INFO L85 PathProgramCache]: Analyzing trace with hash 377644094, now seen corresponding path program 1 times [2022-12-13 20:40:10,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:10,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236988455] [2022-12-13 20:40:10,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:10,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:10,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:40:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:10,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 20:40:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:10,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 20:40:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:10,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 20:40:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:10,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 20:40:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:10,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:40:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:10,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 20:40:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:10,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 20:40:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:10,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 20:40:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:10,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 20:40:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:10,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:40:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:10,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-12-13 20:40:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:10,441 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 20:40:10,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:10,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236988455] [2022-12-13 20:40:10,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236988455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:40:10,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:40:10,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 20:40:10,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697855889] [2022-12-13 20:40:10,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:40:10,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:40:10,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:10,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:40:10,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:40:10,443 INFO L87 Difference]: Start difference. First operand 4378 states and 6016 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 20:40:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:11,688 INFO L93 Difference]: Finished difference Result 11633 states and 16097 transitions. [2022-12-13 20:40:11,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 20:40:11,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2022-12-13 20:40:11,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:11,707 INFO L225 Difference]: With dead ends: 11633 [2022-12-13 20:40:11,708 INFO L226 Difference]: Without dead ends: 7275 [2022-12-13 20:40:11,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-12-13 20:40:11,714 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 922 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 20:40:11,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 1262 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 20:40:11,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7275 states. [2022-12-13 20:40:12,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7275 to 6570. [2022-12-13 20:40:12,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6570 states, 5141 states have (on average 1.390390974518576) internal successors, (7148), 5317 states have internal predecessors, (7148), 918 states have call successors, (918), 506 states have call predecessors, (918), 510 states have return successors, (931), 850 states have call predecessors, (931), 913 states have call successors, (931) [2022-12-13 20:40:12,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6570 states to 6570 states and 8997 transitions. [2022-12-13 20:40:12,044 INFO L78 Accepts]: Start accepts. Automaton has 6570 states and 8997 transitions. Word has length 123 [2022-12-13 20:40:12,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:40:12,044 INFO L495 AbstractCegarLoop]: Abstraction has 6570 states and 8997 transitions. [2022-12-13 20:40:12,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 20:40:12,044 INFO L276 IsEmpty]: Start isEmpty. Operand 6570 states and 8997 transitions. [2022-12-13 20:40:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-13 20:40:12,050 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:40:12,050 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:12,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 20:40:12,050 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:40:12,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:12,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1804436563, now seen corresponding path program 1 times [2022-12-13 20:40:12,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:12,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340366329] [2022-12-13 20:40:12,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:12,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:12,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:40:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:12,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 20:40:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:12,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 20:40:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:12,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 20:40:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:12,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 20:40:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:12,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:40:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:12,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 20:40:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:12,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 20:40:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:12,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 20:40:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:12,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 20:40:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:12,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:40:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:12,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 20:40:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:12,243 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 20:40:12,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:12,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340366329] [2022-12-13 20:40:12,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340366329] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:40:12,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416943860] [2022-12-13 20:40:12,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:12,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:40:12,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:40:12,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:40:12,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 20:40:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:12,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 20:40:12,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:40:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 20:40:12,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:40:12,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416943860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:40:12,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:40:12,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-12-13 20:40:12,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719643939] [2022-12-13 20:40:12,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:40:12,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:40:12,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:12,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:40:12,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-13 20:40:12,527 INFO L87 Difference]: Start difference. First operand 6570 states and 8997 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 20:40:12,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:12,930 INFO L93 Difference]: Finished difference Result 13228 states and 18133 transitions. [2022-12-13 20:40:12,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:40:12,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 127 [2022-12-13 20:40:12,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:12,949 INFO L225 Difference]: With dead ends: 13228 [2022-12-13 20:40:12,949 INFO L226 Difference]: Without dead ends: 6552 [2022-12-13 20:40:12,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-12-13 20:40:12,957 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 6 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:40:12,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1751 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:40:12,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6552 states. [2022-12-13 20:40:13,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6552 to 6552. [2022-12-13 20:40:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6552 states, 5105 states have (on average 1.3860920666013712) internal successors, (7076), 5290 states have internal predecessors, (7076), 936 states have call successors, (936), 506 states have call predecessors, (936), 510 states have return successors, (940), 859 states have call predecessors, (940), 922 states have call successors, (940) [2022-12-13 20:40:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6552 states to 6552 states and 8952 transitions. [2022-12-13 20:40:13,301 INFO L78 Accepts]: Start accepts. Automaton has 6552 states and 8952 transitions. Word has length 127 [2022-12-13 20:40:13,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:40:13,301 INFO L495 AbstractCegarLoop]: Abstraction has 6552 states and 8952 transitions. [2022-12-13 20:40:13,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 20:40:13,301 INFO L276 IsEmpty]: Start isEmpty. Operand 6552 states and 8952 transitions. [2022-12-13 20:40:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-13 20:40:13,308 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:40:13,308 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:13,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 20:40:13,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 20:40:13,509 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:40:13,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:13,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1348555176, now seen corresponding path program 1 times [2022-12-13 20:40:13,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:13,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017205198] [2022-12-13 20:40:13,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:13,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:13,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:40:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:13,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 20:40:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:13,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 20:40:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:13,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 20:40:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:13,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 20:40:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:13,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:40:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:13,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 20:40:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:13,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 20:40:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:13,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 20:40:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:13,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-12-13 20:40:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:13,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:40:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:13,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 20:40:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 20:40:13,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:13,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017205198] [2022-12-13 20:40:13,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017205198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:40:13,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:40:13,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 20:40:13,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605852461] [2022-12-13 20:40:13,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:40:13,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:40:13,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:13,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:40:13,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:40:13,692 INFO L87 Difference]: Start difference. First operand 6552 states and 8952 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 20:40:14,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:14,696 INFO L93 Difference]: Finished difference Result 13718 states and 18806 transitions. [2022-12-13 20:40:14,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 20:40:14,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 129 [2022-12-13 20:40:14,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:14,722 INFO L225 Difference]: With dead ends: 13718 [2022-12-13 20:40:14,722 INFO L226 Difference]: Without dead ends: 7186 [2022-12-13 20:40:14,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-12-13 20:40:14,731 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 887 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 20:40:14,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 845 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 20:40:14,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7186 states. [2022-12-13 20:40:15,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7186 to 6516. [2022-12-13 20:40:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6516 states, 5069 states have (on average 1.3817320970605642) internal successors, (7004), 5254 states have internal predecessors, (7004), 936 states have call successors, (936), 506 states have call predecessors, (936), 510 states have return successors, (940), 859 states have call predecessors, (940), 922 states have call successors, (940) [2022-12-13 20:40:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6516 states to 6516 states and 8880 transitions. [2022-12-13 20:40:15,049 INFO L78 Accepts]: Start accepts. Automaton has 6516 states and 8880 transitions. Word has length 129 [2022-12-13 20:40:15,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:40:15,050 INFO L495 AbstractCegarLoop]: Abstraction has 6516 states and 8880 transitions. [2022-12-13 20:40:15,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 20:40:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 6516 states and 8880 transitions. [2022-12-13 20:40:15,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-12-13 20:40:15,054 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:40:15,054 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:15,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 20:40:15,054 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:40:15,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:15,055 INFO L85 PathProgramCache]: Analyzing trace with hash 950003805, now seen corresponding path program 1 times [2022-12-13 20:40:15,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:15,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197114063] [2022-12-13 20:40:15,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:15,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:15,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:40:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:15,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 20:40:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:15,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 20:40:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:15,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 20:40:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:15,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 20:40:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:15,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:40:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:15,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 20:40:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:15,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 20:40:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:15,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 20:40:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:15,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 20:40:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:15,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:40:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:15,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 20:40:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 20:40:15,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:15,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197114063] [2022-12-13 20:40:15,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197114063] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:40:15,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871305973] [2022-12-13 20:40:15,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:15,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:40:15,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:40:15,234 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:40:15,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 20:40:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:15,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 20:40:15,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:40:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 20:40:15,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:40:15,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871305973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:40:15,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:40:15,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2022-12-13 20:40:15,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344555523] [2022-12-13 20:40:15,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:40:15,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:40:15,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:15,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:40:15,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 20:40:15,540 INFO L87 Difference]: Start difference. First operand 6516 states and 8880 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-12-13 20:40:16,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:16,610 INFO L93 Difference]: Finished difference Result 19487 states and 26569 transitions. [2022-12-13 20:40:16,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:40:16,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 130 [2022-12-13 20:40:16,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:16,649 INFO L225 Difference]: With dead ends: 19487 [2022-12-13 20:40:16,649 INFO L226 Difference]: Without dead ends: 19460 [2022-12-13 20:40:16,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 20:40:16,654 INFO L413 NwaCegarLoop]: 838 mSDtfsCounter, 759 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:40:16,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1642 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:40:16,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19460 states. [2022-12-13 20:40:17,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19460 to 19310. [2022-12-13 20:40:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19310 states, 15003 states have (on average 1.3859228154369125) internal successors, (20793), 15558 states have internal predecessors, (20793), 2784 states have call successors, (2784), 1500 states have call predecessors, (2784), 1522 states have return successors, (2806), 2563 states have call predecessors, (2806), 2752 states have call successors, (2806) [2022-12-13 20:40:17,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19310 states to 19310 states and 26383 transitions. [2022-12-13 20:40:17,550 INFO L78 Accepts]: Start accepts. Automaton has 19310 states and 26383 transitions. Word has length 130 [2022-12-13 20:40:17,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:40:17,551 INFO L495 AbstractCegarLoop]: Abstraction has 19310 states and 26383 transitions. [2022-12-13 20:40:17,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-12-13 20:40:17,551 INFO L276 IsEmpty]: Start isEmpty. Operand 19310 states and 26383 transitions. [2022-12-13 20:40:17,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-13 20:40:17,563 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:40:17,564 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:17,569 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 20:40:17,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 20:40:17,764 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:40:17,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:17,765 INFO L85 PathProgramCache]: Analyzing trace with hash 695562037, now seen corresponding path program 1 times [2022-12-13 20:40:17,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:17,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684589810] [2022-12-13 20:40:17,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:17,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:17,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:40:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:17,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 20:40:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:17,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 20:40:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:17,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 20:40:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:17,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 20:40:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:17,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:40:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:17,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 20:40:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:17,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 20:40:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:17,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 20:40:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:17,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 20:40:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:17,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:40:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:17,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-12-13 20:40:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 20:40:17,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:17,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684589810] [2022-12-13 20:40:17,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684589810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:40:17,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:40:17,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 20:40:17,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152461569] [2022-12-13 20:40:17,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:40:17,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:40:17,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:17,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:40:17,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:40:17,964 INFO L87 Difference]: Start difference. First operand 19310 states and 26383 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 20:40:19,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:19,201 INFO L93 Difference]: Finished difference Result 25888 states and 35558 transitions. [2022-12-13 20:40:19,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 20:40:19,202 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 135 [2022-12-13 20:40:19,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:19,214 INFO L225 Difference]: With dead ends: 25888 [2022-12-13 20:40:19,215 INFO L226 Difference]: Without dead ends: 6411 [2022-12-13 20:40:19,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-12-13 20:40:19,242 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 693 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 20:40:19,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1163 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 20:40:19,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2022-12-13 20:40:19,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 6290. [2022-12-13 20:40:19,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6290 states, 5034 states have (on average 1.4040524433849821) internal successors, (7068), 5157 states have internal predecessors, (7068), 795 states have call successors, (795), 465 states have call predecessors, (795), 460 states have return successors, (790), 775 states have call predecessors, (790), 790 states have call successors, (790) [2022-12-13 20:40:19,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6290 states to 6290 states and 8653 transitions. [2022-12-13 20:40:19,548 INFO L78 Accepts]: Start accepts. Automaton has 6290 states and 8653 transitions. Word has length 135 [2022-12-13 20:40:19,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:40:19,548 INFO L495 AbstractCegarLoop]: Abstraction has 6290 states and 8653 transitions. [2022-12-13 20:40:19,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 20:40:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand 6290 states and 8653 transitions. [2022-12-13 20:40:19,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-13 20:40:19,555 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:40:19,555 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:19,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 20:40:19,555 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:40:19,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:19,555 INFO L85 PathProgramCache]: Analyzing trace with hash 151035555, now seen corresponding path program 1 times [2022-12-13 20:40:19,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:19,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799500864] [2022-12-13 20:40:19,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:19,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:19,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:40:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:19,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 20:40:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:19,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 20:40:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:19,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 20:40:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:19,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 20:40:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:19,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:40:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:19,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 20:40:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:19,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 20:40:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:19,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 20:40:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:19,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 20:40:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:19,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:40:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:19,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-12-13 20:40:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-13 20:40:19,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:19,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799500864] [2022-12-13 20:40:19,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799500864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:40:19,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:40:19,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 20:40:19,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260863751] [2022-12-13 20:40:19,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:40:19,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:40:19,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:19,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:40:19,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:40:19,758 INFO L87 Difference]: Start difference. First operand 6290 states and 8653 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 20:40:20,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:20,894 INFO L93 Difference]: Finished difference Result 16378 states and 23321 transitions. [2022-12-13 20:40:20,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 20:40:20,895 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 139 [2022-12-13 20:40:20,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:20,910 INFO L225 Difference]: With dead ends: 16378 [2022-12-13 20:40:20,911 INFO L226 Difference]: Without dead ends: 10108 [2022-12-13 20:40:20,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 20:40:20,916 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 844 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 510 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 20:40:20,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1024 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [510 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 20:40:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10108 states. [2022-12-13 20:40:21,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10108 to 6293. [2022-12-13 20:40:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6293 states, 5037 states have (on average 1.40381179273377) internal successors, (7071), 5160 states have internal predecessors, (7071), 795 states have call successors, (795), 465 states have call predecessors, (795), 460 states have return successors, (790), 775 states have call predecessors, (790), 790 states have call successors, (790) [2022-12-13 20:40:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6293 states to 6293 states and 8656 transitions. [2022-12-13 20:40:21,184 INFO L78 Accepts]: Start accepts. Automaton has 6293 states and 8656 transitions. Word has length 139 [2022-12-13 20:40:21,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:40:21,184 INFO L495 AbstractCegarLoop]: Abstraction has 6293 states and 8656 transitions. [2022-12-13 20:40:21,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 20:40:21,184 INFO L276 IsEmpty]: Start isEmpty. Operand 6293 states and 8656 transitions. [2022-12-13 20:40:21,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-12-13 20:40:21,190 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:40:21,190 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:21,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 20:40:21,191 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:40:21,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:21,191 INFO L85 PathProgramCache]: Analyzing trace with hash -679502686, now seen corresponding path program 1 times [2022-12-13 20:40:21,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:21,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722425076] [2022-12-13 20:40:21,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:21,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:21,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:40:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:21,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 20:40:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:21,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 20:40:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:21,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 20:40:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:21,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 20:40:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:21,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:40:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:21,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 20:40:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:21,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 20:40:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:21,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 20:40:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:21,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:40:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:21,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:40:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:21,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 20:40:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:21,515 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-13 20:40:21,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:21,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722425076] [2022-12-13 20:40:21,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722425076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:40:21,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:40:21,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 20:40:21,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172214626] [2022-12-13 20:40:21,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:40:21,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 20:40:21,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:21,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 20:40:21,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 20:40:21,518 INFO L87 Difference]: Start difference. First operand 6293 states and 8656 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 20:40:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:22,241 INFO L93 Difference]: Finished difference Result 6956 states and 9519 transitions. [2022-12-13 20:40:22,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 20:40:22,241 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 141 [2022-12-13 20:40:22,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:22,242 INFO L225 Difference]: With dead ends: 6956 [2022-12-13 20:40:22,242 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 20:40:22,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 20:40:22,246 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 675 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 20:40:22,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 524 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 20:40:22,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 20:40:22,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 20:40:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 20:40:22,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 20:40:22,248 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 141 [2022-12-13 20:40:22,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:40:22,248 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 20:40:22,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 20:40:22,248 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 20:40:22,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 20:40:22,250 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 20:40:22,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 20:40:22,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 20:41:15,856 WARN L233 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 80 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:41:22,342 WARN L233 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 80 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:41:28,900 WARN L233 SmtUtils]: Spent 6.55s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:41:35,397 WARN L233 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:41:41,892 WARN L233 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:41:48,422 WARN L233 SmtUtils]: Spent 6.53s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:43:06,942 WARN L233 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 80 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:43:13,449 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 80 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:43:19,954 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:43:26,441 WARN L233 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:43:32,938 WARN L233 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:43:39,430 WARN L233 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:44:57,208 WARN L233 SmtUtils]: Spent 7.62s on a formula simplification. DAG size of input: 80 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:45:03,715 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 80 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:45:10,257 WARN L233 SmtUtils]: Spent 6.54s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:45:17,031 WARN L233 SmtUtils]: Spent 6.77s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:45:23,537 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:45:30,859 WARN L233 SmtUtils]: Spent 7.32s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:46:27,753 WARN L233 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 80 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:46:34,357 WARN L233 SmtUtils]: Spent 6.60s on a formula simplification. DAG size of input: 80 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:46:41,259 WARN L233 SmtUtils]: Spent 6.90s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:46:48,434 WARN L233 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:46:55,358 WARN L233 SmtUtils]: Spent 6.92s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:47:02,753 WARN L233 SmtUtils]: Spent 7.39s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:47:09,706 WARN L233 SmtUtils]: Spent 6.85s on a formula simplification. DAG size of input: 80 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:47:16,202 WARN L233 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 80 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:47:22,721 WARN L233 SmtUtils]: Spent 6.52s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:47:29,221 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:47:35,713 WARN L233 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:47:42,334 WARN L233 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 20:48:57,808 INFO L899 garLoopResultBuilder]: For program point _torture_stop_kthreadEXIT(lines 2972 2974) no Hoare annotation was computed. [2022-12-13 20:48:57,808 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2972 2974) the Hoare annotation is: true [2022-12-13 20:48:57,808 INFO L899 garLoopResultBuilder]: For program point _torture_stop_kthreadFINAL(lines 2972 2974) no Hoare annotation was computed. [2022-12-13 20:48:57,808 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 3078 3080) no Hoare annotation was computed. [2022-12-13 20:48:57,808 INFO L899 garLoopResultBuilder]: For program point kfreeFINAL(lines 3078 3080) no Hoare annotation was computed. [2022-12-13 20:48:57,809 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 3078 3080) the Hoare annotation is: (= |old(#valid)| |#valid|) [2022-12-13 20:48:57,809 INFO L899 garLoopResultBuilder]: For program point torture_lock_busted_write_delayEXIT(lines 2087 2112) no Hoare annotation was computed. [2022-12-13 20:48:57,809 INFO L902 garLoopResultBuilder]: At program point ldv_22671(lines 2096 2108) the Hoare annotation is: true [2022-12-13 20:48:57,809 INFO L899 garLoopResultBuilder]: For program point L2104(lines 2104 2107) no Hoare annotation was computed. [2022-12-13 20:48:57,809 INFO L902 garLoopResultBuilder]: At program point L2100(lines 2096 2108) the Hoare annotation is: true [2022-12-13 20:48:57,809 INFO L899 garLoopResultBuilder]: For program point L2096(lines 2096 2109) no Hoare annotation was computed. [2022-12-13 20:48:57,809 INFO L899 garLoopResultBuilder]: For program point L2095-1(line 2095) no Hoare annotation was computed. [2022-12-13 20:48:57,809 INFO L899 garLoopResultBuilder]: For program point L2096-2(lines 2087 2112) no Hoare annotation was computed. [2022-12-13 20:48:57,809 INFO L902 garLoopResultBuilder]: At program point L2095(line 2095) the Hoare annotation is: true [2022-12-13 20:48:57,809 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2087 2112) the Hoare annotation is: true [2022-12-13 20:48:57,809 INFO L899 garLoopResultBuilder]: For program point L2865-1(line 2865) no Hoare annotation was computed. [2022-12-13 20:48:57,809 INFO L895 garLoopResultBuilder]: At program point _raw_spin_unlock_irqrestore_returnLabel#1(lines 2965 2967) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (= ~ldv_spin~0 0) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-12-13 20:48:57,809 INFO L899 garLoopResultBuilder]: For program point torture_lock_spin_write_unlock_irqEXIT(lines 2182 2188) no Hoare annotation was computed. [2022-12-13 20:48:57,809 INFO L895 garLoopResultBuilder]: At program point L2865(line 2865) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-12-13 20:48:57,810 INFO L895 garLoopResultBuilder]: At program point ldv_spin_unlock_irqrestore_8_returnLabel#1(lines 1925 1931) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (= ~ldv_spin~0 0) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-12-13 20:48:57,810 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2182 2188) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-12-13 20:48:57,810 INFO L895 garLoopResultBuilder]: At program point spin_unlock_irqrestore_returnLabel#1(lines 2862 2869) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (= ~ldv_spin~0 0) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-12-13 20:48:57,810 INFO L899 garLoopResultBuilder]: For program point torture_lock_spin_write_unlock_irqFINAL(lines 2182 2188) no Hoare annotation was computed. [2022-12-13 20:48:57,810 INFO L899 garLoopResultBuilder]: For program point __const_udelayFINAL(lines 2953 2955) no Hoare annotation was computed. [2022-12-13 20:48:57,810 INFO L899 garLoopResultBuilder]: For program point __const_udelayEXIT(lines 2953 2955) no Hoare annotation was computed. [2022-12-13 20:48:57,810 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2953 2955) the Hoare annotation is: true [2022-12-13 20:48:57,810 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 2009 2015) no Hoare annotation was computed. [2022-12-13 20:48:57,811 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 2009 2015) the Hoare annotation is: true [2022-12-13 20:48:57,811 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2013) no Hoare annotation was computed. [2022-12-13 20:48:57,811 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2009 2015) no Hoare annotation was computed. [2022-12-13 20:48:57,811 INFO L899 garLoopResultBuilder]: For program point torture_lock_busted_write_lockFINAL(lines 2081 2086) no Hoare annotation was computed. [2022-12-13 20:48:57,811 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2081 2086) the Hoare annotation is: true [2022-12-13 20:48:57,811 INFO L899 garLoopResultBuilder]: For program point torture_lock_busted_write_lockEXIT(lines 2081 2086) no Hoare annotation was computed. [2022-12-13 20:48:57,811 INFO L895 garLoopResultBuilder]: At program point L1937(line 1937) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-12-13 20:48:57,811 INFO L899 garLoopResultBuilder]: For program point L1937-1(line 1937) no Hoare annotation was computed. [2022-12-13 20:48:57,811 INFO L895 garLoopResultBuilder]: At program point L2874(line 2874) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-12-13 20:48:57,812 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2871 2878) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-12-13 20:48:57,812 INFO L899 garLoopResultBuilder]: For program point kmallocFINAL(lines 2871 2878) no Hoare annotation was computed. [2022-12-13 20:48:57,812 INFO L899 garLoopResultBuilder]: For program point L2874-1(line 2874) no Hoare annotation was computed. [2022-12-13 20:48:57,812 INFO L902 garLoopResultBuilder]: At program point ldv_kmalloc_12_returnLabel#1(lines 1940 1947) the Hoare annotation is: true [2022-12-13 20:48:57,812 INFO L902 garLoopResultBuilder]: At program point __kmalloc_returnLabel#1(lines 1935 1938) the Hoare annotation is: true [2022-12-13 20:48:57,812 INFO L899 garLoopResultBuilder]: For program point kmallocEXIT(lines 2871 2878) no Hoare annotation was computed. [2022-12-13 20:48:57,812 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 3056 3058) the Hoare annotation is: true [2022-12-13 20:48:57,812 INFO L899 garLoopResultBuilder]: For program point torture_randomEXIT(lines 3056 3058) no Hoare annotation was computed. [2022-12-13 20:48:57,812 INFO L899 garLoopResultBuilder]: For program point torture_randomFINAL(lines 3056 3058) no Hoare annotation was computed. [2022-12-13 20:48:57,812 INFO L902 garLoopResultBuilder]: At program point LDV_STOP(lines 2016 2022) the Hoare annotation is: true [2022-12-13 20:48:57,812 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 2016 2022) no Hoare annotation was computed. [2022-12-13 20:48:57,813 INFO L899 garLoopResultBuilder]: For program point lock_torture_stats_printFINAL(lines 2314 2333) no Hoare annotation was computed. [2022-12-13 20:48:57,813 INFO L899 garLoopResultBuilder]: For program point L2323(lines 2323 2327) no Hoare annotation was computed. [2022-12-13 20:48:57,813 INFO L899 garLoopResultBuilder]: For program point L2321-1(line 2321) no Hoare annotation was computed. [2022-12-13 20:48:57,813 INFO L895 garLoopResultBuilder]: At program point L2321(line 2321) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-12-13 20:48:57,813 INFO L899 garLoopResultBuilder]: For program point L2282(lines 2282 2285) no Hoare annotation was computed. [2022-12-13 20:48:57,813 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2314 2333) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-12-13 20:48:57,813 INFO L899 garLoopResultBuilder]: For program point L2282-2(lines 2282 2285) no Hoare annotation was computed. [2022-12-13 20:48:57,813 INFO L902 garLoopResultBuilder]: At program point atomic_inc_returnLabel#1(lines 1899 1905) the Hoare annotation is: true [2022-12-13 20:48:57,813 INFO L902 garLoopResultBuilder]: At program point $Ultimate##13(lines 2297 2300) the Hoare annotation is: true [2022-12-13 20:48:57,813 INFO L899 garLoopResultBuilder]: For program point L2307(lines 2307 2310) no Hoare annotation was computed. [2022-12-13 20:48:57,814 INFO L902 garLoopResultBuilder]: At program point L2307-2(lines 2265 2313) the Hoare annotation is: true [2022-12-13 20:48:57,814 INFO L899 garLoopResultBuilder]: For program point lock_torture_stats_printEXIT(lines 2314 2333) no Hoare annotation was computed. [2022-12-13 20:48:57,814 INFO L902 garLoopResultBuilder]: At program point L2330(line 2330) the Hoare annotation is: true [2022-12-13 20:48:57,814 INFO L902 garLoopResultBuilder]: At program point lock_torture_printk_ldv_22724#1(lines 2274 2312) the Hoare annotation is: true [2022-12-13 20:48:57,814 INFO L899 garLoopResultBuilder]: For program point L2291(lines 2291 2294) no Hoare annotation was computed. [2022-12-13 20:48:57,814 INFO L899 garLoopResultBuilder]: For program point L2291-2(lines 2291 2294) no Hoare annotation was computed. [2022-12-13 20:48:57,814 INFO L899 garLoopResultBuilder]: For program point L2287(lines 2287 2290) no Hoare annotation was computed. [2022-12-13 20:48:57,814 INFO L899 garLoopResultBuilder]: For program point L2287-2(lines 2287 2290) no Hoare annotation was computed. [2022-12-13 20:48:57,814 INFO L902 garLoopResultBuilder]: At program point torture_lock_busted_write_unlockFINAL(lines 2113 2118) the Hoare annotation is: true [2022-12-13 20:48:57,814 INFO L899 garLoopResultBuilder]: For program point torture_lock_busted_write_unlockEXIT(lines 2113 2118) no Hoare annotation was computed. [2022-12-13 20:48:57,814 INFO L899 garLoopResultBuilder]: For program point lock_torture_print_module_parmsEXIT(lines 2361 2370) no Hoare annotation was computed. [2022-12-13 20:48:57,815 INFO L899 garLoopResultBuilder]: For program point lock_torture_print_module_parmsFINAL(lines 2361 2370) no Hoare annotation was computed. [2022-12-13 20:48:57,815 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2361 2370) the Hoare annotation is: true [2022-12-13 20:48:57,815 INFO L899 garLoopResultBuilder]: For program point L2141-1(line 2141) no Hoare annotation was computed. [2022-12-13 20:48:57,815 INFO L902 garLoopResultBuilder]: At program point L2141(line 2141) the Hoare annotation is: true [2022-12-13 20:48:57,815 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_delayEXIT(lines 2130 2163) no Hoare annotation was computed. [2022-12-13 20:48:57,815 INFO L899 garLoopResultBuilder]: For program point L2156(line 2156) no Hoare annotation was computed. [2022-12-13 20:48:57,815 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2130 2163) the Hoare annotation is: true [2022-12-13 20:48:57,815 INFO L899 garLoopResultBuilder]: For program point L2150(lines 2150 2153) no Hoare annotation was computed. [2022-12-13 20:48:57,815 INFO L902 garLoopResultBuilder]: At program point L2146(lines 2142 2154) the Hoare annotation is: true [2022-12-13 20:48:57,815 INFO L899 garLoopResultBuilder]: For program point L2142(lines 2142 2155) no Hoare annotation was computed. [2022-12-13 20:48:57,815 INFO L902 garLoopResultBuilder]: At program point L2142-2(lines 2142 2155) the Hoare annotation is: true [2022-12-13 20:48:57,816 INFO L899 garLoopResultBuilder]: For program point L2157(lines 2157 2160) no Hoare annotation was computed. [2022-12-13 20:48:57,816 INFO L899 garLoopResultBuilder]: For program point L2157-2(lines 2130 2163) no Hoare annotation was computed. [2022-12-13 20:48:57,816 INFO L902 garLoopResultBuilder]: At program point __udelay_returnLabel#1(lines 2956 2958) the Hoare annotation is: true [2022-12-13 20:48:57,816 INFO L902 garLoopResultBuilder]: At program point ldv_22689(lines 2142 2154) the Hoare annotation is: true [2022-12-13 20:48:57,816 INFO L899 garLoopResultBuilder]: For program point L2401(lines 2401 2410) no Hoare annotation was computed. [2022-12-13 20:48:57,816 INFO L899 garLoopResultBuilder]: For program point L2399(line 2399) no Hoare annotation was computed. [2022-12-13 20:48:57,816 INFO L902 garLoopResultBuilder]: At program point atomic_read_returnLabel#1(lines 1893 1898) the Hoare annotation is: true [2022-12-13 20:48:57,816 INFO L899 garLoopResultBuilder]: For program point L2387(line 2387) no Hoare annotation was computed. [2022-12-13 20:48:57,816 INFO L899 garLoopResultBuilder]: For program point L2383(lines 2383 2397) no Hoare annotation was computed. [2022-12-13 20:48:57,816 INFO L902 garLoopResultBuilder]: At program point L2383-2(lines 2383 2397) the Hoare annotation is: true [2022-12-13 20:48:57,816 INFO L899 garLoopResultBuilder]: For program point L2379(lines 2379 2382) no Hoare annotation was computed. [2022-12-13 20:48:57,816 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2371 2413) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (<= (+ ~nwriters_stress~0 1) 0)))) (and (or .cse0 .cse1 (not (= ~ldv_state_variable_0~0 1)) (and (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))) (or .cse0 .cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))))) [2022-12-13 20:48:57,816 INFO L902 garLoopResultBuilder]: At program point L2408(line 2408) the Hoare annotation is: true [2022-12-13 20:48:57,817 INFO L902 garLoopResultBuilder]: At program point L2406(line 2406) the Hoare annotation is: true [2022-12-13 20:48:57,817 INFO L899 garLoopResultBuilder]: For program point lock_torture_cleanupEXIT(lines 2371 2413) no Hoare annotation was computed. [2022-12-13 20:48:57,817 INFO L899 garLoopResultBuilder]: For program point L2408-1(lines 2371 2413) no Hoare annotation was computed. [2022-12-13 20:48:57,817 INFO L902 garLoopResultBuilder]: At program point L2402(line 2402) the Hoare annotation is: true [2022-12-13 20:48:57,817 INFO L895 garLoopResultBuilder]: At program point $Ultimate##6(lines 2390 2393) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (<= (+ ~nwriters_stress~0 1) 0)))) (and (or .cse0 .cse1 (not (= ~ldv_state_variable_0~0 1)) (and (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))) (or .cse0 .cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))))) [2022-12-13 20:48:57,817 INFO L902 garLoopResultBuilder]: At program point L2398(line 2398) the Hoare annotation is: true [2022-12-13 20:48:57,817 INFO L895 garLoopResultBuilder]: At program point L2394(line 2394) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (<= (+ ~nwriters_stress~0 1) 0)))) (and (or .cse0 .cse1 (not (= ~ldv_state_variable_0~0 1)) (and (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))) (or .cse0 .cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))))) [2022-12-13 20:48:57,817 INFO L899 garLoopResultBuilder]: For program point L2394-1(line 2394) no Hoare annotation was computed. [2022-12-13 20:48:57,817 INFO L895 garLoopResultBuilder]: At program point torture_cleanup_returnLabel#1(lines 3030 3032) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (<= (+ ~nwriters_stress~0 1) 0)))) (and (or .cse0 .cse1 (not (= ~ldv_state_variable_0~0 1)) (and (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))) (or .cse0 .cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))))) [2022-12-13 20:48:57,817 INFO L902 garLoopResultBuilder]: At program point torture_onoff_failures_returnLabel#1(lines 3048 3050) the Hoare annotation is: true [2022-12-13 20:48:57,817 INFO L899 garLoopResultBuilder]: For program point L2405(lines 2405 2409) no Hoare annotation was computed. [2022-12-13 20:48:57,817 INFO L895 garLoopResultBuilder]: At program point ldv_22745(lines 2383 2396) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (<= (+ ~nwriters_stress~0 1) 0)))) (and (or .cse0 .cse1 (not (= ~ldv_state_variable_0~0 1)) (and (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))) (or .cse0 .cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))))) [2022-12-13 20:48:57,817 INFO L902 garLoopResultBuilder]: At program point torture_init_endFINAL(lines 3037 3039) the Hoare annotation is: true [2022-12-13 20:48:57,817 INFO L899 garLoopResultBuilder]: For program point torture_init_endEXIT(lines 3037 3039) no Hoare annotation was computed. [2022-12-13 20:48:57,817 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1956 1958) the Hoare annotation is: true [2022-12-13 20:48:57,818 INFO L899 garLoopResultBuilder]: For program point L1957(line 1957) no Hoare annotation was computed. [2022-12-13 20:48:57,818 INFO L899 garLoopResultBuilder]: For program point L1957-2(lines 1956 1958) no Hoare annotation was computed. [2022-12-13 20:48:57,818 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 1956 1958) no Hoare annotation was computed. [2022-12-13 20:48:57,818 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2929 2935) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-12-13 20:48:57,818 INFO L899 garLoopResultBuilder]: For program point ldv_spin_unlockFINAL(lines 2929 2935) no Hoare annotation was computed. [2022-12-13 20:48:57,818 INFO L899 garLoopResultBuilder]: For program point ldv_spin_unlockEXIT(lines 2929 2935) no Hoare annotation was computed. [2022-12-13 20:48:57,818 INFO L899 garLoopResultBuilder]: For program point ldv_spin_lockEXIT(lines 2922 2928) no Hoare annotation was computed. [2022-12-13 20:48:57,818 INFO L899 garLoopResultBuilder]: For program point ldv_spin_lockFINAL(lines 2922 2928) no Hoare annotation was computed. [2022-12-13 20:48:57,818 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2922 2928) the Hoare annotation is: true [2022-12-13 20:48:57,818 INFO L899 garLoopResultBuilder]: For program point L2177-1(line 2177) no Hoare annotation was computed. [2022-12-13 20:48:57,818 INFO L902 garLoopResultBuilder]: At program point L2177(line 2177) the Hoare annotation is: true [2022-12-13 20:48:57,818 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2173 2181) the Hoare annotation is: true [2022-12-13 20:48:57,818 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_lock_irqEXIT(lines 2173 2181) no Hoare annotation was computed. [2022-12-13 20:48:57,819 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_lock_irqFINAL(lines 2173 2181) no Hoare annotation was computed. [2022-12-13 20:48:57,819 INFO L899 garLoopResultBuilder]: For program point L1966(lines 1966 1973) no Hoare annotation was computed. [2022-12-13 20:48:57,819 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1959 1975) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-12-13 20:48:57,819 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 1959 1975) no Hoare annotation was computed. [2022-12-13 20:48:57,819 INFO L902 garLoopResultBuilder]: At program point L1971(line 1971) the Hoare annotation is: true [2022-12-13 20:48:57,819 INFO L899 garLoopResultBuilder]: For program point L1971-1(line 1971) no Hoare annotation was computed. [2022-12-13 20:48:57,819 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 1959 1975) no Hoare annotation was computed. [2022-12-13 20:48:57,819 INFO L899 garLoopResultBuilder]: For program point _torture_create_kthreadFINAL(lines 2969 2971) no Hoare annotation was computed. [2022-12-13 20:48:57,819 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2969 2971) the Hoare annotation is: true [2022-12-13 20:48:57,819 INFO L899 garLoopResultBuilder]: For program point _torture_create_kthreadEXIT(lines 2969 2971) no Hoare annotation was computed. [2022-12-13 20:48:57,819 INFO L899 garLoopResultBuilder]: For program point L2849-1(line 2849) no Hoare annotation was computed. [2022-12-13 20:48:57,819 INFO L902 garLoopResultBuilder]: At program point _raw_spin_lock_returnLabel#1(lines 2959 2961) the Hoare annotation is: true [2022-12-13 20:48:57,820 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_lockFINAL(lines 2123 2129) no Hoare annotation was computed. [2022-12-13 20:48:57,820 INFO L902 garLoopResultBuilder]: At program point L2849(line 2849) the Hoare annotation is: true [2022-12-13 20:48:57,820 INFO L902 garLoopResultBuilder]: At program point spin_lock_returnLabel#1(lines 2846 2853) the Hoare annotation is: true [2022-12-13 20:48:57,820 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2123 2129) the Hoare annotation is: true [2022-12-13 20:48:57,820 INFO L902 garLoopResultBuilder]: At program point ldv_spin_lock_1_returnLabel#1(lines 1909 1915) the Hoare annotation is: true [2022-12-13 20:48:57,820 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_lockEXIT(lines 2123 2129) no Hoare annotation was computed. [2022-12-13 20:48:57,820 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= |old(~ldv_spin~0)| 0)) (and (= |old(#length)| |#length|) (= ~ldv_spin~0 0) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-12-13 20:48:57,820 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-12-13 20:48:57,820 INFO L899 garLoopResultBuilder]: For program point ##fun~~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-12-13 20:48:57,820 INFO L895 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= |old(~ldv_spin~0)| 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-12-13 20:48:57,820 INFO L899 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2022-12-13 20:48:57,820 INFO L895 garLoopResultBuilder]: At program point L-1-6(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= |old(~ldv_spin~0)| 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-12-13 20:48:57,820 INFO L895 garLoopResultBuilder]: At program point L-1-8(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= |old(~ldv_spin~0)| 0)) (and (= |old(#length)| |#length|) (= ~ldv_spin~0 0) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-12-13 20:48:57,820 INFO L899 garLoopResultBuilder]: For program point L-1-9(line -1) no Hoare annotation was computed. [2022-12-13 20:48:57,821 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= |old(~ldv_spin~0)| 0)) (and (= |old(#length)| |#length|) (= ~ldv_spin~0 0) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-12-13 20:48:57,821 INFO L899 garLoopResultBuilder]: For program point L1983(lines 1983 1990) no Hoare annotation was computed. [2022-12-13 20:48:57,821 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 20:48:57,821 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1976 1992) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-12-13 20:48:57,821 INFO L899 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 1976 1992) no Hoare annotation was computed. [2022-12-13 20:48:57,821 INFO L902 garLoopResultBuilder]: At program point L1988(line 1988) the Hoare annotation is: true [2022-12-13 20:48:57,821 INFO L899 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 1976 1992) no Hoare annotation was computed. [2022-12-13 20:48:57,821 INFO L899 garLoopResultBuilder]: For program point L1988-1(line 1988) no Hoare annotation was computed. [2022-12-13 20:48:57,821 INFO L895 garLoopResultBuilder]: At program point _raw_spin_unlock_returnLabel#1(lines 2962 2964) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (= ~ldv_spin~0 0) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-12-13 20:48:57,821 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_unlockEXIT(lines 2164 2170) no Hoare annotation was computed. [2022-12-13 20:48:57,821 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_unlockFINAL(lines 2164 2170) no Hoare annotation was computed. [2022-12-13 20:48:57,821 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2164 2170) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-12-13 20:48:57,821 INFO L899 garLoopResultBuilder]: For program point L2857-1(line 2857) no Hoare annotation was computed. [2022-12-13 20:48:57,821 INFO L895 garLoopResultBuilder]: At program point L2857(line 2857) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-12-13 20:48:57,821 INFO L895 garLoopResultBuilder]: At program point ldv_spin_unlock_5_returnLabel#1(lines 1917 1923) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (= ~ldv_spin~0 0) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-12-13 20:48:57,821 INFO L895 garLoopResultBuilder]: At program point spin_unlock_returnLabel#1(lines 2854 2861) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (= ~ldv_spin~0 0) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-12-13 20:48:57,821 INFO L899 garLoopResultBuilder]: For program point L2744(lines 2744 2748) no Hoare annotation was computed. [2022-12-13 20:48:57,822 INFO L899 garLoopResultBuilder]: For program point L2744-2(lines 2723 2773) no Hoare annotation was computed. [2022-12-13 20:48:57,822 INFO L895 garLoopResultBuilder]: At program point ldv_initialize_returnLabel#1(lines 2981 2983) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-12-13 20:48:57,822 INFO L895 garLoopResultBuilder]: At program point L2612(line 2612) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-12-13 20:48:57,822 INFO L899 garLoopResultBuilder]: For program point L2612-1(line 2612) no Hoare annotation was computed. [2022-12-13 20:48:57,822 INFO L899 garLoopResultBuilder]: For program point L2579(line 2579) no Hoare annotation was computed. [2022-12-13 20:48:57,822 INFO L899 garLoopResultBuilder]: For program point L2778(line 2778) no Hoare annotation was computed. [2022-12-13 20:48:57,822 INFO L899 garLoopResultBuilder]: For program point L2745-1(line 2745) no Hoare annotation was computed. [2022-12-13 20:48:57,822 INFO L895 garLoopResultBuilder]: At program point L2745(line 2745) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2022-12-13 20:48:57,822 INFO L895 garLoopResultBuilder]: At program point lock_torture_init_unwind#1(lines 2425 2585) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (<= (+ |ULTIMATE.start_lock_torture_init_~firsterr~0#1| 12) 0) (<= (+ ~nwriters_stress~0 1) 0)) [2022-12-13 20:48:57,822 INFO L899 garLoopResultBuilder]: For program point L2779(lines 2779 2834) no Hoare annotation was computed. [2022-12-13 20:48:57,822 INFO L899 garLoopResultBuilder]: For program point L2713(line 2713) no Hoare annotation was computed. [2022-12-13 20:48:57,822 INFO L895 garLoopResultBuilder]: At program point L2614(line 2614) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-12-13 20:48:57,822 INFO L899 garLoopResultBuilder]: For program point L2614-1(line 2614) no Hoare annotation was computed. [2022-12-13 20:48:57,822 INFO L899 garLoopResultBuilder]: For program point L2813(line 2813) no Hoare annotation was computed. [2022-12-13 20:48:57,822 INFO L895 garLoopResultBuilder]: At program point torture_shutdown_init_returnLabel#1(lines 3067 3069) the Hoare annotation is: false [2022-12-13 20:48:57,822 INFO L902 garLoopResultBuilder]: At program point L2714(line 2714) the Hoare annotation is: true [2022-12-13 20:48:57,822 INFO L899 garLoopResultBuilder]: For program point L2648(line 2648) no Hoare annotation was computed. [2022-12-13 20:48:57,823 INFO L895 garLoopResultBuilder]: At program point L2582(line 2582) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (<= (+ |ULTIMATE.start_lock_torture_init_~firsterr~0#1| 12) 0) (<= (+ ~nwriters_stress~0 1) 0)) [2022-12-13 20:48:57,823 INFO L899 garLoopResultBuilder]: For program point L2516-1(lines 2425 2585) no Hoare annotation was computed. [2022-12-13 20:48:57,823 INFO L899 garLoopResultBuilder]: For program point L2814(lines 2814 2819) no Hoare annotation was computed. [2022-12-13 20:48:57,823 INFO L899 garLoopResultBuilder]: For program point L2781(lines 2781 2831) no Hoare annotation was computed. [2022-12-13 20:48:57,823 INFO L899 garLoopResultBuilder]: For program point L2649(lines 2649 2653) no Hoare annotation was computed. [2022-12-13 20:48:57,823 INFO L899 garLoopResultBuilder]: For program point L2649-2(lines 2628 2678) no Hoare annotation was computed. [2022-12-13 20:48:57,823 INFO L899 garLoopResultBuilder]: For program point L2583(line 2583) no Hoare annotation was computed. [2022-12-13 20:48:57,823 INFO L899 garLoopResultBuilder]: For program point L2484(line 2484) no Hoare annotation was computed. [2022-12-13 20:48:57,823 INFO L899 garLoopResultBuilder]: For program point L2782(line 2782) no Hoare annotation was computed. [2022-12-13 20:48:57,823 INFO L895 garLoopResultBuilder]: At program point L2650(line 2650) the Hoare annotation is: false [2022-12-13 20:48:57,823 INFO L899 garLoopResultBuilder]: For program point L2683(line 2683) no Hoare annotation was computed. [2022-12-13 20:48:57,823 INFO L899 garLoopResultBuilder]: For program point L2650-1(line 2650) no Hoare annotation was computed. [2022-12-13 20:48:57,823 INFO L899 garLoopResultBuilder]: For program point L2518(lines 2518 2521) no Hoare annotation was computed. [2022-12-13 20:48:57,823 INFO L895 garLoopResultBuilder]: At program point lock_torture_init_ldv_22770#1(lines 2425 2585) the Hoare annotation is: false [2022-12-13 20:48:57,823 INFO L895 garLoopResultBuilder]: At program point ldv_probe_3_returnLabel#1(lines 2993 2995) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2022-12-13 20:48:57,823 INFO L895 garLoopResultBuilder]: At program point L2750(line 2750) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2022-12-13 20:48:57,823 INFO L899 garLoopResultBuilder]: For program point L2783(lines 2783 2787) no Hoare annotation was computed. [2022-12-13 20:48:57,823 INFO L899 garLoopResultBuilder]: For program point L2684(lines 2684 2718) no Hoare annotation was computed. [2022-12-13 20:48:57,823 INFO L899 garLoopResultBuilder]: For program point L2750-1(line 2750) no Hoare annotation was computed. [2022-12-13 20:48:57,823 INFO L895 garLoopResultBuilder]: At program point L2486(line 2486) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-12-13 20:48:57,824 INFO L899 garLoopResultBuilder]: For program point L2486-1(line 2486) no Hoare annotation was computed. [2022-12-13 20:48:57,824 INFO L899 garLoopResultBuilder]: For program point L2883-1(line 2883) no Hoare annotation was computed. [2022-12-13 20:48:57,824 INFO L895 garLoopResultBuilder]: At program point L2883(line 2883) the Hoare annotation is: false [2022-12-13 20:48:57,824 INFO L895 garLoopResultBuilder]: At program point L2784(line 2784) the Hoare annotation is: false [2022-12-13 20:48:57,824 INFO L899 garLoopResultBuilder]: For program point L2784-1(line 2784) no Hoare annotation was computed. [2022-12-13 20:48:57,824 INFO L899 garLoopResultBuilder]: For program point L2686(lines 2686 2715) no Hoare annotation was computed. [2022-12-13 20:48:57,824 INFO L899 garLoopResultBuilder]: For program point L2554(lines 2554 2557) no Hoare annotation was computed. [2022-12-13 20:48:57,824 INFO L899 garLoopResultBuilder]: For program point L2488(lines 2488 2496) no Hoare annotation was computed. [2022-12-13 20:48:57,824 INFO L895 garLoopResultBuilder]: At program point bitmap_weight_returnLabel#1(lines 1875 1882) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-12-13 20:48:57,824 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 2596 2845) the Hoare annotation is: true [2022-12-13 20:48:57,824 INFO L899 garLoopResultBuilder]: For program point L2720(line 2720) no Hoare annotation was computed. [2022-12-13 20:48:57,824 INFO L899 garLoopResultBuilder]: For program point L2687(line 2687) no Hoare annotation was computed. [2022-12-13 20:48:57,824 INFO L899 garLoopResultBuilder]: For program point L2489(lines 2489 2492) no Hoare annotation was computed. [2022-12-13 20:48:57,824 INFO L899 garLoopResultBuilder]: For program point L2489-2(lines 2489 2492) no Hoare annotation was computed. [2022-12-13 20:48:57,824 INFO L899 garLoopResultBuilder]: For program point L2688(lines 2688 2693) no Hoare annotation was computed. [2022-12-13 20:48:57,824 INFO L899 garLoopResultBuilder]: For program point L2721(lines 2721 2776) no Hoare annotation was computed. [2022-12-13 20:48:57,824 INFO L895 garLoopResultBuilder]: At program point L2622(lines 2609 2844) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2022-12-13 20:48:57,824 INFO L899 garLoopResultBuilder]: For program point L2655-1(line 2655) no Hoare annotation was computed. [2022-12-13 20:48:57,824 INFO L895 garLoopResultBuilder]: At program point L2655(line 2655) the Hoare annotation is: false [2022-12-13 20:48:57,824 INFO L899 garLoopResultBuilder]: For program point L2821(line 2821) no Hoare annotation was computed. [2022-12-13 20:48:57,825 INFO L899 garLoopResultBuilder]: For program point L2755(line 2755) no Hoare annotation was computed. [2022-12-13 20:48:57,825 INFO L899 garLoopResultBuilder]: For program point L2689-1(line 2689) no Hoare annotation was computed. [2022-12-13 20:48:57,825 INFO L895 garLoopResultBuilder]: At program point L2689(line 2689) the Hoare annotation is: (and (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2022-12-13 20:48:57,825 INFO L902 garLoopResultBuilder]: At program point main_ldv_final#1(lines 2609 2844) the Hoare annotation is: true [2022-12-13 20:48:57,825 INFO L899 garLoopResultBuilder]: For program point L2524-1(lines 2425 2585) no Hoare annotation was computed. [2022-12-13 20:48:57,825 INFO L899 garLoopResultBuilder]: For program point L2822(lines 2822 2827) no Hoare annotation was computed. [2022-12-13 20:48:57,825 INFO L899 garLoopResultBuilder]: For program point L2756(lines 2756 2761) no Hoare annotation was computed. [2022-12-13 20:48:57,825 INFO L899 garLoopResultBuilder]: For program point L2789(line 2789) no Hoare annotation was computed. [2022-12-13 20:48:57,825 INFO L899 garLoopResultBuilder]: For program point L2723(lines 2723 2773) no Hoare annotation was computed. [2022-12-13 20:48:57,825 INFO L899 garLoopResultBuilder]: For program point L2624(lines 2624 2838) no Hoare annotation was computed. [2022-12-13 20:48:57,825 INFO L899 garLoopResultBuilder]: For program point L2558(lines 2558 2561) no Hoare annotation was computed. [2022-12-13 20:48:57,825 INFO L899 garLoopResultBuilder]: For program point L2790(lines 2790 2794) no Hoare annotation was computed. [2022-12-13 20:48:57,825 INFO L895 garLoopResultBuilder]: At program point lock_torture_init_ldv_22763#1(lines 2456 2472) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (<= (+ ~nwriters_stress~0 1) 0)) [2022-12-13 20:48:57,825 INFO L899 garLoopResultBuilder]: For program point L2724(line 2724) no Hoare annotation was computed. [2022-12-13 20:48:57,825 INFO L899 garLoopResultBuilder]: For program point L2790-2(lines 2781 2831) no Hoare annotation was computed. [2022-12-13 20:48:57,825 INFO L899 garLoopResultBuilder]: For program point L2625(line 2625) no Hoare annotation was computed. [2022-12-13 20:48:57,825 INFO L899 garLoopResultBuilder]: For program point L2526(lines 2526 2529) no Hoare annotation was computed. [2022-12-13 20:48:57,825 INFO L899 garLoopResultBuilder]: For program point L2791-1(line 2791) no Hoare annotation was computed. [2022-12-13 20:48:57,825 INFO L895 garLoopResultBuilder]: At program point L2791(line 2791) the Hoare annotation is: false [2022-12-13 20:48:57,825 INFO L899 garLoopResultBuilder]: For program point L2725(lines 2725 2729) no Hoare annotation was computed. [2022-12-13 20:48:57,825 INFO L899 garLoopResultBuilder]: For program point L2626(lines 2626 2681) no Hoare annotation was computed. [2022-12-13 20:48:57,826 INFO L895 garLoopResultBuilder]: At program point L2726(line 2726) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2022-12-13 20:48:57,826 INFO L899 garLoopResultBuilder]: For program point L2660(line 2660) no Hoare annotation was computed. [2022-12-13 20:48:57,826 INFO L899 garLoopResultBuilder]: For program point L2726-1(line 2726) no Hoare annotation was computed. [2022-12-13 20:48:57,826 INFO L899 garLoopResultBuilder]: For program point L2628(lines 2628 2678) no Hoare annotation was computed. [2022-12-13 20:48:57,826 INFO L899 garLoopResultBuilder]: For program point L2661(lines 2661 2666) no Hoare annotation was computed. [2022-12-13 20:48:57,826 INFO L895 garLoopResultBuilder]: At program point ldv_release_3_returnLabel#1(lines 3005 3007) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2022-12-13 20:48:57,826 INFO L899 garLoopResultBuilder]: For program point L2695(line 2695) no Hoare annotation was computed. [2022-12-13 20:48:57,826 INFO L899 garLoopResultBuilder]: For program point L2629(line 2629) no Hoare annotation was computed. [2022-12-13 20:48:57,826 INFO L899 garLoopResultBuilder]: For program point L2431(lines 2431 2435) no Hoare annotation was computed. [2022-12-13 20:48:57,826 INFO L899 garLoopResultBuilder]: For program point L2431-2(lines 2425 2585) no Hoare annotation was computed. [2022-12-13 20:48:57,826 INFO L899 garLoopResultBuilder]: For program point L2696(lines 2696 2711) no Hoare annotation was computed. [2022-12-13 20:48:57,826 INFO L899 garLoopResultBuilder]: For program point L2630(lines 2630 2634) no Hoare annotation was computed. [2022-12-13 20:48:57,826 INFO L895 garLoopResultBuilder]: At program point lock_torture_init_ldv_22757#1(lines 2425 2585) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-12-13 20:48:57,826 INFO L895 garLoopResultBuilder]: At program point lock_torture_init_returnLabel#1(lines 2414 2586) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 1)) (.cse1 (<= (+ ~nwriters_stress~0 1) 0))) (or (and .cse0 (<= (+ |ULTIMATE.start_lock_torture_init_#res#1| 16) 0) .cse1) (and .cse0 (<= (+ |ULTIMATE.start_lock_torture_init_~firsterr~0#1| 12) 0) (<= (+ |ULTIMATE.start_lock_torture_init_#res#1| 12) 0) .cse1))) [2022-12-13 20:48:57,827 INFO L895 garLoopResultBuilder]: At program point L2796(line 2796) the Hoare annotation is: false [2022-12-13 20:48:57,827 INFO L899 garLoopResultBuilder]: For program point L2829(line 2829) no Hoare annotation was computed. [2022-12-13 20:48:57,827 INFO L899 garLoopResultBuilder]: For program point L2763(line 2763) no Hoare annotation was computed. [2022-12-13 20:48:57,827 INFO L899 garLoopResultBuilder]: For program point L2796-1(line 2796) no Hoare annotation was computed. [2022-12-13 20:48:57,827 INFO L899 garLoopResultBuilder]: For program point L2631-1(line 2631) no Hoare annotation was computed. [2022-12-13 20:48:57,827 INFO L895 garLoopResultBuilder]: At program point L2631(line 2631) the Hoare annotation is: false [2022-12-13 20:48:57,827 INFO L899 garLoopResultBuilder]: For program point L2532-1(lines 2532 2539) no Hoare annotation was computed. [2022-12-13 20:48:57,827 INFO L902 garLoopResultBuilder]: At program point L2830(line 2830) the Hoare annotation is: true [2022-12-13 20:48:57,827 INFO L899 garLoopResultBuilder]: For program point L2764(lines 2764 2769) no Hoare annotation was computed. [2022-12-13 20:48:57,827 INFO L899 garLoopResultBuilder]: For program point L2698(lines 2698 2704) no Hoare annotation was computed. [2022-12-13 20:48:57,827 INFO L899 garLoopResultBuilder]: For program point L2731(line 2731) no Hoare annotation was computed. [2022-12-13 20:48:57,827 INFO L899 garLoopResultBuilder]: For program point L2698-2(lines 2696 2710) no Hoare annotation was computed. [2022-12-13 20:48:57,828 INFO L895 garLoopResultBuilder]: At program point torture_shuffle_init_returnLabel#1(lines 3060 3062) the Hoare annotation is: false [2022-12-13 20:48:57,828 INFO L899 garLoopResultBuilder]: For program point L2732(lines 2732 2736) no Hoare annotation was computed. [2022-12-13 20:48:57,828 INFO L899 garLoopResultBuilder]: For program point L2732-2(lines 2723 2773) no Hoare annotation was computed. [2022-12-13 20:48:57,828 INFO L895 garLoopResultBuilder]: At program point $Ultimate##76(lines 2504 2507) the Hoare annotation is: false [2022-12-13 20:48:57,828 INFO L899 garLoopResultBuilder]: For program point L2534(lines 2534 2537) no Hoare annotation was computed. [2022-12-13 20:48:57,828 INFO L895 garLoopResultBuilder]: At program point lock_torture_init_ldv_22767#1(lines 2425 2585) the Hoare annotation is: false [2022-12-13 20:48:57,828 INFO L895 garLoopResultBuilder]: At program point $Ultimate##61(lines 2456 2473) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-12-13 20:48:57,828 INFO L895 garLoopResultBuilder]: At program point torture_onoff_init_returnLabel#1(lines 3052 3054) the Hoare annotation is: false [2022-12-13 20:48:57,828 INFO L899 garLoopResultBuilder]: For program point L2733-1(line 2733) no Hoare annotation was computed. [2022-12-13 20:48:57,829 INFO L895 garLoopResultBuilder]: At program point L2733(line 2733) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2022-12-13 20:48:57,829 INFO L895 garLoopResultBuilder]: At program point ldv_release_2_returnLabel#1(lines 3001 3003) the Hoare annotation is: false [2022-12-13 20:48:57,829 INFO L899 garLoopResultBuilder]: For program point L2568(lines 2568 2578) no Hoare annotation was computed. [2022-12-13 20:48:57,829 INFO L895 garLoopResultBuilder]: At program point $Ultimate##63(lines 2465 2468) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (<= (+ ~nwriters_stress~0 1) 0)) [2022-12-13 20:48:57,829 INFO L895 garLoopResultBuilder]: At program point L2568-2(lines 2568 2578) the Hoare annotation is: false [2022-12-13 20:48:57,829 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 20:48:57,829 INFO L895 garLoopResultBuilder]: At program point torture_stutter_init_returnLabel#1(lines 3071 3073) the Hoare annotation is: false [2022-12-13 20:48:57,829 INFO L895 garLoopResultBuilder]: At program point cpumask_weight_returnLabel#1(lines 1885 1892) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-12-13 20:48:57,829 INFO L895 garLoopResultBuilder]: At program point $Ultimate##59(lines 2451 2454) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-12-13 20:48:57,829 INFO L899 garLoopResultBuilder]: For program point L2668(line 2668) no Hoare annotation was computed. [2022-12-13 20:48:57,830 INFO L899 garLoopResultBuilder]: For program point L2569-1(lines 2569 2572) no Hoare annotation was computed. [2022-12-13 20:48:57,830 INFO L895 garLoopResultBuilder]: At program point L2569(lines 2569 2572) the Hoare annotation is: false [2022-12-13 20:48:57,830 INFO L895 garLoopResultBuilder]: At program point L2470(line 2470) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (<= (+ ~nwriters_stress~0 1) 0)) [2022-12-13 20:48:57,830 INFO L899 garLoopResultBuilder]: For program point L2470-1(line 2470) no Hoare annotation was computed. [2022-12-13 20:48:57,830 INFO L899 garLoopResultBuilder]: For program point L2801(line 2801) no Hoare annotation was computed. [2022-12-13 20:48:57,830 INFO L899 garLoopResultBuilder]: For program point L2636(line 2636) no Hoare annotation was computed. [2022-12-13 20:48:57,830 INFO L899 garLoopResultBuilder]: For program point L2669(lines 2669 2674) no Hoare annotation was computed. [2022-12-13 20:48:57,830 INFO L899 garLoopResultBuilder]: For program point L2802(lines 2802 2806) no Hoare annotation was computed. [2022-12-13 20:48:57,830 INFO L899 garLoopResultBuilder]: For program point L2802-2(lines 2781 2831) no Hoare annotation was computed. [2022-12-13 20:48:57,830 INFO L899 garLoopResultBuilder]: For program point L2637(lines 2637 2641) no Hoare annotation was computed. [2022-12-13 20:48:57,830 INFO L899 garLoopResultBuilder]: For program point L2637-2(lines 2628 2678) no Hoare annotation was computed. [2022-12-13 20:48:57,830 INFO L895 garLoopResultBuilder]: At program point ldv_probe_2_returnLabel#1(lines 2989 2991) the Hoare annotation is: false [2022-12-13 20:48:57,830 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 20:48:57,830 INFO L895 garLoopResultBuilder]: At program point ldv_release_1_returnLabel#1(lines 2997 2999) the Hoare annotation is: false [2022-12-13 20:48:57,830 INFO L899 garLoopResultBuilder]: For program point L2836(line 2836) no Hoare annotation was computed. [2022-12-13 20:48:57,830 INFO L899 garLoopResultBuilder]: For program point L2803-1(line 2803) no Hoare annotation was computed. [2022-12-13 20:48:57,830 INFO L895 garLoopResultBuilder]: At program point L2803(line 2803) the Hoare annotation is: false [2022-12-13 20:48:57,830 INFO L895 garLoopResultBuilder]: At program point L2638(line 2638) the Hoare annotation is: false [2022-12-13 20:48:57,830 INFO L899 garLoopResultBuilder]: For program point L2638-1(line 2638) no Hoare annotation was computed. [2022-12-13 20:48:57,830 INFO L895 garLoopResultBuilder]: At program point __bitmap_weight_returnLabel#1(lines 2950 2952) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-12-13 20:48:57,831 INFO L902 garLoopResultBuilder]: At program point L2837(line 2837) the Hoare annotation is: true [2022-12-13 20:48:57,831 INFO L895 garLoopResultBuilder]: At program point L2738(line 2738) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2022-12-13 20:48:57,831 INFO L899 garLoopResultBuilder]: For program point L2771(line 2771) no Hoare annotation was computed. [2022-12-13 20:48:57,831 INFO L895 garLoopResultBuilder]: At program point kzalloc_returnLabel#1(lines 2880 2886) the Hoare annotation is: false [2022-12-13 20:48:57,831 INFO L899 garLoopResultBuilder]: For program point L2738-1(line 2738) no Hoare annotation was computed. [2022-12-13 20:48:57,831 INFO L899 garLoopResultBuilder]: For program point L2573(lines 2573 2576) no Hoare annotation was computed. [2022-12-13 20:48:57,831 INFO L899 garLoopResultBuilder]: For program point L2474(lines 2474 2477) no Hoare annotation was computed. [2022-12-13 20:48:57,831 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 20:48:57,831 INFO L899 garLoopResultBuilder]: For program point L2474-2(lines 2425 2585) no Hoare annotation was computed. [2022-12-13 20:48:57,831 INFO L895 garLoopResultBuilder]: At program point ldv_probe_1_returnLabel#1(lines 2985 2987) the Hoare annotation is: false [2022-12-13 20:48:57,831 INFO L902 garLoopResultBuilder]: At program point L2772(line 2772) the Hoare annotation is: true [2022-12-13 20:48:57,831 INFO L899 garLoopResultBuilder]: For program point L2508(lines 2508 2515) no Hoare annotation was computed. [2022-12-13 20:48:57,831 INFO L899 garLoopResultBuilder]: For program point L2475-1(line 2475) no Hoare annotation was computed. [2022-12-13 20:48:57,831 INFO L899 garLoopResultBuilder]: For program point L2508-2(lines 2425 2585) no Hoare annotation was computed. [2022-12-13 20:48:57,831 INFO L895 garLoopResultBuilder]: At program point L2475(line 2475) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-12-13 20:48:57,831 INFO L899 garLoopResultBuilder]: For program point L2542(lines 2542 2550) no Hoare annotation was computed. [2022-12-13 20:48:57,832 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 20:48:57,832 INFO L899 garLoopResultBuilder]: For program point L2510(lines 2510 2513) no Hoare annotation was computed. [2022-12-13 20:48:57,832 INFO L899 garLoopResultBuilder]: For program point L2543(lines 2543 2546) no Hoare annotation was computed. [2022-12-13 20:48:57,832 INFO L899 garLoopResultBuilder]: For program point L2543-2(lines 2543 2546) no Hoare annotation was computed. [2022-12-13 20:48:57,832 INFO L895 garLoopResultBuilder]: At program point $Ultimate##105(lines 2564 2567) the Hoare annotation is: false [2022-12-13 20:48:57,832 INFO L895 garLoopResultBuilder]: At program point L2808(line 2808) the Hoare annotation is: false [2022-12-13 20:48:57,832 INFO L899 garLoopResultBuilder]: For program point L2808-1(line 2808) no Hoare annotation was computed. [2022-12-13 20:48:57,832 INFO L899 garLoopResultBuilder]: For program point L2676(line 2676) no Hoare annotation was computed. [2022-12-13 20:48:57,832 INFO L895 garLoopResultBuilder]: At program point L2610(line 2610) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-12-13 20:48:57,832 INFO L899 garLoopResultBuilder]: For program point L2643-1(line 2643) no Hoare annotation was computed. [2022-12-13 20:48:57,832 INFO L895 garLoopResultBuilder]: At program point L2643(line 2643) the Hoare annotation is: false [2022-12-13 20:48:57,832 INFO L899 garLoopResultBuilder]: For program point L2610-1(line 2610) no Hoare annotation was computed. [2022-12-13 20:48:57,832 INFO L895 garLoopResultBuilder]: At program point torture_init_begin_returnLabel#1(lines 3034 3036) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-12-13 20:48:57,832 INFO L899 garLoopResultBuilder]: For program point L2445(lines 2445 2448) no Hoare annotation was computed. [2022-12-13 20:48:57,832 INFO L895 garLoopResultBuilder]: At program point L2478-1(lines 2478 2483) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-12-13 20:48:57,832 INFO L899 garLoopResultBuilder]: For program point L2743(line 2743) no Hoare annotation was computed. [2022-12-13 20:48:57,832 INFO L902 garLoopResultBuilder]: At program point L2677(line 2677) the Hoare annotation is: true [2022-12-13 20:48:57,832 INFO L902 garLoopResultBuilder]: At program point ldv_check_final_state_returnLabel#1(lines 2978 2980) the Hoare annotation is: true [2022-12-13 20:48:57,833 INFO L895 garLoopResultBuilder]: At program point L2894(line 2894) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0))) [2022-12-13 20:48:57,833 INFO L899 garLoopResultBuilder]: For program point ldv_check_alloc_flagsEXIT(lines 2889 2898) no Hoare annotation was computed. [2022-12-13 20:48:57,833 INFO L899 garLoopResultBuilder]: For program point L2892(lines 2892 2895) no Hoare annotation was computed. [2022-12-13 20:48:57,833 INFO L899 garLoopResultBuilder]: For program point L2894-1(lines 2889 2898) no Hoare annotation was computed. [2022-12-13 20:48:57,833 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2889 2898) the Hoare annotation is: true [2022-12-13 20:48:57,835 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:48:57,837 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 20:48:57,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:48:57 BoogieIcfgContainer [2022-12-13 20:48:57,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 20:48:57,858 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 20:48:57,858 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 20:48:57,859 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 20:48:57,859 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:40:01" (3/4) ... [2022-12-13 20:48:57,861 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure _torture_stop_kthread [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_delay [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_spin_write_unlock_irq [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __const_udelay [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_lock [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_random [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_stats_print [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_unlock [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_print_module_parms [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_delay [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_cleanup [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_init_end [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_unlock [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_lock [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock_irq [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-12-13 20:48:57,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure _torture_create_kthread [2022-12-13 20:48:57,867 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock [2022-12-13 20:48:57,867 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~TO~VOID [2022-12-13 20:48:57,867 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2022-12-13 20:48:57,867 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_unlock [2022-12-13 20:48:57,867 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_alloc_flags [2022-12-13 20:48:57,877 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 126 nodes and edges [2022-12-13 20:48:57,877 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2022-12-13 20:48:57,878 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-12-13 20:48:57,879 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-13 20:48:57,879 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-13 20:48:57,880 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 20:48:57,880 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 20:48:57,901 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_state_variable_0 == 1 && \result + 16 <= 0) && nwriters_stress + 1 <= 0) || (((ldv_state_variable_0 == 1 && firsterr + 12 <= 0) && \result + 12 <= 0) && nwriters_stress + 1 <= 0) [2022-12-13 20:48:57,901 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) [2022-12-13 20:48:57,902 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) [2022-12-13 20:48:57,902 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) [2022-12-13 20:48:57,959 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 20:48:57,959 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 20:48:57,960 INFO L158 Benchmark]: Toolchain (without parser) took 537653.44ms. Allocated memory was 113.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 76.5MB in the beginning and 465.4MB in the end (delta: -388.9MB). Peak memory consumption was 930.0MB. Max. memory is 16.1GB. [2022-12-13 20:48:57,960 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 113.2MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:48:57,960 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.50ms. Allocated memory was 113.2MB in the beginning and 146.8MB in the end (delta: 33.6MB). Free memory was 76.2MB in the beginning and 97.0MB in the end (delta: -20.8MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2022-12-13 20:48:57,960 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.62ms. Allocated memory is still 146.8MB. Free memory was 97.0MB in the beginning and 91.5MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 20:48:57,960 INFO L158 Benchmark]: Boogie Preprocessor took 59.32ms. Allocated memory is still 146.8MB. Free memory was 91.5MB in the beginning and 85.8MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 20:48:57,961 INFO L158 Benchmark]: RCFGBuilder took 819.89ms. Allocated memory is still 146.8MB. Free memory was 85.8MB in the beginning and 67.0MB in the end (delta: 18.8MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2022-12-13 20:48:57,961 INFO L158 Benchmark]: TraceAbstraction took 535993.75ms. Allocated memory was 146.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 65.8MB in the beginning and 480.4MB in the end (delta: -414.6MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-12-13 20:48:57,961 INFO L158 Benchmark]: Witness Printer took 101.11ms. Allocated memory is still 1.4GB. Free memory was 480.4MB in the beginning and 465.4MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 20:48:57,962 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 113.2MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 604.50ms. Allocated memory was 113.2MB in the beginning and 146.8MB in the end (delta: 33.6MB). Free memory was 76.2MB in the beginning and 97.0MB in the end (delta: -20.8MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.62ms. Allocated memory is still 146.8MB. Free memory was 97.0MB in the beginning and 91.5MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.32ms. Allocated memory is still 146.8MB. Free memory was 91.5MB in the beginning and 85.8MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 819.89ms. Allocated memory is still 146.8MB. Free memory was 85.8MB in the beginning and 67.0MB in the end (delta: 18.8MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * TraceAbstraction took 535993.75ms. Allocated memory was 146.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 65.8MB in the beginning and 480.4MB in the end (delta: -414.6MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 101.11ms. Allocated memory is still 1.4GB. Free memory was 480.4MB in the beginning and 465.4MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2013]: 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 CFG has 28 procedures, 345 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 535.9s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 515.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10562 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10158 mSDsluCounter, 16804 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11443 mSDsCounter, 4312 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9318 IncrementalHoareTripleChecker+Invalid, 13630 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4312 mSolverCounterUnsat, 5361 mSDtfsCounter, 9318 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 650 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19310occurred in iteration=12, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 7567 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 139 LocationsWithAnnotation, 22187 PreInvPairs, 23451 NumberOfFragments, 1986 HoareAnnotationTreeSize, 22187 FomulaSimplifications, 5037376 FormulaSimplificationTreeSizeReduction, 509.7s HoareSimplificationTime, 139 FomulaSimplificationsInter, 2451605 FormulaSimplificationTreeSizeReductionInter, 5.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1722 NumberOfCodeBlocks, 1722 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1705 ConstructedInterpolants, 0 QuantifiedInterpolants, 3232 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2130 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 472/498 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 1 specifications checked. All of them hold - InvariantResult [Line: 2465]: Loop Invariant Derived loop invariant: (ldv_state_variable_0 == 1 && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 1885]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && tmp___0 == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 3071]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2956]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1917]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 2609]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2564]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2456]: Loop Invariant Derived loop invariant: (ldv_state_variable_0 == 1 && tmp___0 == 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2096]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3001]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2297]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2846]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2959]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3067]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1935]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2142]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2609]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 2142]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2504]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2880]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2993]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 3030]: Loop Invariant Derived loop invariant: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) - InvariantResult [Line: 3005]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1909]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2997]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2414]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && \result + 16 <= 0) && nwriters_stress + 1 <= 0) || (((ldv_state_variable_0 == 1 && firsterr + 12 <= 0) && \result + 12 <= 0) && nwriters_stress + 1 <= 0) - InvariantResult [Line: 2096]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2965]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 2985]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1925]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1899]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2456]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && tmp___0 == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3034]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 3052]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2962]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 2854]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 3048]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2950]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && tmp___0 == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2265]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2383]: Loop Invariant Derived loop invariant: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) - InvariantResult [Line: 2016]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && ldv_spin == 0) && tmp___0 == 0) && firsterr + 12 <= 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2596]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && tmp___0 == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2274]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1875]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && tmp___0 == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2862]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 2978]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2390]: Loop Invariant Derived loop invariant: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) - InvariantResult [Line: 1940]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2451]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && tmp___0 == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2989]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1893]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2981]: Loop Invariant Derived loop invariant: ((((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 RESULT: Ultimate proved your program to be correct! [2022-12-13 20:48:57,983 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f646b58e-e895-4688-893d-d3add769b6b0/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE