./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.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_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/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_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/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_42e6e107-6597-4143-8e44-57c22993d2b0/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 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 --- 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 18:28:16,741 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:28:16,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:28:16,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:28:16,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:28:16,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:28:16,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:28:16,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:28:16,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:28:16,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:28:16,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:28:16,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:28:16,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:28:16,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:28:16,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:28:16,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:28:16,762 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:28:16,763 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:28:16,764 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:28:16,765 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:28:16,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:28:16,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:28:16,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:28:16,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:28:16,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:28:16,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:28:16,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:28:16,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:28:16,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:28:16,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:28:16,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:28:16,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:28:16,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:28:16,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:28:16,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:28:16,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:28:16,775 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:28:16,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:28:16,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:28:16,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:28:16,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:28:16,777 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-12-13 18:28:16,790 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:28:16,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:28:16,790 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:28:16,790 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:28:16,791 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:28:16,791 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:28:16,791 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:28:16,791 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:28:16,791 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:28:16,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:28:16,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:28:16,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:28:16,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 18:28:16,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:28:16,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 18:28:16,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 18:28:16,792 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:28:16,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 18:28:16,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:28:16,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:28:16,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:28:16,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:28:16,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:28:16,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:28:16,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 18:28:16,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:28:16,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 18:28:16,794 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:28:16,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 18:28:16,794 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:28:16,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:28:16,794 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:28:16,795 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_42e6e107-6597-4143-8e44-57c22993d2b0/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_42e6e107-6597-4143-8e44-57c22993d2b0/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 -> 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 [2022-12-13 18:28:16,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:28:17,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:28:17,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:28:17,004 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:28:17,004 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:28:17,005 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2022-12-13 18:28:19,631 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:28:19,997 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:28:19,998 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2022-12-13 18:28:20,022 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/data/1c7733a2e/063146f897874206a4019159e0ba3196/FLAGcd8ae92b7 [2022-12-13 18:28:20,032 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/data/1c7733a2e/063146f897874206a4019159e0ba3196 [2022-12-13 18:28:20,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:28:20,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:28:20,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:28:20,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:28:20,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:28:20,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:28:20" (1/1) ... [2022-12-13 18:28:20,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4183a98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:20, skipping insertion in model container [2022-12-13 18:28:20,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:28:20" (1/1) ... [2022-12-13 18:28:20,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:28:20,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:28:20,445 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 18:28:20,528 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_42e6e107-6597-4143-8e44-57c22993d2b0/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2022-12-13 18:28:20,547 WARN L623 FunctionHandler]: Unknown extern function __dev_kfree_skb_any [2022-12-13 18:28:20,589 WARN L623 FunctionHandler]: Unknown extern function usb_bulk_msg [2022-12-13 18:28:20,591 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 18:28:20,592 WARN L623 FunctionHandler]: Unknown extern function usb_bulk_msg [2022-12-13 18:28:20,592 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 18:28:20,593 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 18:28:20,594 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 18:28:20,595 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 18:28:20,596 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 18:28:20,600 WARN L623 FunctionHandler]: Unknown extern function usb_string [2022-12-13 18:28:20,601 WARN L623 FunctionHandler]: Unknown extern function _dev_info [2022-12-13 18:28:20,602 WARN L623 FunctionHandler]: Unknown extern function usbnet_get_endpoints [2022-12-13 18:28:20,604 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 18:28:20,605 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 18:28:20,606 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 18:28:20,610 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 18:28:20,615 WARN L623 FunctionHandler]: Unknown extern function skb_put [2022-12-13 18:28:20,617 WARN L623 FunctionHandler]: Unknown extern function usbnet_skb_return [2022-12-13 18:28:20,617 WARN L623 FunctionHandler]: Unknown extern function skb_pull [2022-12-13 18:28:20,619 WARN L623 FunctionHandler]: Unknown extern function skb_pull [2022-12-13 18:28:20,619 WARN L623 FunctionHandler]: Unknown extern function skb_trim [2022-12-13 18:28:20,620 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 18:28:20,621 WARN L623 FunctionHandler]: Unknown extern function skb_pull [2022-12-13 18:28:20,622 WARN L623 FunctionHandler]: Unknown extern function skb_put [2022-12-13 18:28:20,622 WARN L623 FunctionHandler]: Unknown extern function usbnet_skb_return [2022-12-13 18:28:20,623 WARN L623 FunctionHandler]: Unknown extern function skb_pull [2022-12-13 18:28:20,627 WARN L623 FunctionHandler]: Unknown extern function skb_copy_expand [2022-12-13 18:28:20,628 WARN L623 FunctionHandler]: Unknown extern function skb_push [2022-12-13 18:28:20,649 WARN L623 FunctionHandler]: Unknown extern function usbnet_probe [2022-12-13 18:28:20,650 WARN L623 FunctionHandler]: Unknown extern function usbnet_disconnect [2022-12-13 18:28:20,651 WARN L623 FunctionHandler]: Unknown extern function usbnet_disconnect [2022-12-13 18:28:20,651 WARN L623 FunctionHandler]: Unknown extern function usbnet_suspend [2022-12-13 18:28:20,652 WARN L623 FunctionHandler]: Unknown extern function usbnet_resume [2022-12-13 18:28:20,652 WARN L623 FunctionHandler]: Unknown extern function ldv_reset_resume_1 [2022-12-13 18:28:20,655 WARN L623 FunctionHandler]: Unknown extern function ldv_skb_free [2022-12-13 18:28:20,656 WARN L623 FunctionHandler]: Unknown extern function ldv_skb_free [2022-12-13 18:28:20,656 WARN L623 FunctionHandler]: Unknown extern function ldv_skb_free [2022-12-13 18:28:20,656 WARN L623 FunctionHandler]: Unknown extern function ldv_skb_free [2022-12-13 18:28:20,657 WARN L623 FunctionHandler]: Unknown extern function ldv_skb_free [2022-12-13 18:28:20,657 WARN L623 FunctionHandler]: Unknown extern function ldv_skb_alloc [2022-12-13 18:28:20,657 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 18:28:20,658 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-12-13 18:28:20,659 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-12-13 18:28:20,702 WARN L623 FunctionHandler]: Unknown extern function ldv_skb_alloc [2022-12-13 18:28:20,706 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 18:28:20,707 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 18:28:20,707 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 18:28:20,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:28:20,728 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:28:20,813 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 18:28:20,817 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_42e6e107-6597-4143-8e44-57c22993d2b0/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2022-12-13 18:28:20,818 WARN L623 FunctionHandler]: Unknown extern function __dev_kfree_skb_any [2022-12-13 18:28:20,822 WARN L623 FunctionHandler]: Unknown extern function usb_bulk_msg [2022-12-13 18:28:20,822 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 18:28:20,823 WARN L623 FunctionHandler]: Unknown extern function usb_bulk_msg [2022-12-13 18:28:20,823 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 18:28:20,824 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 18:28:20,825 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 18:28:20,826 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 18:28:20,827 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 18:28:20,828 WARN L623 FunctionHandler]: Unknown extern function usb_string [2022-12-13 18:28:20,828 WARN L623 FunctionHandler]: Unknown extern function _dev_info [2022-12-13 18:28:20,829 WARN L623 FunctionHandler]: Unknown extern function usbnet_get_endpoints [2022-12-13 18:28:20,830 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 18:28:20,831 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 18:28:20,832 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 18:28:20,832 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 18:28:20,834 WARN L623 FunctionHandler]: Unknown extern function skb_put [2022-12-13 18:28:20,835 WARN L623 FunctionHandler]: Unknown extern function usbnet_skb_return [2022-12-13 18:28:20,835 WARN L623 FunctionHandler]: Unknown extern function skb_pull [2022-12-13 18:28:20,836 WARN L623 FunctionHandler]: Unknown extern function skb_pull [2022-12-13 18:28:20,837 WARN L623 FunctionHandler]: Unknown extern function skb_trim [2022-12-13 18:28:20,837 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 18:28:20,839 WARN L623 FunctionHandler]: Unknown extern function skb_pull [2022-12-13 18:28:20,839 WARN L623 FunctionHandler]: Unknown extern function skb_put [2022-12-13 18:28:20,840 WARN L623 FunctionHandler]: Unknown extern function usbnet_skb_return [2022-12-13 18:28:20,840 WARN L623 FunctionHandler]: Unknown extern function skb_pull [2022-12-13 18:28:20,841 WARN L623 FunctionHandler]: Unknown extern function skb_copy_expand [2022-12-13 18:28:20,841 WARN L623 FunctionHandler]: Unknown extern function skb_push [2022-12-13 18:28:20,845 WARN L623 FunctionHandler]: Unknown extern function usbnet_probe [2022-12-13 18:28:20,846 WARN L623 FunctionHandler]: Unknown extern function usbnet_disconnect [2022-12-13 18:28:20,846 WARN L623 FunctionHandler]: Unknown extern function usbnet_disconnect [2022-12-13 18:28:20,847 WARN L623 FunctionHandler]: Unknown extern function usbnet_suspend [2022-12-13 18:28:20,847 WARN L623 FunctionHandler]: Unknown extern function usbnet_resume [2022-12-13 18:28:20,848 WARN L623 FunctionHandler]: Unknown extern function ldv_reset_resume_1 [2022-12-13 18:28:20,850 WARN L623 FunctionHandler]: Unknown extern function ldv_skb_free [2022-12-13 18:28:20,851 WARN L623 FunctionHandler]: Unknown extern function ldv_skb_free [2022-12-13 18:28:20,851 WARN L623 FunctionHandler]: Unknown extern function ldv_skb_free [2022-12-13 18:28:20,851 WARN L623 FunctionHandler]: Unknown extern function ldv_skb_free [2022-12-13 18:28:20,852 WARN L623 FunctionHandler]: Unknown extern function ldv_skb_free [2022-12-13 18:28:20,852 WARN L623 FunctionHandler]: Unknown extern function ldv_skb_alloc [2022-12-13 18:28:20,852 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 18:28:20,853 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-12-13 18:28:20,853 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-12-13 18:28:20,858 WARN L623 FunctionHandler]: Unknown extern function ldv_skb_alloc [2022-12-13 18:28:20,860 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 18:28:20,860 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 18:28:20,860 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 18:28:20,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:28:20,882 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:28:20,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:20 WrapperNode [2022-12-13 18:28:20,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:28:20,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:28:20,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:28:20,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:28:20,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:20" (1/1) ... [2022-12-13 18:28:20,911 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:20" (1/1) ... [2022-12-13 18:28:20,954 INFO L138 Inliner]: procedures = 102, calls = 313, calls flagged for inlining = 35, calls inlined = 32, statements flattened = 972 [2022-12-13 18:28:20,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:28:20,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:28:20,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:28:20,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:28:20,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:20" (1/1) ... [2022-12-13 18:28:20,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:20" (1/1) ... [2022-12-13 18:28:20,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:20" (1/1) ... [2022-12-13 18:28:20,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:20" (1/1) ... [2022-12-13 18:28:20,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:20" (1/1) ... [2022-12-13 18:28:21,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:20" (1/1) ... [2022-12-13 18:28:21,004 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:20" (1/1) ... [2022-12-13 18:28:21,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:20" (1/1) ... [2022-12-13 18:28:21,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:28:21,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:28:21,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:28:21,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:28:21,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:20" (1/1) ... [2022-12-13 18:28:21,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:28:21,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:28:21,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:28:21,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:28:21,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-12-13 18:28:21,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-12-13 18:28:21,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-12-13 18:28:21,094 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-12-13 18:28:21,094 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-12-13 18:28:21,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-12-13 18:28:21,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-12-13 18:28:21,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 18:28:21,094 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_tx_fixup [2022-12-13 18:28:21,094 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_tx_fixup [2022-12-13 18:28:21,094 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2022-12-13 18:28:21,094 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2022-12-13 18:28:21,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-12-13 18:28:21,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-12-13 18:28:21,094 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-12-13 18:28:21,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-12-13 18:28:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-12-13 18:28:21,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-12-13 18:28:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_rx_fixup [2022-12-13 18:28:21,095 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_rx_fixup [2022-12-13 18:28:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_12 [2022-12-13 18:28:21,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_12 [2022-12-13 18:28:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-12-13 18:28:21,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-12-13 18:28:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-12-13 18:28:21,095 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-12-13 18:28:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 18:28:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-12-13 18:28:21,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-12-13 18:28:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-12-13 18:28:21,096 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-12-13 18:28:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-12-13 18:28:21,096 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-12-13 18:28:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_skb_return [2022-12-13 18:28:21,096 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_skb_return [2022-12-13 18:28:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 18:28:21,097 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 18:28:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 18:28:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:28:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 18:28:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 18:28:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 18:28:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 18:28:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 18:28:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-12-13 18:28:21,098 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-12-13 18:28:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-12-13 18:28:21,098 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-12-13 18:28:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_cmd [2022-12-13 18:28:21,098 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_cmd [2022-12-13 18:28:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 18:28:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-12-13 18:28:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-12-13 18:28:21,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-12-13 18:28:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:28:21,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:28:21,325 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:28:21,327 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:28:21,409 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-12-13 18:28:22,789 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:28:22,795 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:28:22,796 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 18:28:22,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:28:22 BoogieIcfgContainer [2022-12-13 18:28:22,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:28:22,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:28:22,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:28:22,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:28:22,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:28:20" (1/3) ... [2022-12-13 18:28:22,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c888735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:28:22, skipping insertion in model container [2022-12-13 18:28:22,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:20" (2/3) ... [2022-12-13 18:28:22,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c888735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:28:22, skipping insertion in model container [2022-12-13 18:28:22,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:28:22" (3/3) ... [2022-12-13 18:28:22,803 INFO L112 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2022-12-13 18:28:22,817 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:28:22,817 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 18:28:22,864 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:28:22,869 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;@33b744e4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:28:22,869 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 18:28:22,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 300 states, 224 states have (on average 1.3928571428571428) internal successors, (312), 230 states have internal predecessors, (312), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-12-13 18:28:22,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 18:28:22,882 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:28:22,883 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 18:28:22,883 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:28:22,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:28:22,887 INFO L85 PathProgramCache]: Analyzing trace with hash 189481277, now seen corresponding path program 1 times [2022-12-13 18:28:22,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:28:22,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982694498] [2022-12-13 18:28:22,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:28:22,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:28:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:23,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:23,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:28:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:23,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:28:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 18:28:23,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:28:23,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982694498] [2022-12-13 18:28:23,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982694498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:28:23,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:28:23,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:28:23,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348327655] [2022-12-13 18:28:23,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:28:23,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:28:23,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:28:23,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:28:23,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:28:23,307 INFO L87 Difference]: Start difference. First operand has 300 states, 224 states have (on average 1.3928571428571428) internal successors, (312), 230 states have internal predecessors, (312), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 18:28:26,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:28:26,355 INFO L93 Difference]: Finished difference Result 1023 states and 1553 transitions. [2022-12-13 18:28:26,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:28:26,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-12-13 18:28:26,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:28:26,368 INFO L225 Difference]: With dead ends: 1023 [2022-12-13 18:28:26,368 INFO L226 Difference]: Without dead ends: 712 [2022-12-13 18:28:26,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:28:26,375 INFO L413 NwaCegarLoop]: 399 mSDtfsCounter, 843 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-13 18:28:26,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 1163 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-12-13 18:28:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-12-13 18:28:26,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 541. [2022-12-13 18:28:26,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 411 states have (on average 1.3722627737226278) internal successors, (564), 411 states have internal predecessors, (564), 94 states have call successors, (94), 36 states have call predecessors, (94), 35 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2022-12-13 18:28:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 751 transitions. [2022-12-13 18:28:26,465 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 751 transitions. Word has length 36 [2022-12-13 18:28:26,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:28:26,466 INFO L495 AbstractCegarLoop]: Abstraction has 541 states and 751 transitions. [2022-12-13 18:28:26,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 18:28:26,466 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 751 transitions. [2022-12-13 18:28:26,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 18:28:26,468 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:28:26,468 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 18:28:26,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 18:28:26,468 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:28:26,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:28:26,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1476167779, now seen corresponding path program 1 times [2022-12-13 18:28:26,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:28:26,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859100611] [2022-12-13 18:28:26,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:28:26,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:28:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:26,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:26,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:28:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:26,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:28:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:26,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 18:28:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 18:28:26,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:28:26,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859100611] [2022-12-13 18:28:26,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859100611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:28:26,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:28:26,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:28:26,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220653572] [2022-12-13 18:28:26,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:28:26,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:28:26,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:28:26,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:28:26,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:28:26,728 INFO L87 Difference]: Start difference. First operand 541 states and 751 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 18:28:28,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:28:28,523 INFO L93 Difference]: Finished difference Result 1931 states and 2815 transitions. [2022-12-13 18:28:28,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:28:28,524 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-12-13 18:28:28,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:28:28,530 INFO L225 Difference]: With dead ends: 1931 [2022-12-13 18:28:28,530 INFO L226 Difference]: Without dead ends: 1398 [2022-12-13 18:28:28,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-12-13 18:28:28,533 INFO L413 NwaCegarLoop]: 462 mSDtfsCounter, 845 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 2150 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:28:28,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 2150 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-13 18:28:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2022-12-13 18:28:28,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1135. [2022-12-13 18:28:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 869 states have (on average 1.3774453394706558) internal successors, (1197), 871 states have internal predecessors, (1197), 188 states have call successors, (188), 70 states have call predecessors, (188), 77 states have return successors, (215), 193 states have call predecessors, (215), 187 states have call successors, (215) [2022-12-13 18:28:28,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1600 transitions. [2022-12-13 18:28:28,589 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1600 transitions. Word has length 46 [2022-12-13 18:28:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:28:28,589 INFO L495 AbstractCegarLoop]: Abstraction has 1135 states and 1600 transitions. [2022-12-13 18:28:28,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 18:28:28,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1600 transitions. [2022-12-13 18:28:28,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-13 18:28:28,594 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:28:28,594 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-12-13 18:28:28,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 18:28:28,594 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:28:28,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:28:28,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1906104873, now seen corresponding path program 1 times [2022-12-13 18:28:28,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:28:28,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299464710] [2022-12-13 18:28:28,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:28:28,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:28:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:28,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:28,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:28:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:28,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:28:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:28,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 18:28:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:28,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:28,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:28,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:28,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 18:28:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:28,753 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 18:28:28,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:28:28,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299464710] [2022-12-13 18:28:28,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299464710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:28:28,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:28:28,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:28:28,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055847870] [2022-12-13 18:28:28,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:28:28,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:28:28,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:28:28,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:28:28,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:28:28,755 INFO L87 Difference]: Start difference. First operand 1135 states and 1600 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 18:28:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:28:30,254 INFO L93 Difference]: Finished difference Result 2755 states and 3973 transitions. [2022-12-13 18:28:30,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:28:30,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2022-12-13 18:28:30,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:28:30,263 INFO L225 Difference]: With dead ends: 2755 [2022-12-13 18:28:30,263 INFO L226 Difference]: Without dead ends: 1634 [2022-12-13 18:28:30,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:28:30,267 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 349 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 18:28:30,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1064 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-13 18:28:30,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2022-12-13 18:28:30,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1356. [2022-12-13 18:28:30,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1067 states have (on average 1.3964386129334583) internal successors, (1490), 1069 states have internal predecessors, (1490), 201 states have call successors, (201), 80 states have call predecessors, (201), 87 states have return successors, (228), 206 states have call predecessors, (228), 200 states have call successors, (228) [2022-12-13 18:28:30,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1919 transitions. [2022-12-13 18:28:30,321 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1919 transitions. Word has length 84 [2022-12-13 18:28:30,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:28:30,321 INFO L495 AbstractCegarLoop]: Abstraction has 1356 states and 1919 transitions. [2022-12-13 18:28:30,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 18:28:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1919 transitions. [2022-12-13 18:28:30,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-13 18:28:30,325 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:28:30,325 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 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] [2022-12-13 18:28:30,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 18:28:30,325 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:28:30,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:28:30,326 INFO L85 PathProgramCache]: Analyzing trace with hash 268281740, now seen corresponding path program 1 times [2022-12-13 18:28:30,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:28:30,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879785967] [2022-12-13 18:28:30,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:28:30,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:28:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:30,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:30,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:28:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:30,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:28:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:30,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 18:28:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:30,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 18:28:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:30,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 18:28:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:30,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-12-13 18:28:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:30,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 18:28:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:30,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:30,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:30,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-13 18:28:30,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:28:30,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879785967] [2022-12-13 18:28:30,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879785967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:28:30,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:28:30,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:28:30,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656375973] [2022-12-13 18:28:30,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:28:30,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:28:30,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:28:30,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:28:30,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:28:30,547 INFO L87 Difference]: Start difference. First operand 1356 states and 1919 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 18:28:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:28:33,288 INFO L93 Difference]: Finished difference Result 3985 states and 5739 transitions. [2022-12-13 18:28:33,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:28:33,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 112 [2022-12-13 18:28:33,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:28:33,299 INFO L225 Difference]: With dead ends: 3985 [2022-12-13 18:28:33,299 INFO L226 Difference]: Without dead ends: 2654 [2022-12-13 18:28:33,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:28:33,304 INFO L413 NwaCegarLoop]: 458 mSDtfsCounter, 590 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:28:33,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1569 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-12-13 18:28:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2022-12-13 18:28:33,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 2140. [2022-12-13 18:28:33,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 1689 states have (on average 1.3818827708703374) internal successors, (2334), 1693 states have internal predecessors, (2334), 303 states have call successors, (303), 132 states have call predecessors, (303), 147 states have return successors, (347), 314 states have call predecessors, (347), 302 states have call successors, (347) [2022-12-13 18:28:33,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2984 transitions. [2022-12-13 18:28:33,396 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2984 transitions. Word has length 112 [2022-12-13 18:28:33,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:28:33,397 INFO L495 AbstractCegarLoop]: Abstraction has 2140 states and 2984 transitions. [2022-12-13 18:28:33,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 18:28:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2984 transitions. [2022-12-13 18:28:33,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-13 18:28:33,399 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:28:33,399 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 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] [2022-12-13 18:28:33,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 18:28:33,400 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:28:33,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:28:33,400 INFO L85 PathProgramCache]: Analyzing trace with hash -892369942, now seen corresponding path program 1 times [2022-12-13 18:28:33,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:28:33,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089320657] [2022-12-13 18:28:33,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:28:33,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:28:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:33,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:33,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:28:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:33,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:28:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:33,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 18:28:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:33,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 18:28:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:33,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 18:28:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:33,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-12-13 18:28:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:33,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 18:28:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:33,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:33,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:33,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-12-13 18:28:33,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:28:33,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089320657] [2022-12-13 18:28:33,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089320657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:28:33,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:28:33,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 18:28:33,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623852036] [2022-12-13 18:28:33,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:28:33,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 18:28:33,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:28:33,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 18:28:33,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-13 18:28:33,958 INFO L87 Difference]: Start difference. First operand 2140 states and 2984 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 1 states have call successors, (11) [2022-12-13 18:28:35,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:28:35,834 INFO L93 Difference]: Finished difference Result 4852 states and 6996 transitions. [2022-12-13 18:28:35,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 18:28:35,835 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2022-12-13 18:28:35,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:28:35,844 INFO L225 Difference]: With dead ends: 4852 [2022-12-13 18:28:35,844 INFO L226 Difference]: Without dead ends: 2737 [2022-12-13 18:28:35,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-12-13 18:28:35,849 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 343 mSDsluCounter, 2512 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 2845 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:28:35,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 2845 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-13 18:28:35,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2022-12-13 18:28:35,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 2232. [2022-12-13 18:28:35,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2232 states, 1761 states have (on average 1.373083475298126) internal successors, (2418), 1773 states have internal predecessors, (2418), 303 states have call successors, (303), 132 states have call predecessors, (303), 167 states have return successors, (376), 326 states have call predecessors, (376), 302 states have call successors, (376) [2022-12-13 18:28:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 3097 transitions. [2022-12-13 18:28:35,933 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 3097 transitions. Word has length 112 [2022-12-13 18:28:35,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:28:35,933 INFO L495 AbstractCegarLoop]: Abstraction has 2232 states and 3097 transitions. [2022-12-13 18:28:35,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 1 states have call successors, (11) [2022-12-13 18:28:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 3097 transitions. [2022-12-13 18:28:35,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-13 18:28:35,936 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:28:35,936 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 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] [2022-12-13 18:28:35,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 18:28:35,936 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:28:35,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:28:35,936 INFO L85 PathProgramCache]: Analyzing trace with hash -875304832, now seen corresponding path program 1 times [2022-12-13 18:28:35,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:28:35,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978440925] [2022-12-13 18:28:35,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:28:35,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:28:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:36,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:36,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:28:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:36,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:28:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:36,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 18:28:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:36,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 18:28:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:36,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 18:28:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:36,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-12-13 18:28:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:36,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 18:28:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:36,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:36,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:36,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:36,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:28:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:36,482 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-12-13 18:28:36,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:28:36,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978440925] [2022-12-13 18:28:36,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978440925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:28:36,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:28:36,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 18:28:36,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226963983] [2022-12-13 18:28:36,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:28:36,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 18:28:36,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:28:36,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 18:28:36,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-12-13 18:28:36,484 INFO L87 Difference]: Start difference. First operand 2232 states and 3097 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 18:28:38,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:28:38,231 INFO L93 Difference]: Finished difference Result 4904 states and 7005 transitions. [2022-12-13 18:28:38,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 18:28:38,231 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2022-12-13 18:28:38,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:28:38,239 INFO L225 Difference]: With dead ends: 4904 [2022-12-13 18:28:38,240 INFO L226 Difference]: Without dead ends: 2697 [2022-12-13 18:28:38,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-12-13 18:28:38,244 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 237 mSDsluCounter, 2926 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 3277 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:28:38,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 3277 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-13 18:28:38,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2022-12-13 18:28:38,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2180. [2022-12-13 18:28:38,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 1717 states have (on average 1.370995923121724) internal successors, (2354), 1725 states have internal predecessors, (2354), 303 states have call successors, (303), 132 states have call predecessors, (303), 159 states have return successors, (364), 322 states have call predecessors, (364), 302 states have call successors, (364) [2022-12-13 18:28:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3021 transitions. [2022-12-13 18:28:38,337 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3021 transitions. Word has length 119 [2022-12-13 18:28:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:28:38,337 INFO L495 AbstractCegarLoop]: Abstraction has 2180 states and 3021 transitions. [2022-12-13 18:28:38,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 18:28:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3021 transitions. [2022-12-13 18:28:38,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-12-13 18:28:38,340 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:28:38,340 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 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] [2022-12-13 18:28:38,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 18:28:38,340 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:28:38,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:28:38,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1051866558, now seen corresponding path program 1 times [2022-12-13 18:28:38,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:28:38,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98699259] [2022-12-13 18:28:38,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:28:38,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:28:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:38,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:38,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:28:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:38,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:28:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:38,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 18:28:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:38,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 18:28:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:38,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 18:28:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:38,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-12-13 18:28:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:38,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 18:28:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:38,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:38,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:38,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:38,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 18:28:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-12-13 18:28:38,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:28:38,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98699259] [2022-12-13 18:28:38,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98699259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:28:38,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:28:38,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 18:28:38,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456532700] [2022-12-13 18:28:38,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:28:38,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 18:28:38,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:28:38,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 18:28:38,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:28:38,800 INFO L87 Difference]: Start difference. First operand 2180 states and 3021 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 18:28:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:28:40,462 INFO L93 Difference]: Finished difference Result 5136 states and 7485 transitions. [2022-12-13 18:28:40,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 18:28:40,462 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2022-12-13 18:28:40,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:28:40,480 INFO L225 Difference]: With dead ends: 5136 [2022-12-13 18:28:40,480 INFO L226 Difference]: Without dead ends: 2981 [2022-12-13 18:28:40,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-12-13 18:28:40,484 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 434 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-13 18:28:40,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1737 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-13 18:28:40,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2022-12-13 18:28:40,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2336. [2022-12-13 18:28:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 1809 states have (on average 1.3609729132117192) internal successors, (2462), 1821 states have internal predecessors, (2462), 359 states have call successors, (359), 132 states have call predecessors, (359), 167 states have return successors, (494), 382 states have call predecessors, (494), 358 states have call successors, (494) [2022-12-13 18:28:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 3315 transitions. [2022-12-13 18:28:40,584 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 3315 transitions. Word has length 118 [2022-12-13 18:28:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:28:40,585 INFO L495 AbstractCegarLoop]: Abstraction has 2336 states and 3315 transitions. [2022-12-13 18:28:40,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 18:28:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 3315 transitions. [2022-12-13 18:28:40,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-13 18:28:40,587 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:28:40,587 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 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] [2022-12-13 18:28:40,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 18:28:40,588 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:28:40,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:28:40,588 INFO L85 PathProgramCache]: Analyzing trace with hash -581048744, now seen corresponding path program 1 times [2022-12-13 18:28:40,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:28:40,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119806681] [2022-12-13 18:28:40,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:28:40,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:28:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:40,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:40,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:28:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:40,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:28:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:40,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 18:28:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:40,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 18:28:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:40,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 18:28:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:40,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-12-13 18:28:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:40,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 18:28:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:40,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:40,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:40,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:40,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:28:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:40,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 18:28:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:40,932 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-12-13 18:28:40,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:28:40,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119806681] [2022-12-13 18:28:40,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119806681] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:28:40,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28627201] [2022-12-13 18:28:40,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:28:40,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:28:40,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:28:40,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:28:40,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 18:28:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:41,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 1225 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 18:28:41,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:28:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-12-13 18:28:41,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:28:41,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28627201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:28:41,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:28:41,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-12-13 18:28:41,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12802575] [2022-12-13 18:28:41,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:28:41,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:28:41,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:28:41,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:28:41,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:28:41,293 INFO L87 Difference]: Start difference. First operand 2336 states and 3315 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-12-13 18:28:41,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:28:41,423 INFO L93 Difference]: Finished difference Result 4657 states and 6615 transitions. [2022-12-13 18:28:41,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:28:41,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2022-12-13 18:28:41,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:28:41,430 INFO L225 Difference]: With dead ends: 4657 [2022-12-13 18:28:41,430 INFO L226 Difference]: Without dead ends: 2337 [2022-12-13 18:28:41,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:28:41,434 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 2 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:28:41,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1188 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:28:41,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2022-12-13 18:28:41,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2337. [2022-12-13 18:28:41,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2337 states, 1810 states have (on average 1.3607734806629834) internal successors, (2463), 1822 states have internal predecessors, (2463), 359 states have call successors, (359), 132 states have call predecessors, (359), 167 states have return successors, (494), 382 states have call predecessors, (494), 358 states have call successors, (494) [2022-12-13 18:28:41,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 3316 transitions. [2022-12-13 18:28:41,543 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 3316 transitions. Word has length 125 [2022-12-13 18:28:41,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:28:41,544 INFO L495 AbstractCegarLoop]: Abstraction has 2337 states and 3316 transitions. [2022-12-13 18:28:41,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-12-13 18:28:41,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 3316 transitions. [2022-12-13 18:28:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-13 18:28:41,546 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:28:41,547 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 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] [2022-12-13 18:28:41,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 18:28:41,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:28:41,747 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:28:41,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:28:41,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1986698972, now seen corresponding path program 1 times [2022-12-13 18:28:41,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:28:41,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391431926] [2022-12-13 18:28:41,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:28:41,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:28:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:41,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:41,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:28:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:42,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:28:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:42,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 18:28:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:42,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 18:28:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:42,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 18:28:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:42,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 18:28:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:42,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 18:28:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:42,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:42,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:42,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:42,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:28:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:42,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 18:28:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 18:28:42,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:28:42,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391431926] [2022-12-13 18:28:42,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391431926] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:28:42,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265540982] [2022-12-13 18:28:42,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:28:42,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:28:42,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:28:42,152 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:28:42,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 18:28:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:42,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 18:28:42,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:28:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-12-13 18:28:42,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:28:42,697 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 18:28:42,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265540982] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:28:42,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:28:42,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-12-13 18:28:42,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568284518] [2022-12-13 18:28:42,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:28:42,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 18:28:42,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:28:42,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 18:28:42,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-12-13 18:28:42,700 INFO L87 Difference]: Start difference. First operand 2337 states and 3316 transitions. Second operand has 14 states, 14 states have (on average 9.0) internal successors, (126), 10 states have internal predecessors, (126), 2 states have call successors, (36), 6 states have call predecessors, (36), 5 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-12-13 18:28:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:28:44,940 INFO L93 Difference]: Finished difference Result 5305 states and 7700 transitions. [2022-12-13 18:28:44,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 18:28:44,940 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.0) internal successors, (126), 10 states have internal predecessors, (126), 2 states have call successors, (36), 6 states have call predecessors, (36), 5 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 127 [2022-12-13 18:28:44,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:28:44,953 INFO L225 Difference]: With dead ends: 5305 [2022-12-13 18:28:44,953 INFO L226 Difference]: Without dead ends: 2982 [2022-12-13 18:28:44,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2022-12-13 18:28:44,959 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 351 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 2376 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:28:44,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 2376 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-12-13 18:28:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2022-12-13 18:28:45,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2340. [2022-12-13 18:28:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2340 states, 1813 states have (on average 1.360176503033646) internal successors, (2466), 1825 states have internal predecessors, (2466), 359 states have call successors, (359), 132 states have call predecessors, (359), 167 states have return successors, (494), 382 states have call predecessors, (494), 358 states have call successors, (494) [2022-12-13 18:28:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 2340 states and 3319 transitions. [2022-12-13 18:28:45,117 INFO L78 Accepts]: Start accepts. Automaton has 2340 states and 3319 transitions. Word has length 127 [2022-12-13 18:28:45,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:28:45,117 INFO L495 AbstractCegarLoop]: Abstraction has 2340 states and 3319 transitions. [2022-12-13 18:28:45,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.0) internal successors, (126), 10 states have internal predecessors, (126), 2 states have call successors, (36), 6 states have call predecessors, (36), 5 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-12-13 18:28:45,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 3319 transitions. [2022-12-13 18:28:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-12-13 18:28:45,120 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:28:45,120 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 6, 5, 3, 3, 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] [2022-12-13 18:28:45,129 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 18:28:45,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:28:45,321 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:28:45,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:28:45,321 INFO L85 PathProgramCache]: Analyzing trace with hash 869523544, now seen corresponding path program 2 times [2022-12-13 18:28:45,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:28:45,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753271505] [2022-12-13 18:28:45,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:28:45,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:28:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:46,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:46,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:28:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:46,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 18:28:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:46,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 18:28:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:46,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 18:28:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:46,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 18:28:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:46,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 18:28:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:46,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 18:28:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:46,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:46,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:46,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:47,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:28:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:47,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 18:28:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-12-13 18:28:47,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:28:47,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753271505] [2022-12-13 18:28:47,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753271505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:28:47,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:28:47,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-13 18:28:47,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894821809] [2022-12-13 18:28:47,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:28:47,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 18:28:47,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:28:47,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 18:28:47,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2022-12-13 18:28:47,264 INFO L87 Difference]: Start difference. First operand 2340 states and 3319 transitions. Second operand has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 12 states have internal predecessors, (81), 4 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) [2022-12-13 18:28:50,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:28:50,757 INFO L93 Difference]: Finished difference Result 5461 states and 7970 transitions. [2022-12-13 18:28:50,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 18:28:50,758 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 12 states have internal predecessors, (81), 4 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) Word has length 133 [2022-12-13 18:28:50,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:28:50,766 INFO L225 Difference]: With dead ends: 5461 [2022-12-13 18:28:50,767 INFO L226 Difference]: Without dead ends: 3150 [2022-12-13 18:28:50,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2022-12-13 18:28:50,771 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 397 mSDsluCounter, 5347 mSDsCounter, 0 mSdLazyCounter, 2699 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 5760 SdHoareTripleChecker+Invalid, 2961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 2699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:28:50,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 5760 Invalid, 2961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 2699 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-12-13 18:28:50,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states. [2022-12-13 18:28:50,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 2392. [2022-12-13 18:28:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 1853 states have (on average 1.3524015110631409) internal successors, (2506), 1861 states have internal predecessors, (2506), 363 states have call successors, (363), 132 states have call predecessors, (363), 175 states have return successors, (522), 398 states have call predecessors, (522), 362 states have call successors, (522) [2022-12-13 18:28:50,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 3391 transitions. [2022-12-13 18:28:50,905 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 3391 transitions. Word has length 133 [2022-12-13 18:28:50,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:28:50,905 INFO L495 AbstractCegarLoop]: Abstraction has 2392 states and 3391 transitions. [2022-12-13 18:28:50,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 12 states have internal predecessors, (81), 4 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) [2022-12-13 18:28:50,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3391 transitions. [2022-12-13 18:28:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-12-13 18:28:50,909 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:28:50,909 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:28:50,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 18:28:50,909 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:28:50,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:28:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1075246393, now seen corresponding path program 1 times [2022-12-13 18:28:50,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:28:50,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011596112] [2022-12-13 18:28:50,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:28:50,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:28:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:50,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:51,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:28:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:51,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 18:28:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:51,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 18:28:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:51,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 18:28:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:51,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 18:28:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:51,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 18:28:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:51,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 18:28:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:51,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 18:28:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:51,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:51,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 18:28:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:51,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:51,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:51,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:28:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:51,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 18:28:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-12-13 18:28:51,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:28:51,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011596112] [2022-12-13 18:28:51,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011596112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:28:51,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:28:51,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:28:51,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655021606] [2022-12-13 18:28:51,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:28:51,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:28:51,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:28:51,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:28:51,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:28:51,102 INFO L87 Difference]: Start difference. First operand 2392 states and 3391 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 18:28:53,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:28:53,194 INFO L93 Difference]: Finished difference Result 5417 states and 7906 transitions. [2022-12-13 18:28:53,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:28:53,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 153 [2022-12-13 18:28:53,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:28:53,203 INFO L225 Difference]: With dead ends: 5417 [2022-12-13 18:28:53,203 INFO L226 Difference]: Without dead ends: 3054 [2022-12-13 18:28:53,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:28:53,207 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 348 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-13 18:28:53,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1343 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-12-13 18:28:53,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2022-12-13 18:28:53,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 2404. [2022-12-13 18:28:53,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2404 states, 1865 states have (on average 1.3501340482573727) internal successors, (2518), 1873 states have internal predecessors, (2518), 363 states have call successors, (363), 132 states have call predecessors, (363), 175 states have return successors, (522), 398 states have call predecessors, (522), 362 states have call successors, (522) [2022-12-13 18:28:53,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2404 states and 3403 transitions. [2022-12-13 18:28:53,325 INFO L78 Accepts]: Start accepts. Automaton has 2404 states and 3403 transitions. Word has length 153 [2022-12-13 18:28:53,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:28:53,325 INFO L495 AbstractCegarLoop]: Abstraction has 2404 states and 3403 transitions. [2022-12-13 18:28:53,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 18:28:53,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 3403 transitions. [2022-12-13 18:28:53,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-12-13 18:28:53,328 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:28:53,328 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:28:53,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 18:28:53,329 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:28:53,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:28:53,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1635946171, now seen corresponding path program 1 times [2022-12-13 18:28:53,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:28:53,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267953630] [2022-12-13 18:28:53,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:28:53,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:28:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:54,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:54,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:28:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:54,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 18:28:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:54,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 18:28:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:54,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 18:28:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:54,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 18:28:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:54,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 18:28:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:54,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 18:28:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:54,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 18:28:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:54,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:54,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 18:28:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:54,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:54,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:28:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:54,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:28:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:54,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 18:28:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-12-13 18:28:54,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:28:54,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267953630] [2022-12-13 18:28:54,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267953630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:28:54,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:28:54,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-13 18:28:54,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304237287] [2022-12-13 18:28:54,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:28:54,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 18:28:54,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:28:54,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 18:28:54,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2022-12-13 18:28:54,989 INFO L87 Difference]: Start difference. First operand 2404 states and 3403 transitions. Second operand has 20 states, 19 states have (on average 4.947368421052632) internal successors, (94), 12 states have internal predecessors, (94), 4 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 3 states have call successors, (15) [2022-12-13 18:28:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:28:58,036 INFO L93 Difference]: Finished difference Result 5693 states and 8346 transitions. [2022-12-13 18:28:58,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 18:28:58,037 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.947368421052632) internal successors, (94), 12 states have internal predecessors, (94), 4 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 3 states have call successors, (15) Word has length 153 [2022-12-13 18:28:58,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:28:58,046 INFO L225 Difference]: With dead ends: 5693 [2022-12-13 18:28:58,047 INFO L226 Difference]: Without dead ends: 3318 [2022-12-13 18:28:58,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2022-12-13 18:28:58,051 INFO L413 NwaCegarLoop]: 390 mSDtfsCounter, 223 mSDsluCounter, 5318 mSDsCounter, 0 mSdLazyCounter, 2913 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 5708 SdHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-12-13 18:28:58,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 5708 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2913 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-12-13 18:28:58,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3318 states. [2022-12-13 18:28:58,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3318 to 2420. [2022-12-13 18:28:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2420 states, 1881 states have (on average 1.3471557682083999) internal successors, (2534), 1881 states have internal predecessors, (2534), 363 states have call successors, (363), 132 states have call predecessors, (363), 175 states have return successors, (522), 406 states have call predecessors, (522), 362 states have call successors, (522) [2022-12-13 18:28:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3419 transitions. [2022-12-13 18:28:58,187 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3419 transitions. Word has length 153 [2022-12-13 18:28:58,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:28:58,187 INFO L495 AbstractCegarLoop]: Abstraction has 2420 states and 3419 transitions. [2022-12-13 18:28:58,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.947368421052632) internal successors, (94), 12 states have internal predecessors, (94), 4 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 3 states have call successors, (15) [2022-12-13 18:28:58,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3419 transitions. [2022-12-13 18:28:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-12-13 18:28:58,192 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:28:58,192 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 6, 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, 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 18:28:58,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 18:28:58,192 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:28:58,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:28:58,192 INFO L85 PathProgramCache]: Analyzing trace with hash 183203510, now seen corresponding path program 1 times [2022-12-13 18:28:58,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:28:58,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007136522] [2022-12-13 18:28:58,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:28:58,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:28:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:59,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:28:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:59,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:28:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:59,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 18:28:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:59,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 18:28:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:59,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 18:28:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:59,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 18:28:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:59,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 18:28:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 18:28:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:00,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 18:29:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:00,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:29:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:00,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 18:29:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:00,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:29:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:00,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:29:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:01,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:29:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:01,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 18:29:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:01,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 18:29:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:01,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 18:29:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:01,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 18:29:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:01,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 18:29:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:01,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:29:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-12-13 18:29:01,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:29:01,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007136522] [2022-12-13 18:29:01,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007136522] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:29:01,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584949406] [2022-12-13 18:29:01,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:29:01,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:29:01,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:29:01,274 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:29:01,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 18:29:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:01,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 1580 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-13 18:29:01,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:29:06,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 18:29:21,247 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 18:29:21,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 18:29:25,472 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-13 18:29:25,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 36 [2022-12-13 18:29:25,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-12-13 18:29:25,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-12-13 18:29:25,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-12-13 18:29:27,836 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 18:29:27,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 31 [2022-12-13 18:29:28,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-12-13 18:29:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 38 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-12-13 18:29:28,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:29:28,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 327 treesize of output 309 [2022-12-13 18:29:28,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 270 [2022-12-13 18:29:28,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 254 [2022-12-13 18:29:28,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 246 [2022-12-13 18:29:29,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584949406] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:29:29,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:29:29,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 27] total 62 [2022-12-13 18:29:29,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839256456] [2022-12-13 18:29:29,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:29:29,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-12-13 18:29:29,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:29:29,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-12-13 18:29:29,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=4214, Unknown=25, NotChecked=0, Total=4556 [2022-12-13 18:29:29,033 INFO L87 Difference]: Start difference. First operand 2420 states and 3419 transitions. Second operand has 62 states, 62 states have (on average 3.5) internal successors, (217), 49 states have internal predecessors, (217), 22 states have call successors, (40), 10 states have call predecessors, (40), 18 states have return successors, (39), 26 states have call predecessors, (39), 21 states have call successors, (39) [2022-12-13 18:29:30,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:29:32,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 18:29:34,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 18:29:36,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 18:29:41,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 18:29:47,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:29:54,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:29:55,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 18:29:56,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 18:30:00,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:04,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:08,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:11,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:13,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:17,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:19,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:21,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:23,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:26,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:28,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:32,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:36,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:40,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:42,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:44,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:49,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:51,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:53,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:56,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:59,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:02,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:05,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:07,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:09,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:11,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:13,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:16,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:20,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:24,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:26,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:28,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:31,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:33,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:39,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:41,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:44,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:46,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:49,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:51,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:54,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:56,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:59,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:32:01,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:32:03,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:32:18,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:32:32,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:32:35,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:32:39,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:32:43,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:32:45,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:32:47,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:32:50,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:32:52,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:32:54,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:32:56,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:00,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:02,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:04,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:08,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:12,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:16,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:18,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:20,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:25,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:27,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:31,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:35,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:37,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:41,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:43,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:45,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:47,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:49,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:52,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:54,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:33:58,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:34:02,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:34:04,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:34:24,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:34:26,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:34:28,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:34:31,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:34:33,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:34:35,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:35:08,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:35:12,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:35:16,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:35:18,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:35:20,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:35:22,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:35:24,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:35:26,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:35:28,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:35:30,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:35:32,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:35:36,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:35:40,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:35:42,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:35:44,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:35:48,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:35:50,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:35:55,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:35:57,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:35:59,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:01,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:03,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:05,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:07,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:11,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:13,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:15,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:17,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:19,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:21,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:24,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:26,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:28,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:30,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:35,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:37,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:39,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:41,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:43,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:47,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:49,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:55,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:36:57,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:03,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:05,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:08,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:10,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:12,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:14,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:18,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:22,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:24,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:26,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:28,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:31,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:33,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:35,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:37,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:39,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:42,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:44,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:47,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:49,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:51,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:54,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:56,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:37:58,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:38:01,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:38:04,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:38:08,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:38:11,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:38:13,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:38:15,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:38:20,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:38:26,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:38:30,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:38:32,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:38:37,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:38:41,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:38:43,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:38:45,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:38:47,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:38:50,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:38:55,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:39:00,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:39:00,473 INFO L93 Difference]: Finished difference Result 25485 states and 37884 transitions. [2022-12-13 18:39:00,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 298 states. [2022-12-13 18:39:00,474 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 3.5) internal successors, (217), 49 states have internal predecessors, (217), 22 states have call successors, (40), 10 states have call predecessors, (40), 18 states have return successors, (39), 26 states have call predecessors, (39), 21 states have call successors, (39) Word has length 183 [2022-12-13 18:39:00,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:39:00,541 INFO L225 Difference]: With dead ends: 25485 [2022-12-13 18:39:00,542 INFO L226 Difference]: Without dead ends: 23016 [2022-12-13 18:39:00,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 261 SyntacticMatches, 3 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48301 ImplicationChecksByTransitivity, 184.3s TimeCoverageRelationStatistics Valid=6275, Invalid=116397, Unknown=178, NotChecked=0, Total=122850 [2022-12-13 18:39:00,577 INFO L413 NwaCegarLoop]: 1047 mSDtfsCounter, 4184 mSDsluCounter, 27591 mSDsCounter, 0 mSdLazyCounter, 42830 mSolverCounterSat, 3158 mSolverCounterUnsat, 1470 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 405.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4329 SdHoareTripleChecker+Valid, 28638 SdHoareTripleChecker+Invalid, 47458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 3158 IncrementalHoareTripleChecker+Valid, 42830 IncrementalHoareTripleChecker+Invalid, 1470 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 411.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:39:00,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4329 Valid, 28638 Invalid, 47458 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [3158 Valid, 42830 Invalid, 1470 Unknown, 0 Unchecked, 411.3s Time] [2022-12-13 18:39:00,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23016 states. [2022-12-13 18:39:01,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23016 to 18744. [2022-12-13 18:39:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18744 states, 14759 states have (on average 1.370553560539332) internal successors, (20228), 14953 states have internal predecessors, (20228), 2595 states have call successors, (2595), 870 states have call predecessors, (2595), 1389 states have return successors, (4786), 2920 states have call predecessors, (4786), 2594 states have call successors, (4786) [2022-12-13 18:39:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18744 states to 18744 states and 27609 transitions. [2022-12-13 18:39:01,872 INFO L78 Accepts]: Start accepts. Automaton has 18744 states and 27609 transitions. Word has length 183 [2022-12-13 18:39:01,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:39:01,872 INFO L495 AbstractCegarLoop]: Abstraction has 18744 states and 27609 transitions. [2022-12-13 18:39:01,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 3.5) internal successors, (217), 49 states have internal predecessors, (217), 22 states have call successors, (40), 10 states have call predecessors, (40), 18 states have return successors, (39), 26 states have call predecessors, (39), 21 states have call successors, (39) [2022-12-13 18:39:01,873 INFO L276 IsEmpty]: Start isEmpty. Operand 18744 states and 27609 transitions. [2022-12-13 18:39:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-12-13 18:39:01,894 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:39:01,894 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 6, 5, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:39:01,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 18:39:02,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 18:39:02,094 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:39:02,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:39:02,095 INFO L85 PathProgramCache]: Analyzing trace with hash 2033642034, now seen corresponding path program 1 times [2022-12-13 18:39:02,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:39:02,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802876652] [2022-12-13 18:39:02,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:39:02,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:39:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:02,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:39:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:02,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:39:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:02,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 18:39:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:02,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:39:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:02,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-12-13 18:39:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:02,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 18:39:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:02,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 18:39:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:02,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 18:39:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:02,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:39:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:02,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:39:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:02,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:39:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:02,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:39:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:02,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 18:39:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:02,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:39:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:02,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 18:39:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:02,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:39:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:02,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-12-13 18:39:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:02,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 18:39:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:02,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:39:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:02,343 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-12-13 18:39:02,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:39:02,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802876652] [2022-12-13 18:39:02,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802876652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:39:02,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:39:02,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:39:02,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982159498] [2022-12-13 18:39:02,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:39:02,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:39:02,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:39:02,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:39:02,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:39:02,345 INFO L87 Difference]: Start difference. First operand 18744 states and 27609 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-12-13 18:39:07,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:39:07,915 INFO L93 Difference]: Finished difference Result 57656 states and 85049 transitions. [2022-12-13 18:39:07,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:39:07,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 178 [2022-12-13 18:39:07,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:39:08,064 INFO L225 Difference]: With dead ends: 57656 [2022-12-13 18:39:08,064 INFO L226 Difference]: Without dead ends: 38941 [2022-12-13 18:39:08,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:39:08,122 INFO L413 NwaCegarLoop]: 459 mSDtfsCounter, 819 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:39:08,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1617 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-12-13 18:39:08,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38941 states. [2022-12-13 18:39:10,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38941 to 34096. [2022-12-13 18:39:10,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34096 states, 26467 states have (on average 1.346015793251974) internal successors, (35625), 26845 states have internal predecessors, (35625), 4945 states have call successors, (4945), 1650 states have call predecessors, (4945), 2683 states have return successors, (9234), 5600 states have call predecessors, (9234), 4944 states have call successors, (9234) [2022-12-13 18:39:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34096 states to 34096 states and 49804 transitions. [2022-12-13 18:39:10,722 INFO L78 Accepts]: Start accepts. Automaton has 34096 states and 49804 transitions. Word has length 178 [2022-12-13 18:39:10,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:39:10,722 INFO L495 AbstractCegarLoop]: Abstraction has 34096 states and 49804 transitions. [2022-12-13 18:39:10,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-12-13 18:39:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 34096 states and 49804 transitions. [2022-12-13 18:39:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-13 18:39:10,761 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:39:10,762 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 6, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:39:10,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 18:39:10,762 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:39:10,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:39:10,762 INFO L85 PathProgramCache]: Analyzing trace with hash 253350542, now seen corresponding path program 1 times [2022-12-13 18:39:10,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:39:10,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170270948] [2022-12-13 18:39:10,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:39:10,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:39:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:11,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:39:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:11,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:39:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:11,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 18:39:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:11,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 18:39:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:11,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 18:39:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:11,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 18:39:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:11,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 18:39:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:11,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 18:39:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:12,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:39:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:13,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:39:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:13,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:39:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:13,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:39:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:13,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 18:39:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:13,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:39:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:13,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 18:39:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:13,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:39:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:14,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-12-13 18:39:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:14,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 18:39:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:14,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:39:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:14,111 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 18:39:14,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:39:14,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170270948] [2022-12-13 18:39:14,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170270948] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:39:14,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053860230] [2022-12-13 18:39:14,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:39:14,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:39:14,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:39:14,112 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:39:14,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 18:39:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:14,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 1559 conjuncts, 85 conjunts are in the unsatisfiable core [2022-12-13 18:39:14,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:39:15,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 18:39:15,903 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 18:39:15,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 18:39:16,140 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-13 18:39:16,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 37 [2022-12-13 18:39:16,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-12-13 18:39:16,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-12-13 18:39:16,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-12-13 18:39:16,491 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 18:39:16,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 32 [2022-12-13 18:39:16,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-12-13 18:39:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 55 proven. 20 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-12-13 18:39:17,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:39:17,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 152 [2022-12-13 18:39:17,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 142 [2022-12-13 18:39:17,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 126 [2022-12-13 18:39:17,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 118 [2022-12-13 18:39:18,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053860230] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:39:18,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:39:18,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31] total 64 [2022-12-13 18:39:18,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871612627] [2022-12-13 18:39:18,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:39:18,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-12-13 18:39:18,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:39:18,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-12-13 18:39:18,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=4598, Unknown=8, NotChecked=0, Total=4970 [2022-12-13 18:39:18,160 INFO L87 Difference]: Start difference. First operand 34096 states and 49804 transitions. Second operand has 64 states, 60 states have (on average 3.433333333333333) internal successors, (206), 51 states have internal predecessors, (206), 23 states have call successors, (39), 10 states have call predecessors, (39), 21 states have return successors, (38), 24 states have call predecessors, (38), 22 states have call successors, (38) [2022-12-13 18:39:32,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 18:39:34,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 18:39:36,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:40:16,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:40:16,544 INFO L93 Difference]: Finished difference Result 87129 states and 133277 transitions. [2022-12-13 18:40:16,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-12-13 18:40:16,545 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 60 states have (on average 3.433333333333333) internal successors, (206), 51 states have internal predecessors, (206), 23 states have call successors, (39), 10 states have call predecessors, (39), 21 states have return successors, (38), 24 states have call predecessors, (38), 22 states have call successors, (38) Word has length 169 [2022-12-13 18:40:16,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:40:16,714 INFO L225 Difference]: With dead ends: 87129 [2022-12-13 18:40:16,714 INFO L226 Difference]: Without dead ends: 49082 [2022-12-13 18:40:16,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7792 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1859, Invalid=25171, Unknown=30, NotChecked=0, Total=27060 [2022-12-13 18:40:16,820 INFO L413 NwaCegarLoop]: 812 mSDtfsCounter, 2509 mSDsluCounter, 20278 mSDsCounter, 0 mSdLazyCounter, 24455 mSolverCounterSat, 1610 mSolverCounterUnsat, 976 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2640 SdHoareTripleChecker+Valid, 21090 SdHoareTripleChecker+Invalid, 27041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1610 IncrementalHoareTripleChecker+Valid, 24455 IncrementalHoareTripleChecker+Invalid, 976 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.7s IncrementalHoareTripleChecker+Time [2022-12-13 18:40:16,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2640 Valid, 21090 Invalid, 27041 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1610 Valid, 24455 Invalid, 976 Unknown, 0 Unchecked, 45.7s Time] [2022-12-13 18:40:16,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49082 states. [2022-12-13 18:40:20,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49082 to 38374. [2022-12-13 18:40:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38374 states, 29474 states have (on average 1.334701771052453) internal successors, (39339), 30107 states have internal predecessors, (39339), 5770 states have call successors, (5770), 1861 states have call predecessors, (5770), 3129 states have return successors, (11132), 6405 states have call predecessors, (11132), 5769 states have call successors, (11132) [2022-12-13 18:40:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38374 states to 38374 states and 56241 transitions. [2022-12-13 18:40:20,232 INFO L78 Accepts]: Start accepts. Automaton has 38374 states and 56241 transitions. Word has length 169 [2022-12-13 18:40:20,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:40:20,232 INFO L495 AbstractCegarLoop]: Abstraction has 38374 states and 56241 transitions. [2022-12-13 18:40:20,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 60 states have (on average 3.433333333333333) internal successors, (206), 51 states have internal predecessors, (206), 23 states have call successors, (39), 10 states have call predecessors, (39), 21 states have return successors, (38), 24 states have call predecessors, (38), 22 states have call successors, (38) [2022-12-13 18:40:20,232 INFO L276 IsEmpty]: Start isEmpty. Operand 38374 states and 56241 transitions. [2022-12-13 18:40:20,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-13 18:40:20,275 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:40:20,275 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 6, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:40:20,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 18:40:20,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 18:40:20,477 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:40:20,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:40:20,478 INFO L85 PathProgramCache]: Analyzing trace with hash -739409298, now seen corresponding path program 2 times [2022-12-13 18:40:20,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:40:20,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595107453] [2022-12-13 18:40:20,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:40:20,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:40:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:20,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:40:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:20,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:40:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:20,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 18:40:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:20,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 18:40:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:20,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 18:40:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:20,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 18:40:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:20,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 18:40:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:21,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:40:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:21,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 18:40:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:21,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 18:40:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:21,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:40:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:21,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 18:40:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:21,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:40:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:21,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:40:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:21,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:40:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:21,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 18:40:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:21,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 18:40:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:21,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 18:40:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:21,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 18:40:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:21,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 18:40:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:21,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:40:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-12-13 18:40:21,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:40:21,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595107453] [2022-12-13 18:40:21,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595107453] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:40:21,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825231242] [2022-12-13 18:40:21,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 18:40:21,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:40:21,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:40:21,282 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:40:21,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42e6e107-6597-4143-8e44-57c22993d2b0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 18:40:22,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 18:40:22,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:40:22,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 1622 conjuncts, 106 conjunts are in the unsatisfiable core [2022-12-13 18:40:22,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:40:23,002 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-13 18:40:23,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 30 [2022-12-13 18:40:23,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-13 18:40:23,433 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 18:40:23,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2022-12-13 18:40:23,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-13 18:40:24,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 18:40:24,619 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 18:40:24,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 18:40:24,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:40:24,791 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-13 18:40:24,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 36 [2022-12-13 18:40:24,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-12-13 18:40:24,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-12-13 18:40:24,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-12-13 18:40:24,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:40:25,087 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 18:40:25,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 31 [2022-12-13 18:40:25,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-12-13 18:40:25,672 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 18 proven. 43 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-12-13 18:40:25,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:40:25,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 327 treesize of output 309 [2022-12-13 18:40:25,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 286 [2022-12-13 18:40:25,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 254 [2022-12-13 18:40:25,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 246 [2022-12-13 18:40:26,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825231242] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:40:26,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:40:26,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 35] total 50 [2022-12-13 18:40:26,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265056601] [2022-12-13 18:40:26,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:40:26,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-13 18:40:26,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:40:26,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-13 18:40:26,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2378, Unknown=16, NotChecked=0, Total=2550 [2022-12-13 18:40:26,041 INFO L87 Difference]: Start difference. First operand 38374 states and 56241 transitions. Second operand has 50 states, 50 states have (on average 4.44) internal successors, (222), 40 states have internal predecessors, (222), 17 states have call successors, (42), 14 states have call predecessors, (42), 15 states have return successors, (41), 18 states have call predecessors, (41), 16 states have call successors, (41) [2022-12-13 18:40:27,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 18:40:30,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 18:40:32,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:40:36,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:40:38,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 18:40:44,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:40:50,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:40:53,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:40:55,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:40:57,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:40:59,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:07,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:12,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:14,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:16,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:18,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:20,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:22,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:26,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:28,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:30,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:32,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:34,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:36,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:41,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:43,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:45,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:47,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:49,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:51,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:53,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:55,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:57,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:41:59,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:42:01,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:42:03,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:42:05,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:42:07,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:42:10,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:42:12,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:42:14,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:42:16,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:42:18,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]