./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.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_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/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_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/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_62f50c98-fa4e-4eff-ae39-32c84810d179/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 07ae4eb392cc9822cbd398c1edf107cccc60d6668bc59dbf5a692a6b9350873b --- 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 21:03:58,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:03:58,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:03:58,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:03:58,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:03:58,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:03:58,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:03:58,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:03:58,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:03:58,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:03:58,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:03:58,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:03:58,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:03:58,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:03:58,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:03:58,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:03:58,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:03:58,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:03:58,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:03:58,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:03:58,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:03:58,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:03:58,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:03:58,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:03:58,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:03:58,906 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:03:58,906 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:03:58,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:03:58,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:03:58,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:03:58,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:03:58,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:03:58,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:03:58,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:03:58,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:03:58,912 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:03:58,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:03:58,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:03:58,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:03:58,914 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:03:58,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:03:58,915 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-12-13 21:03:58,935 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:03:58,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:03:58,936 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:03:58,936 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:03:58,936 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:03:58,949 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:03:58,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:03:58,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:03:58,951 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:03:58,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:03:58,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:03:58,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:03:58,952 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:03:58,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:03:58,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:03:58,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:03:58,953 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:03:58,953 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:03:58,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:03:58,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:03:58,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:03:58,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:03:58,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:03:58,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:03:58,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:03:58,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:03:58,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:03:58,955 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:03:58,955 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:03:58,955 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:03:58,955 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:03:58,956 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:03:58,956 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_62f50c98-fa4e-4eff-ae39-32c84810d179/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_62f50c98-fa4e-4eff-ae39-32c84810d179/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 -> 07ae4eb392cc9822cbd398c1edf107cccc60d6668bc59dbf5a692a6b9350873b [2022-12-13 21:03:59,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:03:59,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:03:59,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:03:59,154 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:03:59,154 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:03:59,155 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-12-13 21:04:01,807 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:04:02,045 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:04:02,046 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-12-13 21:04:02,060 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/data/aa64bf0c5/c7b80dcb574742c7bf83c57609c072df/FLAG678dde43c [2022-12-13 21:04:02,071 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/data/aa64bf0c5/c7b80dcb574742c7bf83c57609c072df [2022-12-13 21:04:02,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:04:02,074 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:04:02,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:04:02,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:04:02,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:04:02,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:04:02" (1/1) ... [2022-12-13 21:04:02,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46f3ddf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:04:02, skipping insertion in model container [2022-12-13 21:04:02,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:04:02" (1/1) ... [2022-12-13 21:04:02,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:04:02,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:04:02,449 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 21:04:02,450 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 21:04:02,478 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:04:02,520 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-12-13 21:04:02,522 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-12-13 21:04:02,530 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 21:04:02,532 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 21:04:02,534 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 21:04:02,547 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 21:04:02,553 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 21:04:02,557 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_coherent [2022-12-13 21:04:02,559 WARN L623 FunctionHandler]: Unknown extern function strlcpy [2022-12-13 21:04:02,560 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 21:04:02,560 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 21:04:02,561 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 21:04:02,563 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:04:02,563 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:04:02,564 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:04:02,565 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:04:02,565 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:04:02,565 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:04:02,567 WARN L623 FunctionHandler]: Unknown extern function input_register_device [2022-12-13 21:04:02,568 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 21:04:02,568 WARN L623 FunctionHandler]: Unknown extern function input_free_device [2022-12-13 21:04:02,568 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 21:04:02,571 WARN L623 FunctionHandler]: Unknown extern function input_unregister_device [2022-12-13 21:04:02,572 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 21:04:02,572 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 21:04:02,576 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 21:04:02,585 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-12-13 21:04:02,588 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-12-13 21:04:02,590 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-12-13 21:04:02,592 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_62f50c98-fa4e-4eff-ae39-32c84810d179/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2022-12-13 21:04:02,597 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:04:02,604 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:04:02,619 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:04:02,621 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:04:02,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:04:02,638 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:04:02,735 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 21:04:02,736 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 21:04:02,738 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:04:02,743 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-12-13 21:04:02,743 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-12-13 21:04:02,743 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 21:04:02,744 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 21:04:02,744 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 21:04:02,749 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 21:04:02,750 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 21:04:02,753 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_coherent [2022-12-13 21:04:02,754 WARN L623 FunctionHandler]: Unknown extern function strlcpy [2022-12-13 21:04:02,755 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 21:04:02,755 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 21:04:02,756 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 21:04:02,760 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:04:02,760 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:04:02,761 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:04:02,761 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:04:02,762 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:04:02,762 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:04:02,763 WARN L623 FunctionHandler]: Unknown extern function input_register_device [2022-12-13 21:04:02,764 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 21:04:02,764 WARN L623 FunctionHandler]: Unknown extern function input_free_device [2022-12-13 21:04:02,764 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 21:04:02,765 WARN L623 FunctionHandler]: Unknown extern function input_unregister_device [2022-12-13 21:04:02,766 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 21:04:02,766 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 21:04:02,767 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 21:04:02,769 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-12-13 21:04:02,771 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-12-13 21:04:02,773 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-12-13 21:04:02,774 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_62f50c98-fa4e-4eff-ae39-32c84810d179/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2022-12-13 21:04:02,775 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:04:02,778 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:04:02,781 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:04:02,783 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:04:02,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:04:02,803 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:04:02,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:04:02 WrapperNode [2022-12-13 21:04:02,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:04:02,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:04:02,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:04:02,805 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:04:02,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:04:02" (1/1) ... [2022-12-13 21:04:02,829 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:04:02" (1/1) ... [2022-12-13 21:04:02,861 INFO L138 Inliner]: procedures = 107, calls = 317, calls flagged for inlining = 47, calls inlined = 41, statements flattened = 790 [2022-12-13 21:04:02,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:04:02,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:04:02,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:04:02,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:04:02,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:04:02" (1/1) ... [2022-12-13 21:04:02,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:04:02" (1/1) ... [2022-12-13 21:04:02,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:04:02" (1/1) ... [2022-12-13 21:04:02,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:04:02" (1/1) ... [2022-12-13 21:04:02,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:04:02" (1/1) ... [2022-12-13 21:04:02,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:04:02" (1/1) ... [2022-12-13 21:04:02,897 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:04:02" (1/1) ... [2022-12-13 21:04:02,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:04:02" (1/1) ... [2022-12-13 21:04:02,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:04:02,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:04:02,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:04:02,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:04:02,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:04:02" (1/1) ... [2022-12-13 21:04:02,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:04:02,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:04:02,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:04:02,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:04:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-12-13 21:04:02,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-12-13 21:04:02,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 21:04:02,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-12-13 21:04:02,958 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-12-13 21:04:02,958 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-12-13 21:04:02,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-12-13 21:04:02,958 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-12-13 21:04:02,958 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-12-13 21:04:02,958 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-12-13 21:04:02,958 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-12-13 21:04:02,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 21:04:02,959 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-12-13 21:04:02,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-12-13 21:04:02,959 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-12-13 21:04:02,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-12-13 21:04:02,959 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-12-13 21:04:02,959 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-12-13 21:04:02,959 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-12-13 21:04:02,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-12-13 21:04:02,959 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 21:04:02,959 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 21:04:02,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 21:04:02,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:04:02,959 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-12-13 21:04:02,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-12-13 21:04:02,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 21:04:02,960 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-12-13 21:04:02,960 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-12-13 21:04:02,960 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-12-13 21:04:02,960 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-12-13 21:04:02,960 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-12-13 21:04:02,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-12-13 21:04:02,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 21:04:02,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 21:04:02,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 21:04:02,960 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-12-13 21:04:02,960 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-12-13 21:04:02,960 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-12-13 21:04:02,960 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-12-13 21:04:02,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:04:02,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:04:02,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:04:03,175 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:04:03,177 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:04:03,236 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-12-13 21:04:03,707 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:04:03,715 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:04:03,715 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 21:04:03,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:04:03 BoogieIcfgContainer [2022-12-13 21:04:03,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:04:03,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:04:03,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:04:03,723 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:04:03,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:04:02" (1/3) ... [2022-12-13 21:04:03,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d085b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:04:03, skipping insertion in model container [2022-12-13 21:04:03,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:04:02" (2/3) ... [2022-12-13 21:04:03,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d085b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:04:03, skipping insertion in model container [2022-12-13 21:04:03,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:04:03" (3/3) ... [2022-12-13 21:04:03,726 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-12-13 21:04:03,740 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:04:03,741 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 21:04:03,778 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:04:03,782 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;@532fca52, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:04:03,782 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 21:04:03,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 233 states, 173 states have (on average 1.323699421965318) internal successors, (229), 185 states have internal predecessors, (229), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-12-13 21:04:03,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 21:04:03,792 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:04:03,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:04:03,792 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:04:03,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:04:03,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1049381621, now seen corresponding path program 1 times [2022-12-13 21:04:03,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:04:03,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939553724] [2022-12-13 21:04:03,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:03,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:04:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:04,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:04,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:04,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:04:04,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:04:04,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939553724] [2022-12-13 21:04:04,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939553724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:04:04,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:04:04,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:04:04,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966759414] [2022-12-13 21:04:04,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:04:04,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:04:04,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:04:04,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:04:04,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:04:04,086 INFO L87 Difference]: Start difference. First operand has 233 states, 173 states have (on average 1.323699421965318) internal successors, (229), 185 states have internal predecessors, (229), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 21:04:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:04:04,445 INFO L93 Difference]: Finished difference Result 468 states and 638 transitions. [2022-12-13 21:04:04,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:04:04,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-12-13 21:04:04,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:04:04,455 INFO L225 Difference]: With dead ends: 468 [2022-12-13 21:04:04,455 INFO L226 Difference]: Without dead ends: 229 [2022-12-13 21:04:04,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:04:04,460 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 88 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:04:04,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 412 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:04:04,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-12-13 21:04:04,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 222. [2022-12-13 21:04:04,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 168 states have (on average 1.2916666666666667) internal successors, (217), 174 states have internal predecessors, (217), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-12-13 21:04:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 290 transitions. [2022-12-13 21:04:04,515 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 290 transitions. Word has length 32 [2022-12-13 21:04:04,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:04:04,515 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 290 transitions. [2022-12-13 21:04:04,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 21:04:04,516 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 290 transitions. [2022-12-13 21:04:04,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 21:04:04,517 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:04:04,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:04:04,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:04:04,517 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:04:04,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:04:04,518 INFO L85 PathProgramCache]: Analyzing trace with hash -626679795, now seen corresponding path program 1 times [2022-12-13 21:04:04,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:04:04,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174290517] [2022-12-13 21:04:04,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:04,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:04:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:04,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:04,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:04,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:04,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:04:04,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:04:04,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174290517] [2022-12-13 21:04:04,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174290517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:04:04,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:04:04,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:04:04,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860646191] [2022-12-13 21:04:04,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:04:04,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:04:04,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:04:04,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:04:04,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:04:04,638 INFO L87 Difference]: Start difference. First operand 222 states and 290 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 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 21:04:05,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:04:05,126 INFO L93 Difference]: Finished difference Result 644 states and 848 transitions. [2022-12-13 21:04:05,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:04:05,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 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 32 [2022-12-13 21:04:05,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:04:05,131 INFO L225 Difference]: With dead ends: 644 [2022-12-13 21:04:05,131 INFO L226 Difference]: Without dead ends: 427 [2022-12-13 21:04:05,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:04:05,134 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 385 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:04:05,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 614 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 21:04:05,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-12-13 21:04:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 413. [2022-12-13 21:04:05,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 313 states have (on average 1.2843450479233227) internal successors, (402), 321 states have internal predecessors, (402), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-12-13 21:04:05,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 539 transitions. [2022-12-13 21:04:05,182 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 539 transitions. Word has length 32 [2022-12-13 21:04:05,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:04:05,182 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 539 transitions. [2022-12-13 21:04:05,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 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 21:04:05,183 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 539 transitions. [2022-12-13 21:04:05,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 21:04:05,185 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:04:05,185 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 21:04:05,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:04:05,185 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:04:05,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:04:05,186 INFO L85 PathProgramCache]: Analyzing trace with hash -753559176, now seen corresponding path program 1 times [2022-12-13 21:04:05,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:04:05,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492375130] [2022-12-13 21:04:05,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:05,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:04:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:05,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:05,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:05,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:05,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 21:04:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:05,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:05,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:05,400 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 21:04:05,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:04:05,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492375130] [2022-12-13 21:04:05,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492375130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:04:05,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:04:05,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:04:05,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372130453] [2022-12-13 21:04:05,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:04:05,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:04:05,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:04:05,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:04:05,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:04:05,402 INFO L87 Difference]: Start difference. First operand 413 states and 539 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:04:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:04:06,082 INFO L93 Difference]: Finished difference Result 980 states and 1318 transitions. [2022-12-13 21:04:06,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 21:04:06,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-12-13 21:04:06,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:04:06,088 INFO L225 Difference]: With dead ends: 980 [2022-12-13 21:04:06,088 INFO L226 Difference]: Without dead ends: 582 [2022-12-13 21:04:06,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 21:04:06,090 INFO L413 NwaCegarLoop]: 408 mSDtfsCounter, 628 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 21:04:06,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1466 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 21:04:06,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-12-13 21:04:06,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 416. [2022-12-13 21:04:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 316 states have (on average 1.2784810126582278) internal successors, (404), 324 states have internal predecessors, (404), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-12-13 21:04:06,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 541 transitions. [2022-12-13 21:04:06,116 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 541 transitions. Word has length 55 [2022-12-13 21:04:06,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:04:06,116 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 541 transitions. [2022-12-13 21:04:06,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:04:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 541 transitions. [2022-12-13 21:04:06,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 21:04:06,118 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:04:06,118 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 21:04:06,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 21:04:06,118 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:04:06,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:04:06,118 INFO L85 PathProgramCache]: Analyzing trace with hash -16242504, now seen corresponding path program 1 times [2022-12-13 21:04:06,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:04:06,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221208570] [2022-12-13 21:04:06,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:06,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:04:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:06,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:06,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:06,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:06,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 21:04:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:06,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:06,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 21:04:06,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:04:06,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221208570] [2022-12-13 21:04:06,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221208570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:04:06,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:04:06,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:04:06,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251629008] [2022-12-13 21:04:06,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:04:06,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:04:06,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:04:06,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:04:06,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:04:06,306 INFO L87 Difference]: Start difference. First operand 416 states and 541 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 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 21:04:06,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:04:06,872 INFO L93 Difference]: Finished difference Result 1245 states and 1638 transitions. [2022-12-13 21:04:06,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:04:06,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 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 55 [2022-12-13 21:04:06,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:04:06,875 INFO L225 Difference]: With dead ends: 1245 [2022-12-13 21:04:06,875 INFO L226 Difference]: Without dead ends: 844 [2022-12-13 21:04:06,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:04:06,877 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 325 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 21:04:06,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 766 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 21:04:06,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2022-12-13 21:04:06,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 806. [2022-12-13 21:04:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 617 states have (on average 1.2755267423014587) internal successors, (787), 629 states have internal predecessors, (787), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-12-13 21:04:06,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1052 transitions. [2022-12-13 21:04:06,912 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1052 transitions. Word has length 55 [2022-12-13 21:04:06,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:04:06,912 INFO L495 AbstractCegarLoop]: Abstraction has 806 states and 1052 transitions. [2022-12-13 21:04:06,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 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 21:04:06,912 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1052 transitions. [2022-12-13 21:04:06,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 21:04:06,913 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:04:06,913 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 21:04:06,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 21:04:06,914 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:04:06,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:04:06,914 INFO L85 PathProgramCache]: Analyzing trace with hash -503512716, now seen corresponding path program 1 times [2022-12-13 21:04:06,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:04:06,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578070597] [2022-12-13 21:04:06,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:04:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:07,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:07,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:07,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:07,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 21:04:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:07,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:07,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 21:04:07,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:04:07,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578070597] [2022-12-13 21:04:07,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578070597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:04:07,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:04:07,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:04:07,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105589145] [2022-12-13 21:04:07,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:04:07,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:04:07,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:04:07,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:04:07,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:04:07,113 INFO L87 Difference]: Start difference. First operand 806 states and 1052 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 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 21:04:07,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:04:07,456 INFO L93 Difference]: Finished difference Result 836 states and 1097 transitions. [2022-12-13 21:04:07,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:04:07,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 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 56 [2022-12-13 21:04:07,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:04:07,462 INFO L225 Difference]: With dead ends: 836 [2022-12-13 21:04:07,462 INFO L226 Difference]: Without dead ends: 833 [2022-12-13 21:04:07,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:04:07,464 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 279 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:04:07,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 538 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:04:07,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2022-12-13 21:04:07,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 805. [2022-12-13 21:04:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 617 states have (on average 1.273905996758509) internal successors, (786), 628 states have internal predecessors, (786), 133 states have call successors, (133), 55 states have call predecessors, (133), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-12-13 21:04:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1050 transitions. [2022-12-13 21:04:07,501 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1050 transitions. Word has length 56 [2022-12-13 21:04:07,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:04:07,501 INFO L495 AbstractCegarLoop]: Abstraction has 805 states and 1050 transitions. [2022-12-13 21:04:07,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 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 21:04:07,501 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1050 transitions. [2022-12-13 21:04:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 21:04:07,502 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:04:07,502 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 21:04:07,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 21:04:07,502 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:04:07,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:04:07,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1570984763, now seen corresponding path program 1 times [2022-12-13 21:04:07,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:04:07,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518548232] [2022-12-13 21:04:07,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:07,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:04:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:07,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:07,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:07,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:07,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 21:04:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:07,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:07,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 21:04:07,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:04:07,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518548232] [2022-12-13 21:04:07,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518548232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:04:07,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:04:07,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:04:07,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962196700] [2022-12-13 21:04:07,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:04:07,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:04:07,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:04:07,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:04:07,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:04:07,599 INFO L87 Difference]: Start difference. First operand 805 states and 1050 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 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 21:04:07,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:04:07,941 INFO L93 Difference]: Finished difference Result 835 states and 1095 transitions. [2022-12-13 21:04:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:04:07,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 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 57 [2022-12-13 21:04:07,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:04:07,944 INFO L225 Difference]: With dead ends: 835 [2022-12-13 21:04:07,944 INFO L226 Difference]: Without dead ends: 832 [2022-12-13 21:04:07,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:04:07,945 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 276 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:04:07,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 534 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:04:07,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2022-12-13 21:04:07,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 804. [2022-12-13 21:04:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 617 states have (on average 1.2722852512155591) internal successors, (785), 627 states have internal predecessors, (785), 132 states have call successors, (132), 55 states have call predecessors, (132), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-12-13 21:04:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1048 transitions. [2022-12-13 21:04:07,981 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1048 transitions. Word has length 57 [2022-12-13 21:04:07,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:04:07,981 INFO L495 AbstractCegarLoop]: Abstraction has 804 states and 1048 transitions. [2022-12-13 21:04:07,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 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 21:04:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1048 transitions. [2022-12-13 21:04:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 21:04:07,982 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:04:07,982 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 21:04:07,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 21:04:07,983 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:04:07,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:04:07,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1455902039, now seen corresponding path program 1 times [2022-12-13 21:04:07,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:04:07,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983573046] [2022-12-13 21:04:07,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:07,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:04:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:08,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:08,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:08,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:08,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 21:04:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:08,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:08,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:08,067 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 21:04:08,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:04:08,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983573046] [2022-12-13 21:04:08,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983573046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:04:08,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:04:08,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:04:08,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753747191] [2022-12-13 21:04:08,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:04:08,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:04:08,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:04:08,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:04:08,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:04:08,068 INFO L87 Difference]: Start difference. First operand 804 states and 1048 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 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 21:04:08,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:04:08,408 INFO L93 Difference]: Finished difference Result 834 states and 1093 transitions. [2022-12-13 21:04:08,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:04:08,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 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 58 [2022-12-13 21:04:08,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:04:08,411 INFO L225 Difference]: With dead ends: 834 [2022-12-13 21:04:08,411 INFO L226 Difference]: Without dead ends: 831 [2022-12-13 21:04:08,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:04:08,412 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 273 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:04:08,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 530 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:04:08,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2022-12-13 21:04:08,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 803. [2022-12-13 21:04:08,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 617 states have (on average 1.2706645056726094) internal successors, (784), 626 states have internal predecessors, (784), 131 states have call successors, (131), 55 states have call predecessors, (131), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-12-13 21:04:08,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1046 transitions. [2022-12-13 21:04:08,448 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1046 transitions. Word has length 58 [2022-12-13 21:04:08,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:04:08,448 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1046 transitions. [2022-12-13 21:04:08,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 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 21:04:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1046 transitions. [2022-12-13 21:04:08,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 21:04:08,449 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:04:08,449 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 21:04:08,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 21:04:08,450 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:04:08,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:04:08,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2111657538, now seen corresponding path program 1 times [2022-12-13 21:04:08,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:04:08,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060994012] [2022-12-13 21:04:08,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:08,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:04:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:08,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:08,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:08,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:08,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 21:04:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:08,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:08,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 21:04:08,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:04:08,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060994012] [2022-12-13 21:04:08,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060994012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:04:08,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:04:08,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:04:08,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808455205] [2022-12-13 21:04:08,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:04:08,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:04:08,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:04:08,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:04:08,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:04:08,528 INFO L87 Difference]: Start difference. First operand 803 states and 1046 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 4 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 21:04:08,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:04:08,821 INFO L93 Difference]: Finished difference Result 833 states and 1091 transitions. [2022-12-13 21:04:08,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:04:08,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 4 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 59 [2022-12-13 21:04:08,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:04:08,825 INFO L225 Difference]: With dead ends: 833 [2022-12-13 21:04:08,825 INFO L226 Difference]: Without dead ends: 821 [2022-12-13 21:04:08,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:04:08,826 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 307 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:04:08,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 379 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:04:08,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2022-12-13 21:04:08,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 793. [2022-12-13 21:04:08,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 608 states have (on average 1.269736842105263) internal successors, (772), 616 states have internal predecessors, (772), 130 states have call successors, (130), 55 states have call predecessors, (130), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-12-13 21:04:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1033 transitions. [2022-12-13 21:04:08,893 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1033 transitions. Word has length 59 [2022-12-13 21:04:08,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:04:08,893 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1033 transitions. [2022-12-13 21:04:08,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 4 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 21:04:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1033 transitions. [2022-12-13 21:04:08,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 21:04:08,897 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:04:08,897 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:04:08,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 21:04:08,897 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:04:08,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:04:08,898 INFO L85 PathProgramCache]: Analyzing trace with hash 329455673, now seen corresponding path program 1 times [2022-12-13 21:04:08,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:04:08,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640717183] [2022-12-13 21:04:08,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:08,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:04:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:08,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:08,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:08,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 21:04:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 21:04:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 21:04:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-12-13 21:04:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 21:04:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 21:04:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 21:04:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 21:04:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 21:04:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-12-13 21:04:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-12-13 21:04:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-13 21:04:09,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:04:09,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640717183] [2022-12-13 21:04:09,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640717183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:04:09,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:04:09,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:04:09,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107230866] [2022-12-13 21:04:09,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:04:09,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:04:09,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:04:09,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:04:09,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:04:09,084 INFO L87 Difference]: Start difference. First operand 793 states and 1033 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 21:04:09,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:04:09,510 INFO L93 Difference]: Finished difference Result 1663 states and 2181 transitions. [2022-12-13 21:04:09,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 21:04:09,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 161 [2022-12-13 21:04:09,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:04:09,513 INFO L225 Difference]: With dead ends: 1663 [2022-12-13 21:04:09,513 INFO L226 Difference]: Without dead ends: 885 [2022-12-13 21:04:09,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:04:09,515 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 95 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:04:09,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1040 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:04:09,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2022-12-13 21:04:09,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 847. [2022-12-13 21:04:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 661 states have (on average 1.2798789712556733) internal successors, (846), 669 states have internal predecessors, (846), 130 states have call successors, (130), 56 states have call predecessors, (130), 55 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-12-13 21:04:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1107 transitions. [2022-12-13 21:04:09,554 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1107 transitions. Word has length 161 [2022-12-13 21:04:09,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:04:09,554 INFO L495 AbstractCegarLoop]: Abstraction has 847 states and 1107 transitions. [2022-12-13 21:04:09,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 21:04:09,554 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1107 transitions. [2022-12-13 21:04:09,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-13 21:04:09,556 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:04:09,556 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:04:09,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 21:04:09,557 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:04:09,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:04:09,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1393720528, now seen corresponding path program 1 times [2022-12-13 21:04:09,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:04:09,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362657709] [2022-12-13 21:04:09,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:09,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:04:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 21:04:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:04:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 21:04:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 21:04:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 21:04:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 21:04:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 21:04:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-12-13 21:04:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-12-13 21:04:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 21:04:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 21:04:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:09,768 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-12-13 21:04:09,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:04:09,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362657709] [2022-12-13 21:04:09,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362657709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:04:09,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:04:09,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 21:04:09,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859542495] [2022-12-13 21:04:09,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:04:09,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 21:04:09,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:04:09,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 21:04:09,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:04:09,771 INFO L87 Difference]: Start difference. First operand 847 states and 1107 transitions. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 21:04:10,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:04:10,180 INFO L93 Difference]: Finished difference Result 2277 states and 3066 transitions. [2022-12-13 21:04:10,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 21:04:10,181 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 170 [2022-12-13 21:04:10,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:04:10,187 INFO L225 Difference]: With dead ends: 2277 [2022-12-13 21:04:10,187 INFO L226 Difference]: Without dead ends: 1449 [2022-12-13 21:04:10,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-13 21:04:10,190 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 460 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:04:10,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1480 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:04:10,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2022-12-13 21:04:10,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 859. [2022-12-13 21:04:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 673 states have (on average 1.274888558692422) internal successors, (858), 681 states have internal predecessors, (858), 130 states have call successors, (130), 56 states have call predecessors, (130), 55 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-12-13 21:04:10,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1119 transitions. [2022-12-13 21:04:10,264 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1119 transitions. Word has length 170 [2022-12-13 21:04:10,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:04:10,265 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 1119 transitions. [2022-12-13 21:04:10,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 21:04:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1119 transitions. [2022-12-13 21:04:10,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-13 21:04:10,267 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:04:10,267 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:04:10,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 21:04:10,267 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:04:10,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:04:10,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1466012247, now seen corresponding path program 1 times [2022-12-13 21:04:10,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:04:10,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423341531] [2022-12-13 21:04:10,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:10,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:04:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:10,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:10,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:10,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:10,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 21:04:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:10,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:10,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:10,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:04:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:10,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:04:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:10,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 21:04:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:10,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 21:04:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:10,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:10,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 21:04:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:10,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:10,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-12-13 21:04:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:10,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-12-13 21:04:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:10,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-12-13 21:04:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:10,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 21:04:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:10,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-12-13 21:04:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:10,532 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-12-13 21:04:10,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:04:10,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423341531] [2022-12-13 21:04:10,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423341531] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:04:10,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875259466] [2022-12-13 21:04:10,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:10,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:04:10,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:04:10,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:04:10,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 21:04:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:10,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 1342 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 21:04:10,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:04:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-12-13 21:04:10,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:04:10,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875259466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:04:10,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:04:10,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-12-13 21:04:10,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786538216] [2022-12-13 21:04:10,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:04:10,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:04:10,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:04:10,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:04:10,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 21:04:10,907 INFO L87 Difference]: Start difference. First operand 859 states and 1119 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 21:04:11,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:04:11,139 INFO L93 Difference]: Finished difference Result 2785 states and 3660 transitions. [2022-12-13 21:04:11,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 21:04:11,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 172 [2022-12-13 21:04:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:04:11,144 INFO L225 Difference]: With dead ends: 2785 [2022-12-13 21:04:11,144 INFO L226 Difference]: Without dead ends: 1945 [2022-12-13 21:04:11,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-12-13 21:04:11,146 INFO L413 NwaCegarLoop]: 578 mSDtfsCounter, 393 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:04:11,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1859 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:04:11,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2022-12-13 21:04:11,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 895. [2022-12-13 21:04:11,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 701 states have (on average 1.2639087018544937) internal successors, (886), 709 states have internal predecessors, (886), 138 states have call successors, (138), 56 states have call predecessors, (138), 55 states have return successors, (139), 137 states have call predecessors, (139), 137 states have call successors, (139) [2022-12-13 21:04:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1163 transitions. [2022-12-13 21:04:11,209 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1163 transitions. Word has length 172 [2022-12-13 21:04:11,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:04:11,210 INFO L495 AbstractCegarLoop]: Abstraction has 895 states and 1163 transitions. [2022-12-13 21:04:11,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 21:04:11,210 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1163 transitions. [2022-12-13 21:04:11,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-13 21:04:11,212 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:04:11,212 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:04:11,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 21:04:11,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 21:04:11,413 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:04:11,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:04:11,414 INFO L85 PathProgramCache]: Analyzing trace with hash 454894997, now seen corresponding path program 1 times [2022-12-13 21:04:11,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:04:11,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642993970] [2022-12-13 21:04:11,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:11,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:04:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:11,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:11,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:11,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:11,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 21:04:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:11,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:11,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:12,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:04:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:12,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:04:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:12,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 21:04:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:12,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 21:04:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:12,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:12,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 21:04:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:12,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:12,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-12-13 21:04:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:12,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-12-13 21:04:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:12,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-12-13 21:04:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:12,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 21:04:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:12,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-12-13 21:04:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:12,081 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-13 21:04:12,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:04:12,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642993970] [2022-12-13 21:04:12,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642993970] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:04:12,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527184707] [2022-12-13 21:04:12,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:12,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:04:12,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:04:12,083 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:04:12,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 21:04:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:12,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-13 21:04:12,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:04:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-12-13 21:04:12,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:04:12,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527184707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:04:12,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:04:12,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2022-12-13 21:04:12,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031476859] [2022-12-13 21:04:12,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:04:12,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:04:12,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:04:12,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:04:12,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:04:12,383 INFO L87 Difference]: Start difference. First operand 895 states and 1163 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 21:04:12,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:04:12,493 INFO L93 Difference]: Finished difference Result 1787 states and 2335 transitions. [2022-12-13 21:04:12,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:04:12,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 172 [2022-12-13 21:04:12,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:04:12,496 INFO L225 Difference]: With dead ends: 1787 [2022-12-13 21:04:12,496 INFO L226 Difference]: Without dead ends: 903 [2022-12-13 21:04:12,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:04:12,498 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 0 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:04:12,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1098 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:04:12,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2022-12-13 21:04:12,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 903. [2022-12-13 21:04:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 705 states have (on average 1.2624113475177305) internal successors, (890), 717 states have internal predecessors, (890), 138 states have call successors, (138), 56 states have call predecessors, (138), 59 states have return successors, (151), 137 states have call predecessors, (151), 137 states have call successors, (151) [2022-12-13 21:04:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1179 transitions. [2022-12-13 21:04:12,568 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1179 transitions. Word has length 172 [2022-12-13 21:04:12,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:04:12,568 INFO L495 AbstractCegarLoop]: Abstraction has 903 states and 1179 transitions. [2022-12-13 21:04:12,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 21:04:12,568 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1179 transitions. [2022-12-13 21:04:12,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-12-13 21:04:12,570 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:04:12,570 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:04:12,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 21:04:12,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 21:04:12,772 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:04:12,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:04:12,773 INFO L85 PathProgramCache]: Analyzing trace with hash 654827607, now seen corresponding path program 1 times [2022-12-13 21:04:12,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:04:12,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409445783] [2022-12-13 21:04:12,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:12,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:04:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 21:04:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:04:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 21:04:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 21:04:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 21:04:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-12-13 21:04:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-12-13 21:04:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-12-13 21:04:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-12-13 21:04:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-12-13 21:04:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-12-13 21:04:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,594 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-13 21:04:13,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:04:13,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409445783] [2022-12-13 21:04:13,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409445783] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:04:13,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694468272] [2022-12-13 21:04:13,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:13,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:04:13,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:04:13,596 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:04:13,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 21:04:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:13,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 1363 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-13 21:04:13,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:04:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 33 proven. 7 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-13 21:04:13,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:04:14,255 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-13 21:04:14,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694468272] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:04:14,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:04:14,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 20 [2022-12-13 21:04:14,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285148789] [2022-12-13 21:04:14,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:04:14,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 21:04:14,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:04:14,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 21:04:14,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-12-13 21:04:14,258 INFO L87 Difference]: Start difference. First operand 903 states and 1179 transitions. Second operand has 20 states, 20 states have (on average 6.9) internal successors, (138), 12 states have internal predecessors, (138), 4 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) [2022-12-13 21:04:15,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:04:15,191 INFO L93 Difference]: Finished difference Result 2021 states and 2668 transitions. [2022-12-13 21:04:15,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 21:04:15,191 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.9) internal successors, (138), 12 states have internal predecessors, (138), 4 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) Word has length 178 [2022-12-13 21:04:15,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:04:15,194 INFO L225 Difference]: With dead ends: 2021 [2022-12-13 21:04:15,194 INFO L226 Difference]: Without dead ends: 1137 [2022-12-13 21:04:15,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 382 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-12-13 21:04:15,196 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 190 mSDsluCounter, 3222 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 3504 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 21:04:15,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 3504 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 21:04:15,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2022-12-13 21:04:15,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 943. [2022-12-13 21:04:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 737 states have (on average 1.2510176390773406) internal successors, (922), 745 states have internal predecessors, (922), 142 states have call successors, (142), 56 states have call predecessors, (142), 63 states have return successors, (167), 149 states have call predecessors, (167), 141 states have call successors, (167) [2022-12-13 21:04:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1231 transitions. [2022-12-13 21:04:15,275 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1231 transitions. Word has length 178 [2022-12-13 21:04:15,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:04:15,275 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1231 transitions. [2022-12-13 21:04:15,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.9) internal successors, (138), 12 states have internal predecessors, (138), 4 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) [2022-12-13 21:04:15,276 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1231 transitions. [2022-12-13 21:04:15,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-12-13 21:04:15,278 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:04:15,278 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:04:15,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 21:04:15,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:04:15,478 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:04:15,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:04:15,479 INFO L85 PathProgramCache]: Analyzing trace with hash 484979925, now seen corresponding path program 2 times [2022-12-13 21:04:15,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:04:15,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793643176] [2022-12-13 21:04:15,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:15,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:04:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:15,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:15,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:15,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:15,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 21:04:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:15,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:15,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:15,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:04:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:16,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:16,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 21:04:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:16,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 21:04:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:16,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 21:04:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:16,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:16,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:16,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 21:04:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:16,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:16,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-12-13 21:04:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:16,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-12-13 21:04:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:16,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 21:04:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:16,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-12-13 21:04:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:16,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-12-13 21:04:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:16,167 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-12-13 21:04:16,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:04:16,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793643176] [2022-12-13 21:04:16,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793643176] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:04:16,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414456873] [2022-12-13 21:04:16,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 21:04:16,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:04:16,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:04:16,169 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:04:16,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 21:04:16,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 21:04:16,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:04:16,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 21:04:16,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:04:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-12-13 21:04:16,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:04:16,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414456873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:04:16,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:04:16,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2022-12-13 21:04:16,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272764438] [2022-12-13 21:04:16,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:04:16,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:04:16,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:04:16,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:04:16,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-12-13 21:04:16,502 INFO L87 Difference]: Start difference. First operand 943 states and 1231 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 21:04:16,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:04:16,927 INFO L93 Difference]: Finished difference Result 2057 states and 2722 transitions. [2022-12-13 21:04:16,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:04:16,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 184 [2022-12-13 21:04:16,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:04:16,933 INFO L225 Difference]: With dead ends: 2057 [2022-12-13 21:04:16,933 INFO L226 Difference]: Without dead ends: 1133 [2022-12-13 21:04:16,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-12-13 21:04:16,935 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 723 mSDsluCounter, 1615 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 2133 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:04:16,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 2133 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:04:16,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2022-12-13 21:04:17,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 937. [2022-12-13 21:04:17,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 733 states have (on average 1.2496589358799455) internal successors, (916), 741 states have internal predecessors, (916), 140 states have call successors, (140), 56 states have call predecessors, (140), 63 states have return successors, (165), 147 states have call predecessors, (165), 139 states have call successors, (165) [2022-12-13 21:04:17,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1221 transitions. [2022-12-13 21:04:17,020 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1221 transitions. Word has length 184 [2022-12-13 21:04:17,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:04:17,021 INFO L495 AbstractCegarLoop]: Abstraction has 937 states and 1221 transitions. [2022-12-13 21:04:17,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 21:04:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1221 transitions. [2022-12-13 21:04:17,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-12-13 21:04:17,023 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:04:17,023 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:04:17,030 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 21:04:17,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:04:17,224 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:04:17,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:04:17,224 INFO L85 PathProgramCache]: Analyzing trace with hash -880447738, now seen corresponding path program 1 times [2022-12-13 21:04:17,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:04:17,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993051328] [2022-12-13 21:04:17,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:17,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:04:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 21:04:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:04:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 21:04:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 21:04:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 21:04:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 21:04:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-12-13 21:04:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 21:04:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-12-13 21:04:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-12-13 21:04:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-12-13 21:04:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-12-13 21:04:17,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:04:17,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993051328] [2022-12-13 21:04:17,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993051328] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:04:17,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444790710] [2022-12-13 21:04:17,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:17,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:04:17,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:04:17,524 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:04:17,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 21:04:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:17,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 1833 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:04:17,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:04:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-13 21:04:18,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:04:18,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444790710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:04:18,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:04:18,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-12-13 21:04:18,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057990097] [2022-12-13 21:04:18,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:04:18,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:04:18,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:04:18,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:04:18,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:04:18,064 INFO L87 Difference]: Start difference. First operand 937 states and 1221 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-12-13 21:04:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:04:18,450 INFO L93 Difference]: Finished difference Result 2775 states and 3626 transitions. [2022-12-13 21:04:18,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:04:18,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 206 [2022-12-13 21:04:18,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:04:18,458 INFO L225 Difference]: With dead ends: 2775 [2022-12-13 21:04:18,458 INFO L226 Difference]: Without dead ends: 2767 [2022-12-13 21:04:18,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:04:18,459 INFO L413 NwaCegarLoop]: 570 mSDtfsCounter, 398 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:04:18,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1071 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:04:18,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2767 states. [2022-12-13 21:04:18,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2767 to 2753. [2022-12-13 21:04:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2753 states, 2157 states have (on average 1.253592953175707) internal successors, (2704), 2185 states have internal predecessors, (2704), 412 states have call successors, (412), 160 states have call predecessors, (412), 183 states have return successors, (489), 431 states have call predecessors, (489), 411 states have call successors, (489) [2022-12-13 21:04:18,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 3605 transitions. [2022-12-13 21:04:18,724 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 3605 transitions. Word has length 206 [2022-12-13 21:04:18,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:04:18,724 INFO L495 AbstractCegarLoop]: Abstraction has 2753 states and 3605 transitions. [2022-12-13 21:04:18,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-12-13 21:04:18,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 3605 transitions. [2022-12-13 21:04:18,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-12-13 21:04:18,729 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:04:18,730 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:04:18,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 21:04:18,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 21:04:18,930 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:04:18,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:04:18,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1891564988, now seen corresponding path program 1 times [2022-12-13 21:04:18,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:04:18,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126542532] [2022-12-13 21:04:18,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:18,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:04:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 21:04:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:04:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 21:04:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 21:04:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 21:04:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 21:04:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-12-13 21:04:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 21:04:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-12-13 21:04:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-12-13 21:04:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-12-13 21:04:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-12-13 21:04:19,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:04:19,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126542532] [2022-12-13 21:04:19,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126542532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:04:19,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:04:19,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 21:04:19,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546164625] [2022-12-13 21:04:19,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:04:19,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:04:19,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:04:19,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:04:19,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:04:19,154 INFO L87 Difference]: Start difference. First operand 2753 states and 3605 transitions. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-12-13 21:04:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:04:20,497 INFO L93 Difference]: Finished difference Result 8727 states and 11506 transitions. [2022-12-13 21:04:20,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 21:04:20,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 206 [2022-12-13 21:04:20,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:04:20,510 INFO L225 Difference]: With dead ends: 8727 [2022-12-13 21:04:20,510 INFO L226 Difference]: Without dead ends: 5993 [2022-12-13 21:04:20,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-12-13 21:04:20,514 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 627 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 21:04:20,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1274 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 21:04:20,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2022-12-13 21:04:20,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 2765. [2022-12-13 21:04:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2765 states, 2169 states have (on average 1.252189949285385) internal successors, (2716), 2201 states have internal predecessors, (2716), 412 states have call successors, (412), 160 states have call predecessors, (412), 183 states have return successors, (489), 427 states have call predecessors, (489), 411 states have call successors, (489) [2022-12-13 21:04:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 2765 states and 3617 transitions. [2022-12-13 21:04:20,825 INFO L78 Accepts]: Start accepts. Automaton has 2765 states and 3617 transitions. Word has length 206 [2022-12-13 21:04:20,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:04:20,826 INFO L495 AbstractCegarLoop]: Abstraction has 2765 states and 3617 transitions. [2022-12-13 21:04:20,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-12-13 21:04:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2765 states and 3617 transitions. [2022-12-13 21:04:20,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-13 21:04:20,829 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:04:20,829 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:04:20,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 21:04:20,829 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:04:20,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:04:20,830 INFO L85 PathProgramCache]: Analyzing trace with hash -631683654, now seen corresponding path program 1 times [2022-12-13 21:04:20,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:04:20,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755985427] [2022-12-13 21:04:20,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:20,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:04:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 21:04:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:04:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 21:04:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 21:04:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 21:04:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 21:04:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-12-13 21:04:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-12-13 21:04:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 21:04:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-12-13 21:04:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-12-13 21:04:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-12-13 21:04:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-12-13 21:04:21,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:04:21,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755985427] [2022-12-13 21:04:21,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755985427] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:04:21,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160596122] [2022-12-13 21:04:21,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:21,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:04:21,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:04:21,645 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:04:21,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 21:04:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:22,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 1821 conjuncts, 112 conjunts are in the unsatisfiable core [2022-12-13 21:04:22,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:04:22,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21:04:22,155 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 7 treesize of output 6 [2022-12-13 21:04:22,569 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 21:04:22,575 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1069 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1069) |c_#memory_int|)) is different from true [2022-12-13 21:04:22,633 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 21:04:22,635 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 21:04:22,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:04:22,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 21:04:22,681 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 21:04:22,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 21:04:22,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 21:04:22,886 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 21:04:22,965 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 21:04:22,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 21:04:23,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 21:04:23,646 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 21:04:23,647 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 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 21:04:24,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 21:04:24,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 21:04:24,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 21:04:24,591 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 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 21:04:24,599 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 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 21:04:24,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:04:24,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-12-13 21:04:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 48 refuted. 10 times theorem prover too weak. 19 trivial. 2 not checked. [2022-12-13 21:04:24,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:04:26,661 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1079 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1079) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-12-13 21:04:26,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160596122] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:04:26,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:04:26,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 39] total 50 [2022-12-13 21:04:26,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825067635] [2022-12-13 21:04:26,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:04:26,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-13 21:04:26,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:04:26,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-13 21:04:26,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2174, Unknown=28, NotChecked=190, Total=2550 [2022-12-13 21:04:26,678 INFO L87 Difference]: Start difference. First operand 2765 states and 3617 transitions. Second operand has 50 states, 47 states have (on average 5.446808510638298) internal successors, (256), 36 states have internal predecessors, (256), 15 states have call successors, (39), 11 states have call predecessors, (39), 15 states have return successors, (39), 18 states have call predecessors, (39), 15 states have call successors, (39) [2022-12-13 21:04:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:04:40,874 INFO L93 Difference]: Finished difference Result 18117 states and 24818 transitions. [2022-12-13 21:04:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-12-13 21:04:40,874 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 5.446808510638298) internal successors, (256), 36 states have internal predecessors, (256), 15 states have call successors, (39), 11 states have call predecessors, (39), 15 states have return successors, (39), 18 states have call predecessors, (39), 15 states have call successors, (39) Word has length 207 [2022-12-13 21:04:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:04:40,908 INFO L225 Difference]: With dead ends: 18117 [2022-12-13 21:04:40,909 INFO L226 Difference]: Without dead ends: 15323 [2022-12-13 21:04:40,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 257 SyntacticMatches, 16 SemanticMatches, 123 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4380 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1133, Invalid=13829, Unknown=52, NotChecked=486, Total=15500 [2022-12-13 21:04:40,917 INFO L413 NwaCegarLoop]: 789 mSDtfsCounter, 2172 mSDsluCounter, 21627 mSDsCounter, 0 mSdLazyCounter, 12411 mSolverCounterSat, 937 mSolverCounterUnsat, 170 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2200 SdHoareTripleChecker+Valid, 22416 SdHoareTripleChecker+Invalid, 14946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 937 IncrementalHoareTripleChecker+Valid, 12411 IncrementalHoareTripleChecker+Invalid, 170 IncrementalHoareTripleChecker+Unknown, 1428 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-12-13 21:04:40,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2200 Valid, 22416 Invalid, 14946 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [937 Valid, 12411 Invalid, 170 Unknown, 1428 Unchecked, 9.7s Time] [2022-12-13 21:04:40,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15323 states. [2022-12-13 21:04:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15323 to 6495. [2022-12-13 21:04:41,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6495 states, 5182 states have (on average 1.2699729834040911) internal successors, (6581), 5320 states have internal predecessors, (6581), 881 states have call successors, (881), 400 states have call predecessors, (881), 431 states have return successors, (1100), 850 states have call predecessors, (1100), 880 states have call successors, (1100) [2022-12-13 21:04:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6495 states to 6495 states and 8562 transitions. [2022-12-13 21:04:41,799 INFO L78 Accepts]: Start accepts. Automaton has 6495 states and 8562 transitions. Word has length 207 [2022-12-13 21:04:41,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:04:41,799 INFO L495 AbstractCegarLoop]: Abstraction has 6495 states and 8562 transitions. [2022-12-13 21:04:41,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 5.446808510638298) internal successors, (256), 36 states have internal predecessors, (256), 15 states have call successors, (39), 11 states have call predecessors, (39), 15 states have return successors, (39), 18 states have call predecessors, (39), 15 states have call successors, (39) [2022-12-13 21:04:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 6495 states and 8562 transitions. [2022-12-13 21:04:41,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-12-13 21:04:41,803 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:04:41,803 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:04:41,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 21:04:42,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 21:04:42,004 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:04:42,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:04:42,005 INFO L85 PathProgramCache]: Analyzing trace with hash -2060299976, now seen corresponding path program 2 times [2022-12-13 21:04:42,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:04:42,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859657313] [2022-12-13 21:04:42,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:04:42,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:04:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 21:04:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:04:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:04:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 21:04:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 21:04:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 21:04:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 21:04:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:04:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:04:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-12-13 21:04:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 21:04:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-12-13 21:04:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-12-13 21:04:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-12-13 21:04:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-12-13 21:04:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:04:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-12-13 21:04:42,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:04:42,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859657313] [2022-12-13 21:04:42,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859657313] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:04:42,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889318447] [2022-12-13 21:04:42,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 21:04:42,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:04:42,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:04:42,768 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:04:42,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 21:06:30,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 21:06:30,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:06:31,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 1847 conjuncts, 191 conjunts are in the unsatisfiable core [2022-12-13 21:06:31,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:06:31,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21:06:31,064 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 7 treesize of output 6 [2022-12-13 21:06:31,254 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1365 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1365) |c_#memory_int|)) is different from true [2022-12-13 21:06:31,300 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 21:06:31,334 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 21:06:31,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 21:06:31,338 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 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 21:06:31,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21:06:32,366 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 21:06:32,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 21:06:32,626 INFO L321 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-12-13 21:06:32,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 32 [2022-12-13 21:06:32,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2022-12-13 21:06:33,156 INFO L321 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-12-13 21:06:33,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 [2022-12-13 21:06:33,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2022-12-13 21:06:33,356 INFO L321 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2022-12-13 21:06:33,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2022-12-13 21:06:33,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 19 [2022-12-13 21:06:34,567 INFO L321 Elim1Store]: treesize reduction 36, result has 33.3 percent of original size [2022-12-13 21:06:34,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 86 [2022-12-13 21:06:34,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:06:34,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:06:34,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:06:34,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:06:34,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:06:34,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:06:34,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:06:34,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:06:34,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:06:34,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2022-12-13 21:06:35,481 INFO L321 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-12-13 21:06:35,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 90 treesize of output 100 [2022-12-13 21:06:35,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2022-12-13 21:06:36,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 21:06:36,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 97 [2022-12-13 21:06:36,283 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 38 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 2 not checked. [2022-12-13 21:06:36,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:06:39,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889318447] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:06:39,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:06:39,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 49] total 56 [2022-12-13 21:06:39,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552095009] [2022-12-13 21:06:39,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:06:39,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-12-13 21:06:39,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:06:39,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-12-13 21:06:39,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=3011, Unknown=2, NotChecked=112, Total=3422 [2022-12-13 21:06:39,616 INFO L87 Difference]: Start difference. First operand 6495 states and 8562 transitions. Second operand has 56 states, 53 states have (on average 4.886792452830188) internal successors, (259), 41 states have internal predecessors, (259), 16 states have call successors, (40), 14 states have call predecessors, (40), 16 states have return successors, (39), 20 states have call predecessors, (39), 16 states have call successors, (39) [2022-12-13 21:07:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:07:09,958 INFO L93 Difference]: Finished difference Result 28414 states and 38727 transitions. [2022-12-13 21:07:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-12-13 21:07:09,959 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 53 states have (on average 4.886792452830188) internal successors, (259), 41 states have internal predecessors, (259), 16 states have call successors, (40), 14 states have call predecessors, (40), 16 states have return successors, (39), 20 states have call predecessors, (39), 16 states have call successors, (39) Word has length 213 [2022-12-13 21:07:09,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:07:09,998 INFO L225 Difference]: With dead ends: 28414 [2022-12-13 21:07:09,998 INFO L226 Difference]: Without dead ends: 22112 [2022-12-13 21:07:10,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 272 SyntacticMatches, 16 SemanticMatches, 153 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7773 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=1995, Invalid=21563, Unknown=8, NotChecked=304, Total=23870 [2022-12-13 21:07:10,011 INFO L413 NwaCegarLoop]: 718 mSDtfsCounter, 3399 mSDsluCounter, 21215 mSDsCounter, 0 mSdLazyCounter, 16037 mSolverCounterSat, 1393 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3439 SdHoareTripleChecker+Valid, 21933 SdHoareTripleChecker+Invalid, 18892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1393 IncrementalHoareTripleChecker+Valid, 16037 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 1456 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:07:10,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3439 Valid, 21933 Invalid, 18892 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1393 Valid, 16037 Invalid, 6 Unknown, 1456 Unchecked, 20.1s Time] [2022-12-13 21:07:10,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22112 states. [2022-12-13 21:07:11,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22112 to 9266. [2022-12-13 21:07:11,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9266 states, 7442 states have (on average 1.2704918032786885) internal successors, (9455), 7620 states have internal predecessors, (9455), 1234 states have call successors, (1234), 546 states have call predecessors, (1234), 589 states have return successors, (1537), 1211 states have call predecessors, (1537), 1233 states have call successors, (1537) [2022-12-13 21:07:11,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9266 states to 9266 states and 12226 transitions. [2022-12-13 21:07:11,518 INFO L78 Accepts]: Start accepts. Automaton has 9266 states and 12226 transitions. Word has length 213 [2022-12-13 21:07:11,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:07:11,519 INFO L495 AbstractCegarLoop]: Abstraction has 9266 states and 12226 transitions. [2022-12-13 21:07:11,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 53 states have (on average 4.886792452830188) internal successors, (259), 41 states have internal predecessors, (259), 16 states have call successors, (40), 14 states have call predecessors, (40), 16 states have return successors, (39), 20 states have call predecessors, (39), 16 states have call successors, (39) [2022-12-13 21:07:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 9266 states and 12226 transitions. [2022-12-13 21:07:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-12-13 21:07:11,525 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:07:11,525 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:11,546 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 21:07:11,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 21:07:11,727 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:07:11,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:07:11,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1868959840, now seen corresponding path program 1 times [2022-12-13 21:07:11,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:07:11,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818897916] [2022-12-13 21:07:11,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:07:11,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:07:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:07:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:07:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:07:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 21:07:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:07:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:07:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:07:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:07:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 21:07:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 21:07:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 21:07:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:07:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:07:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 21:07:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:07:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:07:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-12-13 21:07:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:07:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-12-13 21:07:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-12-13 21:07:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-12-13 21:07:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-12-13 21:07:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-12-13 21:07:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-12-13 21:07:12,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:07:12,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818897916] [2022-12-13 21:07:12,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818897916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:07:12,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:07:12,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 21:07:12,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325722926] [2022-12-13 21:07:12,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:07:12,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 21:07:12,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:07:12,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 21:07:12,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:07:12,199 INFO L87 Difference]: Start difference. First operand 9266 states and 12226 transitions. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 4 states have internal predecessors, (131), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-12-13 21:07:14,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:07:14,897 INFO L93 Difference]: Finished difference Result 20714 states and 28215 transitions. [2022-12-13 21:07:14,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 21:07:14,898 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 4 states have internal predecessors, (131), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 220 [2022-12-13 21:07:14,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:07:14,922 INFO L225 Difference]: With dead ends: 20714 [2022-12-13 21:07:14,922 INFO L226 Difference]: Without dead ends: 14364 [2022-12-13 21:07:14,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:07:14,931 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 316 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 21:07:14,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1687 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 21:07:14,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14364 states. [2022-12-13 21:07:16,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14364 to 9374. [2022-12-13 21:07:16,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9374 states, 7526 states have (on average 1.2701302152537868) internal successors, (9559), 7688 states have internal predecessors, (9559), 1254 states have call successors, (1254), 546 states have call predecessors, (1254), 593 states have return successors, (1561), 1251 states have call predecessors, (1561), 1253 states have call successors, (1561) [2022-12-13 21:07:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9374 states to 9374 states and 12374 transitions. [2022-12-13 21:07:16,483 INFO L78 Accepts]: Start accepts. Automaton has 9374 states and 12374 transitions. Word has length 220 [2022-12-13 21:07:16,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:07:16,484 INFO L495 AbstractCegarLoop]: Abstraction has 9374 states and 12374 transitions. [2022-12-13 21:07:16,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 4 states have internal predecessors, (131), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-12-13 21:07:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 9374 states and 12374 transitions. [2022-12-13 21:07:16,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-12-13 21:07:16,493 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:07:16,493 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:16,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 21:07:16,494 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:07:16,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:07:16,494 INFO L85 PathProgramCache]: Analyzing trace with hash -754904034, now seen corresponding path program 1 times [2022-12-13 21:07:16,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:07:16,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834506159] [2022-12-13 21:07:16,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:07:16,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:07:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:18,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:07:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:18,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:07:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:18,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:07:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:18,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 21:07:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:18,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:07:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:18,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:07:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:18,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:07:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:19,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:07:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:19,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 21:07:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:19,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 21:07:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:19,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 21:07:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:19,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:07:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:19,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:07:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:19,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 21:07:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:19,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:07:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:19,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:07:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:19,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-12-13 21:07:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:19,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:07:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:19,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-12-13 21:07:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:19,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:07:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:19,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-12-13 21:07:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:19,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-12-13 21:07:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:19,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-12-13 21:07:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:19,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-12-13 21:07:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 11 proven. 54 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-12-13 21:07:19,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:07:19,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834506159] [2022-12-13 21:07:19,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834506159] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:07:19,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827438442] [2022-12-13 21:07:19,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:07:19,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:07:19,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:07:19,589 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:07:19,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 21:07:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:07:19,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 1914 conjuncts, 151 conjunts are in the unsatisfiable core [2022-12-13 21:07:20,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:07:20,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21:07:20,037 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 7 treesize of output 6 [2022-12-13 21:07:20,315 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 14 treesize of output 3 [2022-12-13 21:07:20,319 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1862 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1862))) is different from true [2022-12-13 21:07:20,423 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 21:07:20,425 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 14 treesize of output 3 [2022-12-13 21:07:20,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:07:20,447 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 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 21:07:20,459 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-12-13 21:07:20,460 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 19 treesize of output 16 [2022-12-13 21:07:20,528 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 21:07:20,650 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 21:07:20,863 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 21:07:20,864 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 17 treesize of output 21 [2022-12-13 21:07:21,474 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 11 treesize of output 7 [2022-12-13 21:07:21,605 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 21:07:22,019 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 21:07:22,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-12-13 21:07:22,182 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 11 treesize of output 7 [2022-12-13 21:07:22,600 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-13 21:07:22,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 21:07:22,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 21:07:23,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 21:07:23,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 21:07:23,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 21:07:23,544 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 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 21:07:23,586 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 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 21:07:23,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:07:23,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-12-13 21:07:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 28 proven. 101 refuted. 0 times theorem prover too weak. 43 trivial. 2 not checked. [2022-12-13 21:07:23,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:07:23,614 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1876 (Array Int Int)) (|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1876) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-12-13 21:07:23,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827438442] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:07:23,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:07:23,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 50] total 80 [2022-12-13 21:07:23,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842270246] [2022-12-13 21:07:23,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:07:23,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-12-13 21:07:23,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:07:23,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-12-13 21:07:23,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=5770, Unknown=13, NotChecked=310, Total=6480 [2022-12-13 21:07:23,631 INFO L87 Difference]: Start difference. First operand 9374 states and 12374 transitions. Second operand has 80 states, 75 states have (on average 3.6133333333333333) internal successors, (271), 63 states have internal predecessors, (271), 27 states have call successors, (44), 13 states have call predecessors, (44), 23 states have return successors, (45), 32 states have call predecessors, (45), 27 states have call successors, (45) [2022-12-13 21:07:46,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:07:46,338 INFO L93 Difference]: Finished difference Result 22541 states and 30106 transitions. [2022-12-13 21:07:46,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-12-13 21:07:46,339 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 75 states have (on average 3.6133333333333333) internal successors, (271), 63 states have internal predecessors, (271), 27 states have call successors, (44), 13 states have call predecessors, (44), 23 states have return successors, (45), 32 states have call predecessors, (45), 27 states have call successors, (45) Word has length 226 [2022-12-13 21:07:46,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:07:46,363 INFO L225 Difference]: With dead ends: 22541 [2022-12-13 21:07:46,363 INFO L226 Difference]: Without dead ends: 16211 [2022-12-13 21:07:46,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 266 SyntacticMatches, 17 SemanticMatches, 176 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 10722 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=2488, Invalid=28286, Unknown=34, NotChecked=698, Total=31506 [2022-12-13 21:07:46,376 INFO L413 NwaCegarLoop]: 582 mSDtfsCounter, 2892 mSDsluCounter, 18291 mSDsCounter, 0 mSdLazyCounter, 15844 mSolverCounterSat, 1346 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2921 SdHoareTripleChecker+Valid, 18873 SdHoareTripleChecker+Invalid, 18048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1346 IncrementalHoareTripleChecker+Valid, 15844 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 822 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2022-12-13 21:07:46,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2921 Valid, 18873 Invalid, 18048 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1346 Valid, 15844 Invalid, 36 Unknown, 822 Unchecked, 13.5s Time] [2022-12-13 21:07:46,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16211 states. [2022-12-13 21:07:48,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16211 to 10971. [2022-12-13 21:07:48,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10971 states, 8939 states have (on average 1.2781071708244771) internal successors, (11425), 9101 states have internal predecessors, (11425), 1370 states have call successors, (1370), 628 states have call predecessors, (1370), 661 states have return successors, (1679), 1353 states have call predecessors, (1679), 1369 states have call successors, (1679) [2022-12-13 21:07:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10971 states to 10971 states and 14474 transitions. [2022-12-13 21:07:48,225 INFO L78 Accepts]: Start accepts. Automaton has 10971 states and 14474 transitions. Word has length 226 [2022-12-13 21:07:48,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:07:48,225 INFO L495 AbstractCegarLoop]: Abstraction has 10971 states and 14474 transitions. [2022-12-13 21:07:48,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 75 states have (on average 3.6133333333333333) internal successors, (271), 63 states have internal predecessors, (271), 27 states have call successors, (44), 13 states have call predecessors, (44), 23 states have return successors, (45), 32 states have call predecessors, (45), 27 states have call successors, (45) [2022-12-13 21:07:48,226 INFO L276 IsEmpty]: Start isEmpty. Operand 10971 states and 14474 transitions. [2022-12-13 21:07:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-12-13 21:07:48,233 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:07:48,233 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:48,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 21:07:48,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:07:48,434 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:07:48,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:07:48,434 INFO L85 PathProgramCache]: Analyzing trace with hash -664133389, now seen corresponding path program 1 times [2022-12-13 21:07:48,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:07:48,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839632984] [2022-12-13 21:07:48,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:07:48,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:07:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:07:49,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:07:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:07:49,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:07:49,573 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 21:07:49,574 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 21:07:49,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 21:07:49,577 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:07:49,580 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 21:07:49,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:07:49 BoogieIcfgContainer [2022-12-13 21:07:49,750 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 21:07:49,750 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:07:49,750 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:07:49,750 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:07:49,750 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:04:03" (3/4) ... [2022-12-13 21:07:49,753 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 21:07:49,753 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:07:49,753 INFO L158 Benchmark]: Toolchain (without parser) took 227679.13ms. Allocated memory was 192.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 154.1MB in the beginning and 365.6MB in the end (delta: -211.5MB). Peak memory consumption was 914.6MB. Max. memory is 16.1GB. [2022-12-13 21:07:49,753 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 123.7MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:07:49,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 729.14ms. Allocated memory is still 192.9MB. Free memory was 153.6MB in the beginning and 140.5MB in the end (delta: 13.0MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. [2022-12-13 21:07:49,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.43ms. Allocated memory is still 192.9MB. Free memory was 140.5MB in the beginning and 134.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 21:07:49,754 INFO L158 Benchmark]: Boogie Preprocessor took 43.32ms. Allocated memory is still 192.9MB. Free memory was 134.2MB in the beginning and 127.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 21:07:49,754 INFO L158 Benchmark]: RCFGBuilder took 812.61ms. Allocated memory is still 192.9MB. Free memory was 127.9MB in the beginning and 128.5MB in the end (delta: -517.9kB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. [2022-12-13 21:07:49,754 INFO L158 Benchmark]: TraceAbstraction took 226029.76ms. Allocated memory was 192.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 128.5MB in the beginning and 365.6MB in the end (delta: -237.2MB). Peak memory consumption was 885.9MB. Max. memory is 16.1GB. [2022-12-13 21:07:49,754 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 1.3GB. Free memory is still 365.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:07:49,755 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 123.7MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 729.14ms. Allocated memory is still 192.9MB. Free memory was 153.6MB in the beginning and 140.5MB in the end (delta: 13.0MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.43ms. Allocated memory is still 192.9MB. Free memory was 140.5MB in the beginning and 134.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.32ms. Allocated memory is still 192.9MB. Free memory was 134.2MB in the beginning and 127.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 812.61ms. Allocated memory is still 192.9MB. Free memory was 127.9MB in the beginning and 128.5MB in the end (delta: -517.9kB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. * TraceAbstraction took 226029.76ms. Allocated memory was 192.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 128.5MB in the beginning and 365.6MB in the end (delta: -237.2MB). Peak memory consumption was 885.9MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 1.3GB. Free memory is still 365.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 4056]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 3836, overapproximation of strlen at line 3775, overapproximation of bitwiseOr at line 3798, overapproximation of bitwiseAnd at line 3403, overapproximation of snprintf at line 3349. Possible FailurePath: [L3540] int LDV_IN_INTERRUPT = 1; [L3541] int ref_cnt ; [L3542] int ldv_state_variable_1 ; [L3543] int usb_counter ; [L3544] struct usb_interface *usb_acecad_driver_group1 ; [L3545] int ldv_state_variable_0 ; [L3829-L3833] static struct usb_device_id usb_acecad_id_table[3U] = { {3U, 1120U, 4U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1120U, 8U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 1UL}}; [L3834] struct usb_device_id const __mod_usb_device_table ; [L3835-L3840] static struct usb_driver usb_acecad_driver = {"usb_acecad", & usb_acecad_probe, & usb_acecad_disconnect, 0, 0, 0, 0, 0, 0, (struct usb_device_id const *)(& usb_acecad_id_table), {{{{{0U}, 0U, 0U, 0, {0, {0, 0}, 0, 0, 0UL}}}}, {0, 0}}, {{0, 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}, (unsigned char)0, (unsigned char)0, (unsigned char)0}; [L3862] int ldv_retval_0 ; [L3863] int ldv_retval_1 ; [L4059] int INTERF_STATE = 0; [L4060] int SERIAL_STATE = 0; [L4061] void *usb_intfdata = (void *)0; [L4062] struct urb *usb_urb = (struct urb *)0; [L4063] struct usb_device *usb_dev = (struct usb_device *)0; [L4064] int dev_counter = 0; [L4065] int completeFnIntCounter = 0; [L4066] int completeFnBulkCounter = 0; [L4067] void (*completeFnInt)(struct urb * ) ; [L4068] void (*completeFnBulk)(struct urb * ) ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3877] struct usb_device_id *ldvarg0 ; [L3878] void *tmp ; [L3879] int tmp___0 ; [L3880] int tmp___1 ; [L3881] int tmp___2 ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3883] CALL, EXPR ldv_init_zalloc(24UL) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3494] void *p ; [L3495] void *tmp ; [L3497] EXPR, FCALL calloc(1UL, size) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, calloc(1UL, size)={-55340232221128654849:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, size=24, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3497] tmp = calloc(1UL, size) [L3498] p = tmp VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, calloc(1UL, size)={-55340232221128654849:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-55340232221128654849:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3499] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3499] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, calloc(1UL, size)={-55340232221128654849:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-55340232221128654849:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3500] return (p); VAL [={0:0}, ={0:0}, \old(size)=24, \result={-55340232221128654849:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, calloc(1UL, size)={-55340232221128654849:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-55340232221128654849:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3883] RET, EXPR ldv_init_zalloc(24UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(24UL)={-55340232221128654849:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3883] tmp = ldv_init_zalloc(24UL) [L3884] ldvarg0 = (struct usb_device_id *)tmp [L3885] FCALL ldv_initialize() [L3886] ldv_state_variable_1 = 0 [L3887] ref_cnt = 0 [L3888] ldv_state_variable_0 = 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-55340232221128654849:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3890] tmp___0 = __VERIFIER_nondet_int() [L3892] case 0: [L3922] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-55340232221128654849:0}, tmp___0=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3923] COND TRUE ldv_state_variable_0 != 0 [L3924] tmp___2 = __VERIFIER_nondet_int() [L3926] case 0: [L3934] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-55340232221128654849:0}, tmp___0=1, tmp___2=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3935] COND TRUE ldv_state_variable_0 == 1 [L3936] CALL, EXPR usb_acecad_init() [L3843] int result ; [L3844] int tmp ; [L3846] CALL, EXPR usb_register(& usb_acecad_driver) [L3358] int tmp ; [L3360] CALL, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3977] ldv_func_ret_type ldv_func_res ; [L3978] int tmp ; [L3980] CALL, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L4352] return __VERIFIER_nondet_int(); [L3980] RET, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3980] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3981] ldv_func_res = tmp [L3982] ldv_state_variable_1 = 1 [L3983] usb_counter = 0 [L3984] CALL ldv_usb_driver_1() [L3868] void *tmp ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3870] CALL, EXPR ldv_init_zalloc(1248UL) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3494] void *p ; [L3495] void *tmp ; [L3497] EXPR, FCALL calloc(1UL, size) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, calloc(1UL, size)={-73786976294838206465:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1248, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3497] tmp = calloc(1UL, size) [L3498] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, calloc(1UL, size)={-73786976294838206465:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-73786976294838206465:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3499] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3499] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, calloc(1UL, size)={-73786976294838206465:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-73786976294838206465:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3500] return (p); VAL [={0:0}, ={0:0}, \old(size)=1248, \result={-73786976294838206465:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, calloc(1UL, size)={-73786976294838206465:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-73786976294838206465:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3870] RET, EXPR ldv_init_zalloc(1248UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(1248UL)={-73786976294838206465:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3870] tmp = ldv_init_zalloc(1248UL) [L3871] usb_acecad_driver_group1 = (struct usb_interface *)tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-73786976294838206465:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3984] RET ldv_usb_driver_1() [L3985] return (ldv_func_res); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ldv_func_arg1={12:0}, ldv_func_arg1={12:0}, ldv_func_arg2={18446744073709551618:18446744073709551635}, ldv_func_arg2={18446744073709551618:18446744073709551635}, ldv_func_arg3={3:0}, ldv_func_arg3={3:0}, ldv_func_res=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3360] RET, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3360] tmp = ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3361] return (tmp); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={12:0}, driver={12:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3846] RET, EXPR usb_register(& usb_acecad_driver) [L3846] tmp = usb_register(& usb_acecad_driver) [L3847] result = tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, tmp=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3848] COND TRUE result == 0 [L3852] return (result); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, tmp=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3936] RET, EXPR usb_acecad_init() [L3936] ldv_retval_1 = usb_acecad_init() [L3937] COND TRUE ldv_retval_1 == 0 [L3938] ldv_state_variable_0 = 3 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-55340232221128654849:0}, tmp___0=1, tmp___2=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3941] COND FALSE !(ldv_retval_1 != 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-55340232221128654849:0}, tmp___0=1, tmp___2=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3890] tmp___0 = __VERIFIER_nondet_int() [L3892] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-55340232221128654849:0}, tmp___0=0, tmp___2=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3893] COND TRUE ldv_state_variable_1 != 0 [L3894] tmp___1 = __VERIFIER_nondet_int() [L3896] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-55340232221128654849:0}, tmp___0=0, tmp___1=0, tmp___2=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3897] COND TRUE ldv_state_variable_1 == 1 [L3898] CALL, EXPR usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3690] struct usb_device *dev ; [L3691] struct usb_device *tmp ; [L3692] struct usb_host_interface *interface ; [L3693] struct usb_endpoint_descriptor *endpoint ; [L3694] struct usb_acecad *acecad ; [L3695] struct input_dev *input_dev ; [L3696] int pipe ; [L3697] int maxp ; [L3698] int err ; [L3699] int tmp___0 ; [L3700] unsigned int tmp___1 ; [L3701] __u16 tmp___2 ; [L3702] void *tmp___3 ; [L3703] void *tmp___4 ; [L3704] size_t tmp___5 ; [L3705] size_t tmp___6 ; [L3707] CALL, EXPR interface_to_usbdev(intf) [L3968] struct usb_device *tmp ; [L3970] CALL, EXPR ldv_interface_to_usbdev() [L4172] void *result ; [L4173] void *tmp ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4175] CALL, EXPR ldv_malloc(sizeof(struct usb_device)) VAL [={0:0}, ={0:0}, \old(size)=1822, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3460] void *p ; [L3461] void *tmp ; [L3462] int tmp___0 ; [L3464] tmp___0 = __VERIFIER_nondet_int() [L3465] COND FALSE !(tmp___0 != 0) [L3468] tmp = malloc(size) [L3469] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1822, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103231:0}, ref_cnt=0, SERIAL_STATE=0, size=1822, tmp={-36893488147419103231:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1822, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103231:0}, ref_cnt=0, SERIAL_STATE=0, size=1822, tmp={-36893488147419103231:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3471] return (p); VAL [={0:0}, ={0:0}, \old(size)=1822, \result={-36893488147419103231:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103231:0}, ref_cnt=0, SERIAL_STATE=0, size=1822, tmp={-36893488147419103231:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4175] RET, EXPR ldv_malloc(sizeof(struct usb_device)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct usb_device))={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4175] tmp = ldv_malloc(sizeof(struct usb_device)) [L4176] result = tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result={-36893488147419103231:0}, SERIAL_STATE=0, tmp={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4177] COND FALSE !((unsigned long )result == (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result={-36893488147419103231:0}, SERIAL_STATE=0, tmp={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4181] return ((struct usb_device *)result); VAL [={0:0}, ={0:0}, \result={-36893488147419103231:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result={-36893488147419103231:0}, SERIAL_STATE=0, tmp={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3970] RET, EXPR ldv_interface_to_usbdev() [L3970] tmp = ldv_interface_to_usbdev() [L3971] return (tmp); VAL [={0:0}, ={0:0}, \result={-36893488147419103231:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, intf={-73786976294838206465:0}, intf={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3707] RET, EXPR interface_to_usbdev(intf) [L3707] tmp = interface_to_usbdev(intf) [L3708] dev = tmp [L3709] EXPR intf->cur_altsetting [L3709] interface = intf->cur_altsetting [L3710] EXPR interface->desc.bNumEndpoints VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, id={-55340232221128654849:0}, id={-55340232221128654849:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, interface->desc.bNumEndpoints=-255, intf={-73786976294838206465:0}, intf={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3710] COND FALSE !((unsigned int )interface->desc.bNumEndpoints != 1U) [L3714] EXPR interface->endpoint [L3714] endpoint = & (interface->endpoint)->desc [L3715] CALL, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3313] int tmp ; [L3314] int tmp___0 ; [L3315] int tmp___1 ; [L3317] CALL, EXPR usb_endpoint_xfer_int(epd) [L3308] EXPR epd->bmAttributes [L3308] return (((int )epd->bmAttributes & 3) == 3); [L3317] RET, EXPR usb_endpoint_xfer_int(epd) [L3317] tmp = usb_endpoint_xfer_int(epd) [L3318] COND TRUE tmp != 0 [L3319] CALL, EXPR usb_endpoint_dir_in(epd) [L3302] EXPR epd->bEndpointAddress [L3302] return ((int )((signed char )epd->bEndpointAddress) < 0); [L3319] RET, EXPR usb_endpoint_dir_in(epd) [L3319] tmp___0 = usb_endpoint_dir_in(epd) [L3320] COND TRUE tmp___0 != 0 [L3321] tmp___1 = 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epd={-18446744073709551617:19}, epd={-18446744073709551617:19}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=1, tmp___0=1, tmp___1=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3328] return (tmp___1); VAL [={0:0}, ={0:0}, \result=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epd={-18446744073709551617:19}, epd={-18446744073709551617:19}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=1, tmp___0=1, tmp___1=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3715] RET, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3715] tmp___0 = usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3716] COND FALSE !(tmp___0 == 0) [L3720] EXPR endpoint->bEndpointAddress [L3720] CALL, EXPR __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3380] EXPR dev->devnum [L3380] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L3720] RET, EXPR __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3720] tmp___1 = __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3721] pipe = (int )(tmp___1 | 1073741952U) [L3722] CALL, EXPR usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3385] struct usb_host_endpoint *ep ; [L3386] unsigned int epnum ; [L3387] int __ret_warn_on ; [L3388] long tmp ; [L3389] int __ret_warn_on___0 ; [L3390] long tmp___0 ; VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3392] epnum = (unsigned int )(pipe >> 15) & 15U VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epnum=0, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3393] COND FALSE !(is_out != 0) [L3403] __ret_warn_on___0 = (pipe & 128) == 0 VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epnum=0, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3404] CALL, EXPR ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3537] return (exp); VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, c=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, exp=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3404] RET, EXPR ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epnum=0, INTERF_STATE=0, is_out=0, ldv__builtin_expect(__ret_warn_on___0 != 0, 0L)=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3404] tmp___0 = ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) [L3405] COND FALSE !(tmp___0 != 0L) VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epnum=0, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp___0=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3409] CALL ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3537] return (exp); VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, c=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, exp=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3409] RET ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epnum=0, INTERF_STATE=0, is_out=0, ldv__builtin_expect(__ret_warn_on___0 != 0, 0L)=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp___0=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3410] EXPR udev->ep_in[epnum] [L3410] ep = udev->ep_in[epnum] [L3412] COND TRUE (unsigned long )ep == (unsigned long )((struct usb_host_endpoint *)0) [L3413] return (0U); VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, ep={18446744073709551598:18}, epnum=0, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp___0=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3722] RET, EXPR usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3722] tmp___2 = usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3723] maxp = (int )tmp___2 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-18446744073709551617:19}, id={-55340232221128654849:0}, id={-55340232221128654849:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3724] CALL, EXPR kzalloc(232UL, 208U) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3444] void *tmp ; [L3446] CALL, EXPR kmalloc(size, flags | 32768U) [L3435] void *tmp___1 ; [L3437] CALL, EXPR __kmalloc(size, flags) [L3430] CALL, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=232, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3460] void *p ; [L3461] void *tmp ; [L3462] int tmp___0 ; [L3464] tmp___0 = __VERIFIER_nondet_int() [L3465] COND FALSE !(tmp___0 != 0) [L3468] tmp = malloc(size) [L3469] p = tmp VAL [={0:0}, ={0:0}, \old(size)=232, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-55340232221128654847:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654847:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=232, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-55340232221128654847:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654847:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3471] return (p); VAL [={0:0}, ={0:0}, \old(size)=232, \result={-55340232221128654847:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-55340232221128654847:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654847:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3430] RET, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=232, \old(t)=32768, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-55340232221128654847:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=232, t=32768, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3430] return ldv_malloc(size); [L3437] RET, EXPR __kmalloc(size, flags) [L3437] tmp___1 = __kmalloc(size, flags) [L3438] return (tmp___1); VAL [={0:0}, ={0:0}, \old(flags)=32768, \old(size)=232, \result={-55340232221128654847:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=32768, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=232, tmp___1={-55340232221128654847:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3446] RET, EXPR kmalloc(size, flags | 32768U) [L3446] tmp = kmalloc(size, flags | 32768U) [L3447] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=208, \old(size)=232, \result={-55340232221128654847:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=208, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654847:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3724] RET, EXPR kzalloc(232UL, 208U) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-18446744073709551617:19}, id={-55340232221128654849:0}, id={-55340232221128654849:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465:0}, kzalloc(232UL, 208U)={-55340232221128654847:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3724] tmp___3 = kzalloc(232UL, 208U) [L3725] acecad = (struct usb_acecad *)tmp___3 [L3726] CALL, EXPR input_allocate_device() [L3548] CALL, EXPR kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3444] void *tmp ; [L3446] CALL, EXPR kmalloc(size, flags | 32768U) [L3435] void *tmp___1 ; [L3437] CALL, EXPR __kmalloc(size, flags) [L3430] CALL, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=1855, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3460] void *p ; [L3461] void *tmp ; [L3462] int tmp___0 ; [L3464] tmp___0 = __VERIFIER_nondet_int() [L3465] COND FALSE !(tmp___0 != 0) [L3468] tmp = malloc(size) [L3469] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1855, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-18446744073709551617:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1855, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-18446744073709551617:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3471] return (p); VAL [={0:0}, ={0:0}, \old(size)=1855, \result={-18446744073709551617:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-18446744073709551617:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3430] RET, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=1855, \old(t)=32768, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-18446744073709551617:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1855, t=32768, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3430] return ldv_malloc(size); [L3437] RET, EXPR __kmalloc(size, flags) [L3437] tmp___1 = __kmalloc(size, flags) [L3438] return (tmp___1); VAL [={0:0}, ={0:0}, \old(flags)=32768, \old(size)=1855, \result={-18446744073709551617:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=32768, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp___1={-18446744073709551617:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3446] RET, EXPR kmalloc(size, flags | 32768U) [L3446] tmp = kmalloc(size, flags | 32768U) [L3447] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=128, \old(size)=1855, \result={-18446744073709551617:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=128, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-18446744073709551617:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3548] RET, EXPR kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u)={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3548] return kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u); [L3726] RET, EXPR input_allocate_device() [L3726] input_dev = input_allocate_device() [L3727] COND FALSE !((unsigned long )acecad == (unsigned long )((struct usb_acecad *)0) || (unsigned long )input_dev == (unsigned long )((struct input_dev *)0)) [L3732] CALL, EXPR usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L4339] CALL, EXPR ldv_malloc(0UL) VAL [={0:0}, ={0:0}, \old(size)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3460] void *p ; [L3461] void *tmp ; [L3462] int tmp___0 ; [L3464] tmp___0 = __VERIFIER_nondet_int() [L3465] COND FALSE !(tmp___0 != 0) [L3468] tmp = malloc(size) [L3469] p = tmp VAL [={0:0}, ={0:0}, \old(size)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551615:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-18446744073709551615:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551615:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-18446744073709551615:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3471] return (p); VAL [={0:0}, ={0:0}, \old(size)=0, \result={-18446744073709551615:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551615:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-18446744073709551615:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4339] RET, EXPR ldv_malloc(0UL) VAL [={0:0}, ={0:0}, \old(arg1)=8, \old(arg2)=208, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, arg0={-36893488147419103231:0}, arg0={-36893488147419103231:0}, arg1=8, arg2=208, arg3={-55340232221128654847:224}, arg3={-55340232221128654847:224}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4339] return ldv_malloc(0UL); [L3732] RET, EXPR usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L3732] tmp___4 = usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L3733] acecad->data = (unsigned char *)tmp___4 [L3734] EXPR acecad->data VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, acecad={-55340232221128654847:0}, acecad->data={-18446744073709551615:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-18446744073709551617:19}, id={-55340232221128654849:0}, id={-55340232221128654849:0}, input_dev={-18446744073709551617:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-18446744073709551615:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3734] COND FALSE !((unsigned long )acecad->data == (unsigned long )((unsigned char *)0U)) [L3739] CALL, EXPR ldv_usb_alloc_urb_5(0, 208U) [L4006] struct urb *tmp ; [L4008] CALL, EXPR ldv_alloc_urb() [L4091] struct urb *value ; [L4092] void *tmp ; [L4093] int tmp___0 ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4095] CALL, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3460] void *p ; [L3461] void *tmp ; [L3462] int tmp___0 ; [L3464] tmp___0 = __VERIFIER_nondet_int() [L3465] COND FALSE !(tmp___0 != 0) [L3468] tmp = malloc(size) [L3469] p = tmp VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-36893488147419103233:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-36893488147419103233:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3471] return (p); VAL [={0:0}, ={0:0}, \old(size)=180, \result={-36893488147419103233:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-36893488147419103233:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4095] RET, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct urb))={-36893488147419103233:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4095] tmp = ldv_malloc(sizeof(struct urb)) [L4096] value = (struct urb *)tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}, value={-36893488147419103233:0}] [L4097] CALL, EXPR ldv_undef_int() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3513] int tmp ; [L3515] tmp = __VERIFIER_nondet_int() [L3516] return (tmp); VAL [={0:0}, ={0:0}, \result=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4097] RET, EXPR ldv_undef_int() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_undef_int()=1, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}, value={-36893488147419103233:0}] [L4097] tmp___0 = ldv_undef_int() [L4098] COND TRUE tmp___0 != 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}, value={-36893488147419103233:0}] [L4099] COND TRUE (unsigned long )value != (unsigned long )((struct urb *)0) [L4100] usb_urb = value VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}, value={-36893488147419103233:0}] [L4105] return (usb_urb); VAL [={0:0}, ={0:0}, \result={-36893488147419103233:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}, value={-36893488147419103233:0}] [L4008] RET, EXPR ldv_alloc_urb() [L4008] tmp = ldv_alloc_urb() [L4009] return (tmp); VAL [={0:0}, ={0:0}, \old(iso_packets)=0, \old(mem_flags)=208, \result={-36893488147419103233:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, iso_packets=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, mem_flags=208, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3739] RET, EXPR ldv_usb_alloc_urb_5(0, 208U) [L3739] acecad->irq = ldv_usb_alloc_urb_5(0, 208U) [L3740] EXPR acecad->irq VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, acecad={-55340232221128654847:0}, acecad->irq={-36893488147419103233:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-18446744073709551617:19}, id={-55340232221128654849:0}, id={-55340232221128654849:0}, input_dev={-18446744073709551617:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-18446744073709551615:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3740] COND FALSE !((unsigned long )acecad->irq == (unsigned long )((struct urb *)0)) [L3745] acecad->usbdev = dev [L3746] acecad->input = input_dev [L3747] EXPR dev->manufacturer VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev->manufacturer={23:18446744073709551593}, dev_counter=0, endpoint={-18446744073709551617:19}, id={-55340232221128654849:0}, id={-55340232221128654849:0}, input_dev={-18446744073709551617:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-18446744073709551615:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3747] COND FALSE !((unsigned long )dev->manufacturer != (unsigned long )((char *)0)) [L3751] EXPR dev->product VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev->product={18446744073709551589:27}, dev_counter=0, endpoint={-18446744073709551617:19}, id={-55340232221128654849:0}, id={-55340232221128654849:0}, input_dev={-18446744073709551617:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-18446744073709551615:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3751] COND FALSE !((unsigned long )dev->product != (unsigned long )((char *)0)) [L3759] CALL usb_make_path(dev, (char *)(& acecad->phys), 64UL) [L3347] int actual ; [L3349] EXPR dev->bus [L3349] EXPR (dev->bus)->bus_name [L3349] actual = snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, (char *)(& dev->devpath)) [L3350] return ((int )size > actual ? actual : -1); VAL [={0:0}, ={0:0}, \old(size)=64, \result=-1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, actual=65, buf={-55340232221128654847:128}, buf={-55340232221128654847:128}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev={-36893488147419103231:0}, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=64, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3759] RET usb_make_path(dev, (char *)(& acecad->phys), 64UL) [L3760] CALL strlcat((char *)(& acecad->phys), "/input0", 64UL) VAL [={0:0}, ={0:0}, \old(arg2)=64, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, arg0={-55340232221128654847:128}, arg1={8:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L4332] return __VERIFIER_nondet_ulong(); [L3760] RET strlcat((char *)(& acecad->phys), "/input0", 64UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-18446744073709551617:19}, id={-55340232221128654849:0}, id={-55340232221128654849:0}, input_dev={-18446744073709551617:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, strlcat((char *)(& acecad->phys), "/input0", 64UL)=18446744073709551634, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-18446744073709551615:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3761] input_dev->name = (char const *)(& acecad->name) [L3762] input_dev->phys = (char const *)(& acecad->phys) [L3763] CALL usb_to_input_id((struct usb_device const *)dev, & input_dev->id) [L3597] id->bustype = 3U [L3598] EXPR dev->descriptor.idVendor [L3598] id->vendor = dev->descriptor.idVendor [L3599] EXPR dev->descriptor.idProduct [L3599] id->product = dev->descriptor.idProduct [L3600] EXPR dev->descriptor.bcdDevice [L3600] id->version = dev->descriptor.bcdDevice [L3763] RET usb_to_input_id((struct usb_device const *)dev, & input_dev->id) [L3764] input_dev->dev.parent = & intf->dev [L3765] CALL input_set_drvdata(input_dev, (void *)acecad) [L3562] FCALL dev_set_drvdata(& dev->dev, data) [L3765] RET input_set_drvdata(input_dev, (void *)acecad) [L3766] input_dev->open = & usb_acecad_open [L3767] input_dev->close = & usb_acecad_close [L3768] input_dev->evbit[0] = 10UL [L3769] input_dev->keybit[5] = 7169UL [L3770] id->driver_info [L3771] case 0UL: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-18446744073709551617:19}, id={-55340232221128654849:0}, id={-55340232221128654849:0}, id->driver_info=0, input_dev={-18446744073709551617:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-18446744073709551615:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3772] FCALL input_set_abs_params(input_dev, 0U, 0, 5000, 4, 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-18446744073709551617:19}, id={-55340232221128654849:0}, id={-55340232221128654849:0}, id->driver_info=0, input_dev={-18446744073709551617:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-18446744073709551615:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3773] FCALL input_set_abs_params(input_dev, 1U, 0, 3750, 4, 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-18446744073709551617:19}, id={-55340232221128654849:0}, id={-55340232221128654849:0}, id->driver_info=0, input_dev={-18446744073709551617:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-18446744073709551615:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3774] FCALL input_set_abs_params(input_dev, 24U, 0, 512, 0, 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-18446744073709551617:19}, id={-55340232221128654849:0}, id={-55340232221128654849:0}, id->driver_info=0, input_dev={-18446744073709551617:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-18446744073709551615:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3775] tmp___5 = strlen((char const *)(& acecad->name)) [L3776] COND FALSE !(tmp___5 == 0UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-18446744073709551617:19}, id={-55340232221128654849:0}, id={-55340232221128654849:0}, id->driver_info=0, input_dev={-18446744073709551617:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-18446744073709551615:0}, tmp___5=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3795] EXPR acecad->irq [L3795] EXPR acecad->data [L3796] EXPR endpoint->bInterval [L3795-L3796] CALL ldv_usb_fill_int_urb_6(acecad->irq, dev, (unsigned int )pipe, (void *)acecad->data, 8 < maxp ? 8 : maxp, & usb_acecad_irq, (void *)acecad, (int )endpoint->bInterval) [L4018] CALL ldv_fill_int_urb(urb, complete_fn) [L4121] COND TRUE (unsigned long )usb_urb == (unsigned long )urb [L4122] completeFnInt = complete_fn [L4123] completeFnIntCounter = completeFnIntCounter + 1 VAL [={-1:2}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, complete_fn={-1:2}, complete_fn={-1:2}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, urb={-36893488147419103233:0}, urb={-36893488147419103233:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L4018] RET ldv_fill_int_urb(urb, complete_fn) [L3795-L3796] RET ldv_usb_fill_int_urb_6(acecad->irq, dev, (unsigned int )pipe, (void *)acecad->data, 8 < maxp ? 8 : maxp, & usb_acecad_irq, (void *)acecad, (int )endpoint->bInterval) [L3797] EXPR acecad->irq [L3797] EXPR acecad->data_dma [L3797] (acecad->irq)->transfer_dma = acecad->data_dma [L3798] EXPR acecad->irq [L3798] EXPR acecad->irq [L3798] EXPR (acecad->irq)->transfer_flags [L3798] (acecad->irq)->transfer_flags = (acecad->irq)->transfer_flags | 4U [L3799] EXPR acecad->input [L3799] CALL, EXPR input_register_device(acecad->input) [L4315] return __VERIFIER_nondet_int(); [L3799] RET, EXPR input_register_device(acecad->input) [L3799] err = input_register_device(acecad->input) [L3800] COND TRUE err != 0 VAL [={0:0}, ={-1:2}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=1, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-18446744073709551617:19}, err=1, id={-55340232221128654849:0}, id={-55340232221128654849:0}, id->driver_info=0, input_dev={-18446744073709551617:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-18446744073709551615:0}, tmp___5=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3807] EXPR acecad->data [L3807] EXPR acecad->data_dma VAL [={0:0}, ={-1:2}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, acecad={-55340232221128654847:0}, acecad->data={-18446744073709551615:0}, acecad->data_dma=18446744073709551623, completeFnBulkCounter=0, completeFnIntCounter=1, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-18446744073709551617:19}, err=1, id={-55340232221128654849:0}, id={-55340232221128654849:0}, id->driver_info=0, input_dev={-18446744073709551617:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-18446744073709551615:0}, tmp___5=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3807] FCALL usb_free_coherent(dev, 8UL, (void *)acecad->data, acecad->data_dma) VAL [={-1:2}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, acecad={-55340232221128654847:0}, acecad->data={-18446744073709551615:0}, acecad->data_dma=18446744073709551623, completeFnBulkCounter=0, completeFnIntCounter=1, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-18446744073709551617:19}, err=1, id={-55340232221128654849:0}, id={-55340232221128654849:0}, id->driver_info=0, input_dev={-18446744073709551617:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-18446744073709551615:0}, tmp___5=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3809] FCALL input_free_device(input_dev) [L3810] CALL kfree((void const *)acecad) VAL [={-1:2}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-55340232221128654847:0}, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3810] RET kfree((void const *)acecad) VAL [={-1:2}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=1, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-18446744073709551617:19}, err=1, id={-55340232221128654849:0}, id={-55340232221128654849:0}, id->driver_info=0, input_dev={-18446744073709551617:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-18446744073709551615:0}, tmp___5=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3811] return (err); VAL [={-1:2}, ={0:0}, \result=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=1, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-18446744073709551617:19}, err=1, id={-55340232221128654849:0}, id={-55340232221128654849:0}, id->driver_info=0, input_dev={-18446744073709551617:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-18446744073709551615:0}, tmp___5=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3898] RET, EXPR usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3898] ldv_retval_0 = usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3899] COND FALSE !(ldv_retval_0 == 0) VAL [={0:0}, ={-1:2}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-55340232221128654849:0}, tmp___0=0, tmp___1=0, tmp___2=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3890] tmp___0 = __VERIFIER_nondet_int() [L3892] case 0: [L3922] case 1: VAL [={-1:2}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-55340232221128654849:0}, tmp___0=1, tmp___1=0, tmp___2=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3923] COND TRUE ldv_state_variable_0 != 0 [L3924] tmp___2 = __VERIFIER_nondet_int() [L3926] case 0: VAL [={0:0}, ={-1:2}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-55340232221128654849:0}, tmp___0=1, tmp___1=0, tmp___2=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3927] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L3928] CALL usb_acecad_exit() [L3858] CALL ldv_usb_deregister_11(& usb_acecad_driver) [L4047] FCALL usb_deregister(arg) [L4048] ldv_state_variable_1 = 0 VAL [={-1:2}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, arg={12:0}, arg={12:0}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3858] RET ldv_usb_deregister_11(& usb_acecad_driver) [L3928] RET usb_acecad_exit() [L3929] ldv_state_variable_0 = 2 VAL [={0:0}, ={-1:2}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ldvarg0={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-55340232221128654849:0}, tmp___0=1, tmp___1=0, tmp___2=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L3962] CALL ldv_check_final_state() [L4278] COND TRUE (unsigned long )usb_urb != (unsigned long )((struct urb *)0) VAL [={0:0}, ={-1:2}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L4279] CALL ldv_error() VAL [={-1:2}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] [L4056] reach_error() VAL [={0:0}, ={-1:2}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-36893488147419103233:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 234 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 225.8s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 78.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 212 mSolverCounterUnknown, 14617 SdHoareTripleChecker+Valid, 48.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14226 mSDsluCounter, 83607 SdHoareTripleChecker+Invalid, 44.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3706 IncrementalHoareTripleChecker+Unchecked, 76004 mSDsCounter, 5292 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49435 IncrementalHoareTripleChecker+Invalid, 58645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5292 mSolverCounterUnsat, 7603 mSDtfsCounter, 49435 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2964 GetRequests, 2307 SyntacticMatches, 53 SemanticMatches, 604 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 23047 ImplicationChecksByTransitivity, 30.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10971occurred in iteration=20, InterpolantAutomatonStates: 434, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 37551 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 110.3s SatisfiabilityAnalysisTime, 26.3s InterpolantComputationTime, 4514 NumberOfCodeBlocks, 4387 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 4426 ConstructedInterpolants, 263 QuantifiedInterpolants, 17213 SizeOfPredicates, 165 NumberOfNonLiveVariables, 12079 ConjunctsInSsa, 605 ConjunctsInUnsatCore, 29 InterpolantComputations, 16 PerfectInterpolantSequences, 1863/2203 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 21:07:49,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/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_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/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 07ae4eb392cc9822cbd398c1edf107cccc60d6668bc59dbf5a692a6b9350873b --- 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 21:07:51,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:07:51,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:07:51,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:07:51,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:07:51,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:07:51,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:07:51,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:07:51,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:07:51,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:07:51,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:07:51,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:07:51,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:07:51,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:07:51,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:07:51,347 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:07:51,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:07:51,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:07:51,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:07:51,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:07:51,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:07:51,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:07:51,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:07:51,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:07:51,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:07:51,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:07:51,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:07:51,357 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:07:51,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:07:51,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:07:51,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:07:51,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:07:51,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:07:51,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:07:51,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:07:51,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:07:51,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:07:51,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:07:51,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:07:51,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:07:51,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:07:51,372 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-12-13 21:07:51,395 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:07:51,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:07:51,396 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:07:51,396 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:07:51,397 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:07:51,397 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:07:51,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:07:51,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:07:51,398 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:07:51,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:07:51,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:07:51,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:07:51,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:07:51,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:07:51,399 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 21:07:51,399 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 21:07:51,399 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 21:07:51,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:07:51,400 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:07:51,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:07:51,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:07:51,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:07:51,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:07:51,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:07:51,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:07:51,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:07:51,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:07:51,402 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 21:07:51,402 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 21:07:51,402 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:07:51,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:07:51,402 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:07:51,403 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:07:51,403 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 21:07:51,403 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:07:51,403 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_62f50c98-fa4e-4eff-ae39-32c84810d179/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_62f50c98-fa4e-4eff-ae39-32c84810d179/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 -> 07ae4eb392cc9822cbd398c1edf107cccc60d6668bc59dbf5a692a6b9350873b [2022-12-13 21:07:51,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:07:51,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:07:51,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:07:51,655 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:07:51,656 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:07:51,657 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-12-13 21:07:54,264 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:07:54,513 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:07:54,514 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-12-13 21:07:54,529 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/data/6ac763ae7/ea529ef7301848aa99ff6a286d453852/FLAG0bf5fe298 [2022-12-13 21:07:54,540 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/data/6ac763ae7/ea529ef7301848aa99ff6a286d453852 [2022-12-13 21:07:54,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:07:54,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:07:54,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:07:54,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:07:54,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:07:54,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:07:54" (1/1) ... [2022-12-13 21:07:54,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@473aad73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:54, skipping insertion in model container [2022-12-13 21:07:54,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:07:54" (1/1) ... [2022-12-13 21:07:54,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:07:54,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:07:54,926 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 21:07:54,927 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 21:07:54,951 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:07:55,002 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-12-13 21:07:55,005 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-12-13 21:07:55,015 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 21:07:55,018 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 21:07:55,021 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 21:07:55,035 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 21:07:55,042 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 21:07:55,047 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_coherent [2022-12-13 21:07:55,049 WARN L623 FunctionHandler]: Unknown extern function strlcpy [2022-12-13 21:07:55,050 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 21:07:55,051 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 21:07:55,051 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 21:07:55,054 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:07:55,054 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:07:55,055 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:07:55,056 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:07:55,056 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:07:55,057 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:07:55,059 WARN L623 FunctionHandler]: Unknown extern function input_register_device [2022-12-13 21:07:55,059 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 21:07:55,060 WARN L623 FunctionHandler]: Unknown extern function input_free_device [2022-12-13 21:07:55,060 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 21:07:55,063 WARN L623 FunctionHandler]: Unknown extern function input_unregister_device [2022-12-13 21:07:55,064 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 21:07:55,064 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 21:07:55,069 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 21:07:55,078 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-12-13 21:07:55,080 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-12-13 21:07:55,082 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-12-13 21:07:55,085 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_62f50c98-fa4e-4eff-ae39-32c84810d179/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2022-12-13 21:07:55,091 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:07:55,098 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:07:55,113 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:07:55,115 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:07:55,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:07:55,133 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-13 21:07:55,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:07:55,199 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 21:07:55,200 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 21:07:55,201 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:07:55,205 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-12-13 21:07:55,206 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-12-13 21:07:55,206 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 21:07:55,207 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 21:07:55,207 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 21:07:55,210 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 21:07:55,212 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 21:07:55,214 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_coherent [2022-12-13 21:07:55,215 WARN L623 FunctionHandler]: Unknown extern function strlcpy [2022-12-13 21:07:55,215 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 21:07:55,216 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 21:07:55,216 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 21:07:55,225 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:07:55,225 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:07:55,226 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:07:55,227 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:07:55,227 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:07:55,227 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:07:55,229 WARN L623 FunctionHandler]: Unknown extern function input_register_device [2022-12-13 21:07:55,229 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 21:07:55,229 WARN L623 FunctionHandler]: Unknown extern function input_free_device [2022-12-13 21:07:55,229 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 21:07:55,230 WARN L623 FunctionHandler]: Unknown extern function input_unregister_device [2022-12-13 21:07:55,230 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 21:07:55,231 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 21:07:55,232 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 21:07:55,233 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-12-13 21:07:55,235 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-12-13 21:07:55,237 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-12-13 21:07:55,237 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_62f50c98-fa4e-4eff-ae39-32c84810d179/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2022-12-13 21:07:55,238 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:07:55,240 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:07:55,243 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:07:55,244 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:07:55,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:07:55,249 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:07:55,298 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 21:07:55,299 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 21:07:55,300 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:07:55,303 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-12-13 21:07:55,303 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-12-13 21:07:55,303 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 21:07:55,304 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 21:07:55,304 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 21:07:55,307 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 21:07:55,308 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 21:07:55,310 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_coherent [2022-12-13 21:07:55,310 WARN L623 FunctionHandler]: Unknown extern function strlcpy [2022-12-13 21:07:55,311 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 21:07:55,311 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 21:07:55,312 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 21:07:55,317 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:07:55,317 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:07:55,317 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:07:55,326 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:07:55,326 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:07:55,326 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 21:07:55,328 WARN L623 FunctionHandler]: Unknown extern function input_register_device [2022-12-13 21:07:55,328 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 21:07:55,329 WARN L623 FunctionHandler]: Unknown extern function input_free_device [2022-12-13 21:07:55,329 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 21:07:55,329 WARN L623 FunctionHandler]: Unknown extern function input_unregister_device [2022-12-13 21:07:55,330 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 21:07:55,330 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 21:07:55,331 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 21:07:55,332 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-12-13 21:07:55,334 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-12-13 21:07:55,336 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-12-13 21:07:55,336 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_62f50c98-fa4e-4eff-ae39-32c84810d179/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2022-12-13 21:07:55,337 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:07:55,339 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:07:55,342 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:07:55,343 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 21:07:55,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:07:55,368 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:07:55,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:55 WrapperNode [2022-12-13 21:07:55,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:07:55,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:07:55,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:07:55,370 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:07:55,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:55" (1/1) ... [2022-12-13 21:07:55,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:55" (1/1) ... [2022-12-13 21:07:55,429 INFO L138 Inliner]: procedures = 116, calls = 317, calls flagged for inlining = 47, calls inlined = 41, statements flattened = 761 [2022-12-13 21:07:55,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:07:55,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:07:55,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:07:55,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:07:55,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:55" (1/1) ... [2022-12-13 21:07:55,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:55" (1/1) ... [2022-12-13 21:07:55,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:55" (1/1) ... [2022-12-13 21:07:55,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:55" (1/1) ... [2022-12-13 21:07:55,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:55" (1/1) ... [2022-12-13 21:07:55,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:55" (1/1) ... [2022-12-13 21:07:55,472 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:55" (1/1) ... [2022-12-13 21:07:55,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:55" (1/1) ... [2022-12-13 21:07:55,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:07:55,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:07:55,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:07:55,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:07:55,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:55" (1/1) ... [2022-12-13 21:07:55,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:07:55,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:07:55,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:07:55,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:07:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-12-13 21:07:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-12-13 21:07:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 21:07:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-12-13 21:07:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-12-13 21:07:55,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-12-13 21:07:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-12-13 21:07:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-12-13 21:07:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-12-13 21:07:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-12-13 21:07:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-12-13 21:07:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-12-13 21:07:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-12-13 21:07:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-12-13 21:07:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-12-13 21:07:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-12-13 21:07:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-12-13 21:07:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-12-13 21:07:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-12-13 21:07:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-12-13 21:07:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-12-13 21:07:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-12-13 21:07:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 21:07:55,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 21:07:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 21:07:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:07:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-12-13 21:07:55,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-12-13 21:07:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 21:07:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-12-13 21:07:55,542 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-12-13 21:07:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-12-13 21:07:55,542 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-12-13 21:07:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-12-13 21:07:55,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-12-13 21:07:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 21:07:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-12-13 21:07:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-12-13 21:07:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-12-13 21:07:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 21:07:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 21:07:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 21:07:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-12-13 21:07:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-12-13 21:07:55,543 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-12-13 21:07:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 21:07:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-12-13 21:07:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-12-13 21:07:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-12-13 21:07:55,543 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-12-13 21:07:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:07:55,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:07:55,767 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:07:55,769 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:07:55,840 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-12-13 21:08:00,527 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:08:00,534 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:08:00,534 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 21:08:00,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:08:00 BoogieIcfgContainer [2022-12-13 21:08:00,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:08:00,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:08:00,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:08:00,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:08:00,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:07:54" (1/3) ... [2022-12-13 21:08:00,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24fc9382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:08:00, skipping insertion in model container [2022-12-13 21:08:00,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:07:55" (2/3) ... [2022-12-13 21:08:00,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24fc9382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:08:00, skipping insertion in model container [2022-12-13 21:08:00,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:08:00" (3/3) ... [2022-12-13 21:08:00,542 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-12-13 21:08:00,555 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:08:00,556 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 21:08:00,596 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:08:00,600 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;@5518f46, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:08:00,600 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 21:08:00,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 230 states, 170 states have (on average 1.3176470588235294) internal successors, (224), 182 states have internal predecessors, (224), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-12-13 21:08:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 21:08:00,611 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:08:00,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:08:00,611 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:08:00,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:00,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1609638295, now seen corresponding path program 1 times [2022-12-13 21:08:00,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:08:00,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611577847] [2022-12-13 21:08:00,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:00,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:00,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:08:00,629 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:08:00,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 21:08:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:00,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 21:08:00,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:08:00,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:08:00,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:08:00,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611577847] [2022-12-13 21:08:00,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611577847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:00,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:00,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:08:00,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721201835] [2022-12-13 21:08:00,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:00,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 21:08:00,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:08:00,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 21:08:00,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 21:08:00,939 INFO L87 Difference]: Start difference. First operand has 230 states, 170 states have (on average 1.3176470588235294) internal successors, (224), 182 states have internal predecessors, (224), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 21:08:00,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:08:00,977 INFO L93 Difference]: Finished difference Result 455 states and 617 transitions. [2022-12-13 21:08:00,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 21:08:00,978 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-12-13 21:08:00,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:08:00,985 INFO L225 Difference]: With dead ends: 455 [2022-12-13 21:08:00,985 INFO L226 Difference]: Without dead ends: 219 [2022-12-13 21:08:00,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 21:08:01,001 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:08:01,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:08:01,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-12-13 21:08:01,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2022-12-13 21:08:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 165 states have (on average 1.284848484848485) internal successors, (212), 171 states have internal predecessors, (212), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-12-13 21:08:01,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 285 transitions. [2022-12-13 21:08:01,060 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 285 transitions. Word has length 32 [2022-12-13 21:08:01,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:08:01,061 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 285 transitions. [2022-12-13 21:08:01,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 21:08:01,061 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 285 transitions. [2022-12-13 21:08:01,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 21:08:01,062 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:08:01,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:08:01,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 21:08:01,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:01,264 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:08:01,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:01,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2032340121, now seen corresponding path program 1 times [2022-12-13 21:08:01,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:08:01,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477389998] [2022-12-13 21:08:01,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:01,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:01,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:08:01,273 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:08:01,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 21:08:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:01,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:08:01,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:08:01,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:08:01,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:08:01,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477389998] [2022-12-13 21:08:01,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477389998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:01,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:01,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:08:01,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112703060] [2022-12-13 21:08:01,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:01,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:08:01,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:08:01,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:08:01,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:01,635 INFO L87 Difference]: Start difference. First operand 219 states and 285 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 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 21:08:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:08:01,751 INFO L93 Difference]: Finished difference Result 621 states and 811 transitions. [2022-12-13 21:08:01,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:08:01,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 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 32 [2022-12-13 21:08:01,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:08:01,754 INFO L225 Difference]: With dead ends: 621 [2022-12-13 21:08:01,754 INFO L226 Difference]: Without dead ends: 407 [2022-12-13 21:08:01,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:01,756 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 250 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:08:01,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 589 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:08:01,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-12-13 21:08:01,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2022-12-13 21:08:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 307 states have (on average 1.276872964169381) internal successors, (392), 315 states have internal predecessors, (392), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-12-13 21:08:01,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 529 transitions. [2022-12-13 21:08:01,783 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 529 transitions. Word has length 32 [2022-12-13 21:08:01,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:08:01,783 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 529 transitions. [2022-12-13 21:08:01,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 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 21:08:01,783 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 529 transitions. [2022-12-13 21:08:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 21:08:01,784 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:08:01,784 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 21:08:01,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-13 21:08:01,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:01,985 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:08:01,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:01,986 INFO L85 PathProgramCache]: Analyzing trace with hash -923406100, now seen corresponding path program 1 times [2022-12-13 21:08:01,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:08:01,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221031916] [2022-12-13 21:08:01,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:01,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:01,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:08:01,990 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:08:01,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 21:08:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:02,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 21:08:02,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 21:08:02,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:08:02,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:08:02,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221031916] [2022-12-13 21:08:02,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221031916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:02,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:02,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:08:02,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807891747] [2022-12-13 21:08:02,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:02,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:08:02,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:08:02,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:08:02,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:08:02,385 INFO L87 Difference]: Start difference. First operand 407 states and 529 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:08:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:08:02,645 INFO L93 Difference]: Finished difference Result 951 states and 1266 transitions. [2022-12-13 21:08:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:08:02,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-12-13 21:08:02,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:08:02,653 INFO L225 Difference]: With dead ends: 951 [2022-12-13 21:08:02,653 INFO L226 Difference]: Without dead ends: 559 [2022-12-13 21:08:02,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 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 21:08:02,654 INFO L413 NwaCegarLoop]: 453 mSDtfsCounter, 622 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:08:02,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1111 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:08:02,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-12-13 21:08:02,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 410. [2022-12-13 21:08:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 310 states have (on average 1.270967741935484) internal successors, (394), 318 states have internal predecessors, (394), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-12-13 21:08:02,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 531 transitions. [2022-12-13 21:08:02,685 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 531 transitions. Word has length 55 [2022-12-13 21:08:02,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:08:02,685 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 531 transitions. [2022-12-13 21:08:02,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:08:02,685 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 531 transitions. [2022-12-13 21:08:02,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 21:08:02,686 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:08:02,686 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 21:08:02,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 21:08:02,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:02,887 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:08:02,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:02,888 INFO L85 PathProgramCache]: Analyzing trace with hash -186089428, now seen corresponding path program 1 times [2022-12-13 21:08:02,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:08:02,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212756028] [2022-12-13 21:08:02,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:02,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:02,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:08:02,889 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:08:02,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 21:08:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:03,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:08:03,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 21:08:03,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:08:03,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:08:03,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212756028] [2022-12-13 21:08:03,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212756028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:03,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:03,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:08:03,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362383654] [2022-12-13 21:08:03,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:03,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:08:03,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:08:03,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:08:03,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:03,452 INFO L87 Difference]: Start difference. First operand 410 states and 531 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:08:03,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:08:03,580 INFO L93 Difference]: Finished difference Result 1199 states and 1564 transitions. [2022-12-13 21:08:03,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:08:03,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-12-13 21:08:03,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:08:03,586 INFO L225 Difference]: With dead ends: 1199 [2022-12-13 21:08:03,586 INFO L226 Difference]: Without dead ends: 804 [2022-12-13 21:08:03,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:03,589 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 243 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:08:03,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 586 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:08:03,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-12-13 21:08:03,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 794. [2022-12-13 21:08:03,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 605 states have (on average 1.2677685950413222) internal successors, (767), 617 states have internal predecessors, (767), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-12-13 21:08:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1032 transitions. [2022-12-13 21:08:03,659 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1032 transitions. Word has length 55 [2022-12-13 21:08:03,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:08:03,660 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 1032 transitions. [2022-12-13 21:08:03,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:08:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1032 transitions. [2022-12-13 21:08:03,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 21:08:03,662 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:08:03,662 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 21:08:03,677 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-13 21:08:03,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:03,863 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:08:03,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:03,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1473800436, now seen corresponding path program 1 times [2022-12-13 21:08:03,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:08:03,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140602714] [2022-12-13 21:08:03,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:03,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:03,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:08:03,869 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:08:03,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-13 21:08:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:04,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:08:04,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:04,518 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 21:08:04,518 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:08:04,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:08:04,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140602714] [2022-12-13 21:08:04,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140602714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:04,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:04,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:08:04,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879302222] [2022-12-13 21:08:04,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:04,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:08:04,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:08:04,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:08:04,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:04,520 INFO L87 Difference]: Start difference. First operand 794 states and 1032 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:08:04,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:08:04,568 INFO L93 Difference]: Finished difference Result 796 states and 1033 transitions. [2022-12-13 21:08:04,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:08:04,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 56 [2022-12-13 21:08:04,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:08:04,571 INFO L225 Difference]: With dead ends: 796 [2022-12-13 21:08:04,571 INFO L226 Difference]: Without dead ends: 793 [2022-12-13 21:08:04,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:04,572 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 243 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:08:04,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 282 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:08:04,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2022-12-13 21:08:04,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 793. [2022-12-13 21:08:04,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 605 states have (on average 1.2661157024793388) internal successors, (766), 616 states have internal predecessors, (766), 133 states have call successors, (133), 55 states have call predecessors, (133), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-12-13 21:08:04,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1030 transitions. [2022-12-13 21:08:04,621 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1030 transitions. Word has length 56 [2022-12-13 21:08:04,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:08:04,621 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1030 transitions. [2022-12-13 21:08:04,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:08:04,621 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1030 transitions. [2022-12-13 21:08:04,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 21:08:04,622 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:08:04,622 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 21:08:04,633 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-13 21:08:04,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:04,824 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:08:04,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:04,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1556836143, now seen corresponding path program 1 times [2022-12-13 21:08:04,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:08:04,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401160515] [2022-12-13 21:08:04,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:04,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:04,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:08:04,832 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:08:04,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-13 21:08:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:05,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:08:05,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:05,225 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 21:08:05,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:08:05,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:08:05,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401160515] [2022-12-13 21:08:05,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401160515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:05,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:05,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:08:05,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692164231] [2022-12-13 21:08:05,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:05,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:08:05,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:08:05,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:08:05,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:05,227 INFO L87 Difference]: Start difference. First operand 793 states and 1030 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:08:05,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:08:05,275 INFO L93 Difference]: Finished difference Result 795 states and 1031 transitions. [2022-12-13 21:08:05,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:08:05,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2022-12-13 21:08:05,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:08:05,278 INFO L225 Difference]: With dead ends: 795 [2022-12-13 21:08:05,278 INFO L226 Difference]: Without dead ends: 792 [2022-12-13 21:08:05,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:05,279 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 240 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:08:05,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 280 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:08:05,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2022-12-13 21:08:05,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2022-12-13 21:08:05,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 605 states have (on average 1.2644628099173554) internal successors, (765), 615 states have internal predecessors, (765), 132 states have call successors, (132), 55 states have call predecessors, (132), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-12-13 21:08:05,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1028 transitions. [2022-12-13 21:08:05,330 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1028 transitions. Word has length 57 [2022-12-13 21:08:05,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:08:05,331 INFO L495 AbstractCegarLoop]: Abstraction has 792 states and 1028 transitions. [2022-12-13 21:08:05,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:08:05,331 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1028 transitions. [2022-12-13 21:08:05,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 21:08:05,331 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:08:05,331 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 21:08:05,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-13 21:08:05,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:05,532 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:08:05,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:05,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1017294447, now seen corresponding path program 1 times [2022-12-13 21:08:05,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:08:05,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127473760] [2022-12-13 21:08:05,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:05,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:05,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:08:05,534 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:08:05,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-13 21:08:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:05,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:08:05,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:05,839 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 21:08:05,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:08:05,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:08:05,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127473760] [2022-12-13 21:08:05,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127473760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:05,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:05,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:08:05,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899600623] [2022-12-13 21:08:05,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:05,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:08:05,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:08:05,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:08:05,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:05,841 INFO L87 Difference]: Start difference. First operand 792 states and 1028 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:08:05,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:08:05,912 INFO L93 Difference]: Finished difference Result 794 states and 1029 transitions. [2022-12-13 21:08:05,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:08:05,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 58 [2022-12-13 21:08:05,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:08:05,916 INFO L225 Difference]: With dead ends: 794 [2022-12-13 21:08:05,916 INFO L226 Difference]: Without dead ends: 791 [2022-12-13 21:08:05,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:05,917 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 237 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:08:05,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 278 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:08:05,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-12-13 21:08:05,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 791. [2022-12-13 21:08:05,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 605 states have (on average 1.262809917355372) internal successors, (764), 614 states have internal predecessors, (764), 131 states have call successors, (131), 55 states have call predecessors, (131), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-12-13 21:08:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1026 transitions. [2022-12-13 21:08:05,992 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1026 transitions. Word has length 58 [2022-12-13 21:08:05,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:08:05,992 INFO L495 AbstractCegarLoop]: Abstraction has 791 states and 1026 transitions. [2022-12-13 21:08:05,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:08:05,992 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1026 transitions. [2022-12-13 21:08:05,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 21:08:05,993 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:08:05,993 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 21:08:06,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-13 21:08:06,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:06,194 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:08:06,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:06,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1471375922, now seen corresponding path program 1 times [2022-12-13 21:08:06,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:08:06,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852181188] [2022-12-13 21:08:06,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:06,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:06,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:08:06,195 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:08:06,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-13 21:08:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:06,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:08:06,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:06,474 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 21:08:06,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:08:06,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:08:06,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852181188] [2022-12-13 21:08:06,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852181188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:06,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:06,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:08:06,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819047056] [2022-12-13 21:08:06,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:06,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:08:06,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:08:06,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:08:06,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:06,475 INFO L87 Difference]: Start difference. First operand 791 states and 1026 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:08:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:08:06,538 INFO L93 Difference]: Finished difference Result 793 states and 1027 transitions. [2022-12-13 21:08:06,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:08:06,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 59 [2022-12-13 21:08:06,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:08:06,542 INFO L225 Difference]: With dead ends: 793 [2022-12-13 21:08:06,542 INFO L226 Difference]: Without dead ends: 781 [2022-12-13 21:08:06,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:06,543 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 234 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:08:06,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:08:06,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2022-12-13 21:08:06,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 781. [2022-12-13 21:08:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 596 states have (on average 1.261744966442953) internal successors, (752), 604 states have internal predecessors, (752), 130 states have call successors, (130), 55 states have call predecessors, (130), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-12-13 21:08:06,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1013 transitions. [2022-12-13 21:08:06,634 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1013 transitions. Word has length 59 [2022-12-13 21:08:06,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:08:06,635 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 1013 transitions. [2022-12-13 21:08:06,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:08:06,635 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1013 transitions. [2022-12-13 21:08:06,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-13 21:08:06,637 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:08:06,637 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:06,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-13 21:08:06,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:06,838 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:08:06,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:06,838 INFO L85 PathProgramCache]: Analyzing trace with hash 995053634, now seen corresponding path program 1 times [2022-12-13 21:08:06,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:08:06,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104287733] [2022-12-13 21:08:06,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:06,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:06,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:08:06,839 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:08:06,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-13 21:08:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:07,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:08:07,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:07,155 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-12-13 21:08:07,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:08:07,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:08:07,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104287733] [2022-12-13 21:08:07,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104287733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:07,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:07,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:08:07,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907921097] [2022-12-13 21:08:07,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:07,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:08:07,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:08:07,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:08:07,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:07,156 INFO L87 Difference]: Start difference. First operand 781 states and 1013 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-12-13 21:08:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:08:07,264 INFO L93 Difference]: Finished difference Result 1611 states and 2097 transitions. [2022-12-13 21:08:07,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:08:07,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 159 [2022-12-13 21:08:07,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:08:07,267 INFO L225 Difference]: With dead ends: 1611 [2022-12-13 21:08:07,267 INFO L226 Difference]: Without dead ends: 845 [2022-12-13 21:08:07,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:08:07,269 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 41 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:08:07,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 533 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:08:07,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-12-13 21:08:07,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 835. [2022-12-13 21:08:07,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 649 states have (on average 1.2727272727272727) internal successors, (826), 657 states have internal predecessors, (826), 130 states have call successors, (130), 56 states have call predecessors, (130), 55 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-12-13 21:08:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1087 transitions. [2022-12-13 21:08:07,326 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1087 transitions. Word has length 159 [2022-12-13 21:08:07,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:08:07,326 INFO L495 AbstractCegarLoop]: Abstraction has 835 states and 1087 transitions. [2022-12-13 21:08:07,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-12-13 21:08:07,326 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1087 transitions. [2022-12-13 21:08:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-12-13 21:08:07,328 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:08:07,328 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:07,342 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-13 21:08:07,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:07,529 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:08:07,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:07,529 INFO L85 PathProgramCache]: Analyzing trace with hash 548205183, now seen corresponding path program 1 times [2022-12-13 21:08:07,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:08:07,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882081180] [2022-12-13 21:08:07,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:07,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:07,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:08:07,531 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:08:07,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-13 21:08:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:07,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 21:08:07,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-12-13 21:08:07,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:08:07,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:08:07,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882081180] [2022-12-13 21:08:07,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882081180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:07,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:07,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:08:07,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029517540] [2022-12-13 21:08:07,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:07,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:08:07,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:08:07,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:08:07,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:08:07,946 INFO L87 Difference]: Start difference. First operand 835 states and 1087 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 21:08:08,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:08:08,091 INFO L93 Difference]: Finished difference Result 1667 states and 2183 transitions. [2022-12-13 21:08:08,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:08:08,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 168 [2022-12-13 21:08:08,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:08:08,097 INFO L225 Difference]: With dead ends: 1667 [2022-12-13 21:08:08,097 INFO L226 Difference]: Without dead ends: 843 [2022-12-13 21:08:08,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:08:08,100 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 0 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:08:08,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1078 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:08:08,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-12-13 21:08:08,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2022-12-13 21:08:08,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 653 states have (on average 1.2710566615620214) internal successors, (830), 665 states have internal predecessors, (830), 130 states have call successors, (130), 56 states have call predecessors, (130), 59 states have return successors, (143), 129 states have call predecessors, (143), 129 states have call successors, (143) [2022-12-13 21:08:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1103 transitions. [2022-12-13 21:08:08,221 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1103 transitions. Word has length 168 [2022-12-13 21:08:08,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:08:08,222 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 1103 transitions. [2022-12-13 21:08:08,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 21:08:08,222 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1103 transitions. [2022-12-13 21:08:08,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-12-13 21:08:08,225 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:08:08,226 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:08,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-13 21:08:08,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:08,428 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:08:08,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:08,429 INFO L85 PathProgramCache]: Analyzing trace with hash 789332777, now seen corresponding path program 1 times [2022-12-13 21:08:08,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:08:08,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892180364] [2022-12-13 21:08:08,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:08,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:08,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:08:08,435 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:08:08,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-13 21:08:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:08,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 21:08:08,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:08,880 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-13 21:08:08,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:08:08,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:08:08,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892180364] [2022-12-13 21:08:08,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892180364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:08,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:08,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:08:08,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757458005] [2022-12-13 21:08:08,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:08,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:08:08,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:08:08,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:08:08,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:08:08,881 INFO L87 Difference]: Start difference. First operand 843 states and 1103 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 21:08:09,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:08:09,080 INFO L93 Difference]: Finished difference Result 2241 states and 3010 transitions. [2022-12-13 21:08:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:08:09,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 174 [2022-12-13 21:08:09,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:08:09,086 INFO L225 Difference]: With dead ends: 2241 [2022-12-13 21:08:09,086 INFO L226 Difference]: Without dead ends: 1417 [2022-12-13 21:08:09,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 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 21:08:09,089 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 321 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:08:09,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1344 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:08:09,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2022-12-13 21:08:09,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 855. [2022-12-13 21:08:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 665 states have (on average 1.2661654135338345) internal successors, (842), 677 states have internal predecessors, (842), 130 states have call successors, (130), 56 states have call predecessors, (130), 59 states have return successors, (143), 129 states have call predecessors, (143), 129 states have call successors, (143) [2022-12-13 21:08:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1115 transitions. [2022-12-13 21:08:09,169 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1115 transitions. Word has length 174 [2022-12-13 21:08:09,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:08:09,170 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 1115 transitions. [2022-12-13 21:08:09,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 21:08:09,170 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1115 transitions. [2022-12-13 21:08:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-12-13 21:08:09,173 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:08:09,174 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:09,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-13 21:08:09,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:09,374 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:08:09,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:09,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1343184880, now seen corresponding path program 1 times [2022-12-13 21:08:09,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:08:09,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143472236] [2022-12-13 21:08:09,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:09,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:09,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:08:09,377 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:08:09,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-12-13 21:08:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:09,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 21:08:09,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:09,974 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-13 21:08:09,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:08:09,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:08:09,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143472236] [2022-12-13 21:08:09,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143472236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:09,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:09,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 21:08:09,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718722337] [2022-12-13 21:08:09,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:09,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 21:08:09,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:08:09,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 21:08:09,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:08:09,977 INFO L87 Difference]: Start difference. First operand 855 states and 1115 transitions. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 8 states have internal predecessors, (115), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) [2022-12-13 21:08:12,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 21:08:12,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:08:12,877 INFO L93 Difference]: Finished difference Result 2235 states and 2993 transitions. [2022-12-13 21:08:12,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 21:08:12,878 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 8 states have internal predecessors, (115), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) Word has length 176 [2022-12-13 21:08:12,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:08:12,881 INFO L225 Difference]: With dead ends: 2235 [2022-12-13 21:08:12,881 INFO L226 Difference]: Without dead ends: 1399 [2022-12-13 21:08:12,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-13 21:08:12,883 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 203 mSDsluCounter, 2933 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 3317 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-12-13 21:08:12,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 3317 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-12-13 21:08:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2022-12-13 21:08:12,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 887. [2022-12-13 21:08:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 693 states have (on average 1.2554112554112553) internal successors, (870), 701 states have internal predecessors, (870), 130 states have call successors, (130), 56 states have call predecessors, (130), 63 states have return successors, (151), 137 states have call predecessors, (151), 129 states have call successors, (151) [2022-12-13 21:08:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1151 transitions. [2022-12-13 21:08:12,954 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1151 transitions. Word has length 176 [2022-12-13 21:08:12,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:08:12,955 INFO L495 AbstractCegarLoop]: Abstraction has 887 states and 1151 transitions. [2022-12-13 21:08:12,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 8 states have internal predecessors, (115), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) [2022-12-13 21:08:12,955 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1151 transitions. [2022-12-13 21:08:12,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-12-13 21:08:12,957 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:08:12,957 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:12,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-12-13 21:08:13,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:13,158 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:08:13,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:13,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1172547930, now seen corresponding path program 2 times [2022-12-13 21:08:13,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:08:13,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401453797] [2022-12-13 21:08:13,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 21:08:13,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:13,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:08:13,161 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:08:13,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-12-13 21:08:13,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 21:08:13,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:08:13,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 21:08:13,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-12-13 21:08:13,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:08:13,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:08:13,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401453797] [2022-12-13 21:08:13,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401453797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:13,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:13,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:08:13,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285768686] [2022-12-13 21:08:13,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:13,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:08:13,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:08:13,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:08:13,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:08:13,645 INFO L87 Difference]: Start difference. First operand 887 states and 1151 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 21:08:14,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:08:14,602 INFO L93 Difference]: Finished difference Result 1941 states and 2554 transitions. [2022-12-13 21:08:14,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:08:14,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 182 [2022-12-13 21:08:14,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:08:14,605 INFO L225 Difference]: With dead ends: 1941 [2022-12-13 21:08:14,605 INFO L226 Difference]: Without dead ends: 1073 [2022-12-13 21:08:14,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:08:14,607 INFO L413 NwaCegarLoop]: 509 mSDtfsCounter, 700 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 2096 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 21:08:14,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 2096 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 21:08:14,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2022-12-13 21:08:14,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 887. [2022-12-13 21:08:14,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 693 states have (on average 1.2525252525252526) internal successors, (868), 701 states have internal predecessors, (868), 130 states have call successors, (130), 56 states have call predecessors, (130), 63 states have return successors, (151), 137 states have call predecessors, (151), 129 states have call successors, (151) [2022-12-13 21:08:14,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1149 transitions. [2022-12-13 21:08:14,715 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1149 transitions. Word has length 182 [2022-12-13 21:08:14,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:08:14,716 INFO L495 AbstractCegarLoop]: Abstraction has 887 states and 1149 transitions. [2022-12-13 21:08:14,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 21:08:14,716 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1149 transitions. [2022-12-13 21:08:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-12-13 21:08:14,720 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:08:14,720 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:14,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-12-13 21:08:14,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:14,921 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:08:14,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:14,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1355909115, now seen corresponding path program 1 times [2022-12-13 21:08:14,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:08:14,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712666146] [2022-12-13 21:08:14,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:14,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:14,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:08:14,924 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:08:14,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-12-13 21:08:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:15,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 1264 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 21:08:15,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:15,940 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 33 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:08:15,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:08:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-12-13 21:08:16,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:08:16,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712666146] [2022-12-13 21:08:16,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712666146] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:08:16,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:08:16,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-12-13 21:08:16,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94181707] [2022-12-13 21:08:16,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:08:16,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 21:08:16,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:08:16,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 21:08:16,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-12-13 21:08:16,621 INFO L87 Difference]: Start difference. First operand 887 states and 1149 transitions. Second operand has 16 states, 16 states have (on average 9.25) internal successors, (148), 12 states have internal predecessors, (148), 4 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) [2022-12-13 21:08:19,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 21:08:20,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 21:08:20,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:08:20,701 INFO L93 Difference]: Finished difference Result 1981 states and 2600 transitions. [2022-12-13 21:08:20,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 21:08:20,703 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.25) internal successors, (148), 12 states have internal predecessors, (148), 4 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) Word has length 198 [2022-12-13 21:08:20,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:08:20,706 INFO L225 Difference]: With dead ends: 1981 [2022-12-13 21:08:20,706 INFO L226 Difference]: Without dead ends: 1113 [2022-12-13 21:08:20,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-12-13 21:08:20,707 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 120 mSDsluCounter, 3185 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 3514 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-12-13 21:08:20,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 3514 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2022-12-13 21:08:20,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2022-12-13 21:08:20,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 895. [2022-12-13 21:08:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 697 states have (on average 1.2510760401721663) internal successors, (872), 705 states have internal predecessors, (872), 134 states have call successors, (134), 56 states have call predecessors, (134), 63 states have return successors, (159), 141 states have call predecessors, (159), 133 states have call successors, (159) [2022-12-13 21:08:20,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1165 transitions. [2022-12-13 21:08:20,816 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1165 transitions. Word has length 198 [2022-12-13 21:08:20,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:08:20,816 INFO L495 AbstractCegarLoop]: Abstraction has 895 states and 1165 transitions. [2022-12-13 21:08:20,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.25) internal successors, (148), 12 states have internal predecessors, (148), 4 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) [2022-12-13 21:08:20,816 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1165 transitions. [2022-12-13 21:08:20,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-12-13 21:08:20,819 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:08:20,819 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:20,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-12-13 21:08:21,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:21,020 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:08:21,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:21,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1971886383, now seen corresponding path program 2 times [2022-12-13 21:08:21,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:08:21,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124686805] [2022-12-13 21:08:21,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 21:08:21,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:21,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:08:21,022 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:08:21,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-12-13 21:08:22,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 21:08:22,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:08:22,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:08:22,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-13 21:08:23,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:08:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-12-13 21:08:23,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:08:23,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124686805] [2022-12-13 21:08:23,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124686805] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:08:23,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:08:23,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-12-13 21:08:23,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251975117] [2022-12-13 21:08:23,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:08:23,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:08:23,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:08:23,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:08:23,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:08:23,581 INFO L87 Difference]: Start difference. First operand 895 states and 1165 transitions. Second operand has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 4 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-12-13 21:08:25,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:08:25,342 INFO L93 Difference]: Finished difference Result 5268 states and 6887 transitions. [2022-12-13 21:08:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:08:25,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 4 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 204 [2022-12-13 21:08:25,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:08:25,355 INFO L225 Difference]: With dead ends: 5268 [2022-12-13 21:08:25,355 INFO L226 Difference]: Without dead ends: 5260 [2022-12-13 21:08:25,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 403 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 21:08:25,356 INFO L413 NwaCegarLoop]: 661 mSDtfsCounter, 1259 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:08:25,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 1537 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-13 21:08:25,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5260 states. [2022-12-13 21:08:25,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5260 to 5227. [2022-12-13 21:08:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5227 states, 4079 states have (on average 1.255945084579554) internal successors, (5123), 4135 states have internal predecessors, (5123), 784 states have call successors, (784), 316 states have call predecessors, (784), 363 states have return successors, (939), 823 states have call predecessors, (939), 783 states have call successors, (939) [2022-12-13 21:08:25,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5227 states to 5227 states and 6846 transitions. [2022-12-13 21:08:25,982 INFO L78 Accepts]: Start accepts. Automaton has 5227 states and 6846 transitions. Word has length 204 [2022-12-13 21:08:25,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:08:25,983 INFO L495 AbstractCegarLoop]: Abstraction has 5227 states and 6846 transitions. [2022-12-13 21:08:25,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 4 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-12-13 21:08:25,983 INFO L276 IsEmpty]: Start isEmpty. Operand 5227 states and 6846 transitions. [2022-12-13 21:08:25,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-12-13 21:08:25,988 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:08:25,988 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:26,029 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-12-13 21:08:26,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:26,189 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:08:26,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:26,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1311963663, now seen corresponding path program 1 times [2022-12-13 21:08:26,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:08:26,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996912324] [2022-12-13 21:08:26,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:26,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:26,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:08:26,192 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:08:26,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-12-13 21:08:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:27,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 21:08:27,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-13 21:08:27,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:08:27,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:08:27,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996912324] [2022-12-13 21:08:27,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [996912324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:27,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:27,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:08:27,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429442463] [2022-12-13 21:08:27,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:27,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:08:27,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:08:27,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:08:27,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:08:27,170 INFO L87 Difference]: Start difference. First operand 5227 states and 6846 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 5 states have internal predecessors, (126), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 21:08:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:08:28,220 INFO L93 Difference]: Finished difference Result 12689 states and 16971 transitions. [2022-12-13 21:08:28,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:08:28,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 5 states have internal predecessors, (126), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 204 [2022-12-13 21:08:28,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:08:28,239 INFO L225 Difference]: With dead ends: 12689 [2022-12-13 21:08:28,239 INFO L226 Difference]: Without dead ends: 7481 [2022-12-13 21:08:28,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:08:28,246 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 93 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:08:28,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1821 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:08:28,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7481 states. [2022-12-13 21:08:28,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7481 to 5299. [2022-12-13 21:08:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 4151 states have (on average 1.251505661286437) internal successors, (5195), 4183 states have internal predecessors, (5195), 784 states have call successors, (784), 316 states have call predecessors, (784), 363 states have return successors, (939), 847 states have call predecessors, (939), 783 states have call successors, (939) [2022-12-13 21:08:28,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 6918 transitions. [2022-12-13 21:08:28,979 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 6918 transitions. Word has length 204 [2022-12-13 21:08:28,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:08:28,979 INFO L495 AbstractCegarLoop]: Abstraction has 5299 states and 6918 transitions. [2022-12-13 21:08:28,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 5 states have internal predecessors, (126), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 21:08:28,979 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 6918 transitions. [2022-12-13 21:08:28,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-12-13 21:08:28,984 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:08:28,984 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:29,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-12-13 21:08:29,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:29,185 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:08:29,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:29,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1047615131, now seen corresponding path program 2 times [2022-12-13 21:08:29,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:08:29,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651672978] [2022-12-13 21:08:29,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 21:08:29,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:29,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:08:29,187 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:08:29,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-12-13 21:08:29,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 21:08:29,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:08:29,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:08:29,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2022-12-13 21:08:29,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:08:29,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:08:29,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651672978] [2022-12-13 21:08:29,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651672978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:29,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:29,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:08:29,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005742730] [2022-12-13 21:08:29,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:29,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:08:29,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:08:29,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:08:29,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:08:29,743 INFO L87 Difference]: Start difference. First operand 5299 states and 6918 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-12-13 21:08:31,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:08:31,213 INFO L93 Difference]: Finished difference Result 16889 states and 22190 transitions. [2022-12-13 21:08:31,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:08:31,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 210 [2022-12-13 21:08:31,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:08:31,238 INFO L225 Difference]: With dead ends: 16889 [2022-12-13 21:08:31,239 INFO L226 Difference]: Without dead ends: 11609 [2022-12-13 21:08:31,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:08:31,247 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 330 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:08:31,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 934 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:08:31,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11609 states. [2022-12-13 21:08:32,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11609 to 5323. [2022-12-13 21:08:32,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5323 states, 4175 states have (on average 1.2500598802395209) internal successors, (5219), 4215 states have internal predecessors, (5219), 784 states have call successors, (784), 316 states have call predecessors, (784), 363 states have return successors, (939), 839 states have call predecessors, (939), 783 states have call successors, (939) [2022-12-13 21:08:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5323 states to 5323 states and 6942 transitions. [2022-12-13 21:08:32,162 INFO L78 Accepts]: Start accepts. Automaton has 5323 states and 6942 transitions. Word has length 210 [2022-12-13 21:08:32,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:08:32,163 INFO L495 AbstractCegarLoop]: Abstraction has 5323 states and 6942 transitions. [2022-12-13 21:08:32,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-12-13 21:08:32,163 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 6942 transitions. [2022-12-13 21:08:32,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-12-13 21:08:32,167 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:08:32,168 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:32,183 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-12-13 21:08:32,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:32,369 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:08:32,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:32,370 INFO L85 PathProgramCache]: Analyzing trace with hash -375098353, now seen corresponding path program 1 times [2022-12-13 21:08:32,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:08:32,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597729442] [2022-12-13 21:08:32,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:32,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:32,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:08:32,377 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:08:32,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-12-13 21:08:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:33,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 1310 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 21:08:33,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:33,378 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-12-13 21:08:33,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:08:33,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:08:33,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597729442] [2022-12-13 21:08:33,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597729442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:08:33,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:08:33,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:08:33,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163516291] [2022-12-13 21:08:33,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:08:33,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:08:33,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:08:33,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:08:33,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:08:33,379 INFO L87 Difference]: Start difference. First operand 5323 states and 6942 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-12-13 21:08:34,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:08:34,606 INFO L93 Difference]: Finished difference Result 14273 states and 19239 transitions. [2022-12-13 21:08:34,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:08:34,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 217 [2022-12-13 21:08:34,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:08:34,624 INFO L225 Difference]: With dead ends: 14273 [2022-12-13 21:08:34,624 INFO L226 Difference]: Without dead ends: 8969 [2022-12-13 21:08:34,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:08:34,631 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 147 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:08:34,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1493 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:08:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8969 states. [2022-12-13 21:08:35,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8969 to 5443. [2022-12-13 21:08:35,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5443 states, 4271 states have (on average 1.2500585343011004) internal successors, (5339), 4287 states have internal predecessors, (5339), 808 states have call successors, (808), 316 states have call predecessors, (808), 363 states have return successors, (963), 887 states have call predecessors, (963), 807 states have call successors, (963) [2022-12-13 21:08:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5443 states to 5443 states and 7110 transitions. [2022-12-13 21:08:35,531 INFO L78 Accepts]: Start accepts. Automaton has 5443 states and 7110 transitions. Word has length 217 [2022-12-13 21:08:35,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:08:35,531 INFO L495 AbstractCegarLoop]: Abstraction has 5443 states and 7110 transitions. [2022-12-13 21:08:35,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-12-13 21:08:35,532 INFO L276 IsEmpty]: Start isEmpty. Operand 5443 states and 7110 transitions. [2022-12-13 21:08:35,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-12-13 21:08:35,536 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:08:35,537 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:35,558 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-12-13 21:08:35,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:35,738 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:08:35,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:08:35,739 INFO L85 PathProgramCache]: Analyzing trace with hash 301111993, now seen corresponding path program 1 times [2022-12-13 21:08:35,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:08:35,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156702080] [2022-12-13 21:08:35,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:08:35,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:08:35,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:08:35,746 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:08:35,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-12-13 21:08:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:08:39,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 1327 conjuncts, 79 conjunts are in the unsatisfiable core [2022-12-13 21:08:39,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:08:39,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 [2022-12-13 21:08:39,844 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 7 treesize of output 6 [2022-12-13 21:08:40,326 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 11 [2022-12-13 21:08:40,493 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2175 (Array (_ BitVec 64) (_ BitVec 8))) (|ldv_init_zalloc_#t~malloc63.base| (_ BitVec 64))) (and (= (select |c_old(#valid)| |ldv_init_zalloc_#t~malloc63.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc63.base| (_ bv1 1))) (= (store |c_old(#memory_int)| |ldv_init_zalloc_#t~malloc63.base| v_ArrVal_2175) |c_#memory_int|))) (exists ((|v_ldv_init_zalloc_#t~malloc63.base_BEFORE_CALL_2| (_ BitVec 64))) (= (bvadd (select |c_#valid| |v_ldv_init_zalloc_#t~malloc63.base_BEFORE_CALL_2|) (_ bv1 1)) (_ bv0 1)))) is different from true [2022-12-13 21:08:40,517 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 21:08:40,521 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 11 [2022-12-13 21:08:40,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:08:40,689 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 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 21:08:40,723 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 21:08:40,723 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 19 treesize of output 27 [2022-12-13 21:08:41,143 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 21:08:51,354 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 11 [2022-12-13 21:09:07,672 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-12-13 21:09:07,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-12-13 21:09:09,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-12-13 21:09:13,627 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 11 [2022-12-13 21:09:34,535 INFO L321 Elim1Store]: treesize reduction 66, result has 34.0 percent of original size [2022-12-13 21:09:34,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 59 [2022-12-13 21:09:35,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-12-13 21:09:41,356 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_1| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_1|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-12-13 21:09:51,959 INFO L321 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-12-13 21:09:51,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 40 [2022-12-13 21:09:54,389 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_6| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_6|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-12-13 21:09:54,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 21:09:56,682 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_7| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_7|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-12-13 21:09:58,921 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_8| (_ BitVec 64))) (= ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)) (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_8|))) is different from true [2022-12-13 21:09:59,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 21:09:59,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 21:10:01,398 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_9| (_ BitVec 64))) (= ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)) (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_9|))) is different from true [2022-12-13 21:10:01,570 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 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 21:10:01,582 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 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 21:10:01,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:01,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 110 [2022-12-13 21:10:01,696 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 24 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 104 not checked. [2022-12-13 21:10:01,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:10:01,732 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2187 (Array (_ BitVec 64) (_ BitVec 8))) (|ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ BitVec 64))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2187) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|))) (concat (concat (concat (concat (concat (concat (concat (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv23 64))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv22 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv21 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv20 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv19 64)))) (select .cse0 (bvadd (_ bv18 64) |ULTIMATE.start_usb_acecad_probe_~id#1.offset|))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv17 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv16 64))))) (_ bv0 64))) is different from false [2022-12-13 21:10:01,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:10:01,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156702080] [2022-12-13 21:10:01,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156702080] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:10:01,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1412291270] [2022-12-13 21:10:01,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:10:01,810 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 21:10:01,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 21:10:01,811 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 21:10:01,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62f50c98-fa4e-4eff-ae39-32c84810d179/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process