./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-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_adbdd61d-2443-413f-ab56-781933f38dab/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_adbdd61d-2443-413f-ab56-781933f38dab/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 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b --- 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 16:14:36,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:14:36,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:14:36,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:14:36,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:14:36,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:14:36,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:14:36,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:14:36,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:14:36,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:14:36,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:14:36,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:14:36,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:14:36,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:14:36,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:14:36,166 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:14:36,166 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:14:36,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:14:36,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:14:36,169 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:14:36,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:14:36,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:14:36,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:14:36,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:14:36,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:14:36,178 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:14:36,178 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:14:36,179 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:14:36,179 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:14:36,180 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:14:36,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:14:36,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:14:36,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:14:36,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:14:36,182 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:14:36,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:14:36,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:14:36,183 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:14:36,183 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:14:36,184 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:14:36,185 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:14:36,185 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-12-13 16:14:36,202 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:14:36,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:14:36,203 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:14:36,203 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:14:36,203 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:14:36,203 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:14:36,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:14:36,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:14:36,204 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:14:36,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:14:36,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:14:36,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:14:36,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:14:36,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:14:36,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:14:36,210 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:14:36,211 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:14:36,211 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:14:36,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:14:36,211 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:14:36,211 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:14:36,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:14:36,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:14:36,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:14:36,211 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:14:36,212 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:14:36,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:14:36,212 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:14:36,212 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:14:36,212 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:14:36,212 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:14:36,212 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:14:36,212 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_adbdd61d-2443-413f-ab56-781933f38dab/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_adbdd61d-2443-413f-ab56-781933f38dab/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 -> 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b [2022-12-13 16:14:36,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:14:36,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:14:36,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:14:36,400 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:14:36,400 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:14:36,401 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-12-13 16:14:39,037 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:14:39,263 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:14:39,264 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-12-13 16:14:39,278 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/data/c361a6b27/4bfcd0723b6e49d8ad9416b05867d62d/FLAG4c7ae3982 [2022-12-13 16:14:39,288 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/data/c361a6b27/4bfcd0723b6e49d8ad9416b05867d62d [2022-12-13 16:14:39,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:14:39,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:14:39,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:14:39,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:14:39,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:14:39,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:14:39" (1/1) ... [2022-12-13 16:14:39,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d6d4329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:14:39, skipping insertion in model container [2022-12-13 16:14:39,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:14:39" (1/1) ... [2022-12-13 16:14:39,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:14:39,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:14:39,693 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 16:14:39,694 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 16:14:39,727 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:14:39,783 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-12-13 16:14:39,786 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-12-13 16:14:39,794 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 16:14:39,796 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 16:14:39,799 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 16:14:39,812 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 16:14:39,818 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 16:14:39,823 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_coherent [2022-12-13 16:14:39,824 WARN L623 FunctionHandler]: Unknown extern function strlcpy [2022-12-13 16:14:39,825 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 16:14:39,826 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 16:14:39,826 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 16:14:39,828 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:14:39,829 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:14:39,829 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:14:39,845 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:14:39,846 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:14:39,846 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:14:39,849 WARN L623 FunctionHandler]: Unknown extern function input_register_device [2022-12-13 16:14:39,849 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 16:14:39,850 WARN L623 FunctionHandler]: Unknown extern function input_free_device [2022-12-13 16:14:39,850 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 16:14:39,854 WARN L623 FunctionHandler]: Unknown extern function input_unregister_device [2022-12-13 16:14:39,855 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 16:14:39,855 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 16:14:39,859 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 16:14:39,867 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-12-13 16:14:39,879 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-12-13 16:14:39,881 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_urb [2022-12-13 16:14:39,882 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-12-13 16:14:39,882 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-12-13 16:14:39,884 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_adbdd61d-2443-413f-ab56-781933f38dab/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-12-13 16:14:39,890 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:14:39,893 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:14:39,897 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:14:39,908 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:14:39,910 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:14:39,910 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:14:39,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:14:39,926 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:14:39,982 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 16:14:39,982 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 16:14:39,984 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:14:39,987 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-12-13 16:14:39,988 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-12-13 16:14:39,988 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 16:14:39,989 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 16:14:39,989 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 16:14:39,995 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 16:14:39,997 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 16:14:39,999 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_coherent [2022-12-13 16:14:40,000 WARN L623 FunctionHandler]: Unknown extern function strlcpy [2022-12-13 16:14:40,001 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 16:14:40,001 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 16:14:40,002 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 16:14:40,008 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:14:40,008 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:14:40,008 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:14:40,009 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:14:40,009 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:14:40,009 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:14:40,010 WARN L623 FunctionHandler]: Unknown extern function input_register_device [2022-12-13 16:14:40,010 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 16:14:40,011 WARN L623 FunctionHandler]: Unknown extern function input_free_device [2022-12-13 16:14:40,011 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 16:14:40,011 WARN L623 FunctionHandler]: Unknown extern function input_unregister_device [2022-12-13 16:14:40,012 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 16:14:40,012 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 16:14:40,013 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 16:14:40,014 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-12-13 16:14:40,016 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-12-13 16:14:40,016 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_urb [2022-12-13 16:14:40,017 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-12-13 16:14:40,017 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-12-13 16:14:40,018 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_adbdd61d-2443-413f-ab56-781933f38dab/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-12-13 16:14:40,019 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:14:40,020 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:14:40,021 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:14:40,022 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:14:40,024 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:14:40,024 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:14:40,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:14:40,042 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:14:40,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:14:40 WrapperNode [2022-12-13 16:14:40,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:14:40,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:14:40,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:14:40,043 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:14:40,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:14:40" (1/1) ... [2022-12-13 16:14:40,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:14:40" (1/1) ... [2022-12-13 16:14:40,091 INFO L138 Inliner]: procedures = 109, calls = 318, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 800 [2022-12-13 16:14:40,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:14:40,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:14:40,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:14:40,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:14:40,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:14:40" (1/1) ... [2022-12-13 16:14:40,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:14:40" (1/1) ... [2022-12-13 16:14:40,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:14:40" (1/1) ... [2022-12-13 16:14:40,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:14:40" (1/1) ... [2022-12-13 16:14:40,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:14:40" (1/1) ... [2022-12-13 16:14:40,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:14:40" (1/1) ... [2022-12-13 16:14:40,125 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:14:40" (1/1) ... [2022-12-13 16:14:40,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:14:40" (1/1) ... [2022-12-13 16:14:40,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:14:40,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:14:40,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:14:40,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:14:40,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:14:40" (1/1) ... [2022-12-13 16:14:40,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:14:40,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:14:40,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:14:40,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:14:40,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-12-13 16:14:40,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-12-13 16:14:40,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 16:14:40,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-12-13 16:14:40,188 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-12-13 16:14:40,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-12-13 16:14:40,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-12-13 16:14:40,188 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-12-13 16:14:40,188 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-12-13 16:14:40,189 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-12-13 16:14:40,189 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-12-13 16:14:40,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 16:14:40,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-12-13 16:14:40,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-12-13 16:14:40,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-12-13 16:14:40,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-12-13 16:14:40,189 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-12-13 16:14:40,189 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-12-13 16:14:40,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-12-13 16:14:40,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-12-13 16:14:40,189 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 16:14:40,189 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 16:14:40,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 16:14:40,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:14:40,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-12-13 16:14:40,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-12-13 16:14:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 16:14:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-12-13 16:14:40,190 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-12-13 16:14:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-12-13 16:14:40,190 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-12-13 16:14:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-12-13 16:14:40,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-12-13 16:14:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 16:14:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:14:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 16:14:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-12-13 16:14:40,190 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-12-13 16:14:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-12-13 16:14:40,190 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-12-13 16:14:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:14:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:14:40,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:14:40,408 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:14:40,410 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:14:40,471 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-12-13 16:14:40,918 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:14:40,924 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:14:40,924 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 16:14:40,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:14:40 BoogieIcfgContainer [2022-12-13 16:14:40,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:14:40,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:14:40,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:14:40,940 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:14:40,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:14:39" (1/3) ... [2022-12-13 16:14:40,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c6b31c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:14:40, skipping insertion in model container [2022-12-13 16:14:40,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:14:40" (2/3) ... [2022-12-13 16:14:40,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c6b31c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:14:40, skipping insertion in model container [2022-12-13 16:14:40,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:14:40" (3/3) ... [2022-12-13 16:14:40,942 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-12-13 16:14:40,956 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:14:40,956 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 16:14:40,994 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:14:40,999 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;@73f7dbad, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:14:40,999 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 16:14:41,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 186 states have internal predecessors, (232), 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 16:14:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 16:14:41,009 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:14:41,010 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 16:14:41,010 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:14:41,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:14:41,014 INFO L85 PathProgramCache]: Analyzing trace with hash -914963392, now seen corresponding path program 1 times [2022-12-13 16:14:41,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:14:41,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251878367] [2022-12-13 16:14:41,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:41,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:14:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:41,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:41,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:41,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:41,257 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 16:14:41,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:14:41,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251878367] [2022-12-13 16:14:41,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251878367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:14:41,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:14:41,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:14:41,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651395472] [2022-12-13 16:14:41,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:14:41,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:14:41,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:14:41,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:14:41,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:14:41,285 INFO L87 Difference]: Start difference. First operand has 235 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 186 states have internal predecessors, (232), 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 16:14:41,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:14:41,650 INFO L93 Difference]: Finished difference Result 472 states and 646 transitions. [2022-12-13 16:14:41,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:14:41,652 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 16:14:41,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:14:41,659 INFO L225 Difference]: With dead ends: 472 [2022-12-13 16:14:41,659 INFO L226 Difference]: Without dead ends: 231 [2022-12-13 16:14:41,662 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 16:14:41,664 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 94 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:14:41,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 413 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:14:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-12-13 16:14:41,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2022-12-13 16:14:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 170 states have (on average 1.2941176470588236) internal successors, (220), 175 states have internal predecessors, (220), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-13 16:14:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 294 transitions. [2022-12-13 16:14:41,708 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 294 transitions. Word has length 32 [2022-12-13 16:14:41,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:14:41,708 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 294 transitions. [2022-12-13 16:14:41,709 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 16:14:41,709 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 294 transitions. [2022-12-13 16:14:41,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 16:14:41,710 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:14:41,710 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 16:14:41,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:14:41,710 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:14:41,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:14:41,711 INFO L85 PathProgramCache]: Analyzing trace with hash -492261566, now seen corresponding path program 1 times [2022-12-13 16:14:41,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:14:41,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637805957] [2022-12-13 16:14:41,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:41,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:14:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:41,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:41,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:41,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:41,831 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 16:14:41,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:14:41,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637805957] [2022-12-13 16:14:41,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637805957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:14:41,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:14:41,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:14:41,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475640245] [2022-12-13 16:14:41,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:14:41,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:14:41,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:14:41,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:14:41,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:14:41,833 INFO L87 Difference]: Start difference. First operand 224 states and 294 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 16:14:42,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:14:42,392 INFO L93 Difference]: Finished difference Result 652 states and 865 transitions. [2022-12-13 16:14:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:14:42,393 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 16:14:42,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:14:42,396 INFO L225 Difference]: With dead ends: 652 [2022-12-13 16:14:42,396 INFO L226 Difference]: Without dead ends: 433 [2022-12-13 16:14:42,397 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 16:14:42,398 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 326 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:14:42,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 772 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:14:42,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-12-13 16:14:42,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 419. [2022-12-13 16:14:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 318 states have (on average 1.2893081761006289) internal successors, (410), 325 states have internal predecessors, (410), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-12-13 16:14:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 550 transitions. [2022-12-13 16:14:42,430 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 550 transitions. Word has length 32 [2022-12-13 16:14:42,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:14:42,431 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 550 transitions. [2022-12-13 16:14:42,431 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 16:14:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 550 transitions. [2022-12-13 16:14:42,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 16:14:42,432 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:14:42,432 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 16:14:42,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:14:42,433 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:14:42,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:14:42,433 INFO L85 PathProgramCache]: Analyzing trace with hash 453727969, now seen corresponding path program 1 times [2022-12-13 16:14:42,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:14:42,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639847046] [2022-12-13 16:14:42,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:42,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:14:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:42,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:42,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:42,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:42,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:14:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:42,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:42,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:42,568 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 16:14:42,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:14:42,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639847046] [2022-12-13 16:14:42,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639847046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:14:42,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:14:42,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:14:42,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870778690] [2022-12-13 16:14:42,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:14:42,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:14:42,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:14:42,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:14:42,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:14:42,571 INFO L87 Difference]: Start difference. First operand 419 states and 550 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 16:14:43,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:14:43,132 INFO L93 Difference]: Finished difference Result 990 states and 1341 transitions. [2022-12-13 16:14:43,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:14:43,133 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 16:14:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:14:43,137 INFO L225 Difference]: With dead ends: 990 [2022-12-13 16:14:43,137 INFO L226 Difference]: Without dead ends: 586 [2022-12-13 16:14:43,138 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 16:14:43,139 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 672 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:14:43,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1183 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:14:43,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-12-13 16:14:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 422. [2022-12-13 16:14:43,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 321 states have (on average 1.2834890965732086) internal successors, (412), 328 states have internal predecessors, (412), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-12-13 16:14:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 552 transitions. [2022-12-13 16:14:43,167 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 552 transitions. Word has length 55 [2022-12-13 16:14:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:14:43,167 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 552 transitions. [2022-12-13 16:14:43,167 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 16:14:43,167 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 552 transitions. [2022-12-13 16:14:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 16:14:43,168 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:14:43,168 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 16:14:43,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 16:14:43,169 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:14:43,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:14:43,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1191044641, now seen corresponding path program 1 times [2022-12-13 16:14:43,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:14:43,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634772623] [2022-12-13 16:14:43,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:43,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:14:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:43,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:43,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:43,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:43,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:14:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:43,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:43,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:43,291 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 16:14:43,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:14:43,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634772623] [2022-12-13 16:14:43,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634772623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:14:43,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:14:43,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:14:43,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776565599] [2022-12-13 16:14:43,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:14:43,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:14:43,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:14:43,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:14:43,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:14:43,293 INFO L87 Difference]: Start difference. First operand 422 states and 552 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 16:14:43,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:14:43,743 INFO L93 Difference]: Finished difference Result 1257 states and 1665 transitions. [2022-12-13 16:14:43,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:14:43,744 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 16:14:43,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:14:43,749 INFO L225 Difference]: With dead ends: 1257 [2022-12-13 16:14:43,749 INFO L226 Difference]: Without dead ends: 850 [2022-12-13 16:14:43,750 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 16:14:43,751 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 401 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:14:43,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 714 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:14:43,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2022-12-13 16:14:43,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 820. [2022-12-13 16:14:43,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 628 states have (on average 1.2786624203821657) internal successors, (803), 639 states have internal predecessors, (803), 137 states have call successors, (137), 55 states have call predecessors, (137), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-12-13 16:14:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1073 transitions. [2022-12-13 16:14:43,810 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1073 transitions. Word has length 55 [2022-12-13 16:14:43,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:14:43,811 INFO L495 AbstractCegarLoop]: Abstraction has 820 states and 1073 transitions. [2022-12-13 16:14:43,811 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 16:14:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1073 transitions. [2022-12-13 16:14:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 16:14:43,813 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:14:43,813 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 16:14:43,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 16:14:43,814 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:14:43,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:14:43,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1732311739, now seen corresponding path program 1 times [2022-12-13 16:14:43,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:14:43,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375992981] [2022-12-13 16:14:43,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:43,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:14:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:43,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:43,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:43,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:43,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:14:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:43,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:43,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:43,925 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 16:14:43,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:14:43,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375992981] [2022-12-13 16:14:43,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375992981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:14:43,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:14:43,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:14:43,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077964328] [2022-12-13 16:14:43,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:14:43,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:14:43,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:14:43,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:14:43,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:14:43,926 INFO L87 Difference]: Start difference. First operand 820 states and 1073 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 16:14:44,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:14:44,255 INFO L93 Difference]: Finished difference Result 850 states and 1122 transitions. [2022-12-13 16:14:44,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:14:44,255 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 16:14:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:14:44,258 INFO L225 Difference]: With dead ends: 850 [2022-12-13 16:14:44,258 INFO L226 Difference]: Without dead ends: 847 [2022-12-13 16:14:44,259 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 16:14:44,259 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 285 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:14:44,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 539 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:14:44,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2022-12-13 16:14:44,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 819. [2022-12-13 16:14:44,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 628 states have (on average 1.2770700636942676) internal successors, (802), 638 states have internal predecessors, (802), 136 states have call successors, (136), 55 states have call predecessors, (136), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-12-13 16:14:44,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1071 transitions. [2022-12-13 16:14:44,305 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1071 transitions. Word has length 56 [2022-12-13 16:14:44,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:14:44,306 INFO L495 AbstractCegarLoop]: Abstraction has 819 states and 1071 transitions. [2022-12-13 16:14:44,306 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 16:14:44,306 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1071 transitions. [2022-12-13 16:14:44,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 16:14:44,307 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:14:44,307 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 16:14:44,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 16:14:44,307 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:14:44,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:14:44,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2132925860, now seen corresponding path program 1 times [2022-12-13 16:14:44,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:14:44,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165473705] [2022-12-13 16:14:44,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:44,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:14:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:44,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:44,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:44,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:44,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:14:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:44,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:44,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:44,395 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 16:14:44,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:14:44,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165473705] [2022-12-13 16:14:44,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165473705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:14:44,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:14:44,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:14:44,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877949981] [2022-12-13 16:14:44,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:14:44,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:14:44,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:14:44,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:14:44,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:14:44,397 INFO L87 Difference]: Start difference. First operand 819 states and 1071 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 16:14:44,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:14:44,672 INFO L93 Difference]: Finished difference Result 849 states and 1120 transitions. [2022-12-13 16:14:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:14:44,673 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 16:14:44,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:14:44,675 INFO L225 Difference]: With dead ends: 849 [2022-12-13 16:14:44,675 INFO L226 Difference]: Without dead ends: 846 [2022-12-13 16:14:44,676 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 16:14:44,676 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 322 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:14:44,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 384 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:14:44,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2022-12-13 16:14:44,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 818. [2022-12-13 16:14:44,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 628 states have (on average 1.2754777070063694) internal successors, (801), 637 states have internal predecessors, (801), 135 states have call successors, (135), 55 states have call predecessors, (135), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-12-13 16:14:44,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1069 transitions. [2022-12-13 16:14:44,709 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1069 transitions. Word has length 57 [2022-12-13 16:14:44,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:14:44,709 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1069 transitions. [2022-12-13 16:14:44,709 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 16:14:44,709 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1069 transitions. [2022-12-13 16:14:44,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 16:14:44,710 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:14:44,710 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 16:14:44,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 16:14:44,710 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:14:44,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:14:44,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1696212008, now seen corresponding path program 1 times [2022-12-13 16:14:44,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:14:44,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617845309] [2022-12-13 16:14:44,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:44,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:14:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:44,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:44,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:44,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:44,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:14:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:44,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:44,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:44,800 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 16:14:44,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:14:44,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617845309] [2022-12-13 16:14:44,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617845309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:14:44,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:14:44,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:14:44,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509241167] [2022-12-13 16:14:44,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:14:44,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:14:44,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:14:44,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:14:44,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:14:44,802 INFO L87 Difference]: Start difference. First operand 818 states and 1069 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 16:14:45,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:14:45,123 INFO L93 Difference]: Finished difference Result 848 states and 1118 transitions. [2022-12-13 16:14:45,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:14:45,123 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 16:14:45,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:14:45,127 INFO L225 Difference]: With dead ends: 848 [2022-12-13 16:14:45,127 INFO L226 Difference]: Without dead ends: 837 [2022-12-13 16:14:45,128 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 16:14:45,129 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 319 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:14:45,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 383 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:14:45,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2022-12-13 16:14:45,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 809. [2022-12-13 16:14:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 620 states have (on average 1.2741935483870968) internal successors, (790), 628 states have internal predecessors, (790), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-12-13 16:14:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1057 transitions. [2022-12-13 16:14:45,166 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1057 transitions. Word has length 58 [2022-12-13 16:14:45,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:14:45,166 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1057 transitions. [2022-12-13 16:14:45,166 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 16:14:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1057 transitions. [2022-12-13 16:14:45,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-12-13 16:14:45,168 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:14:45,168 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] [2022-12-13 16:14:45,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 16:14:45,169 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:14:45,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:14:45,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1715867054, now seen corresponding path program 1 times [2022-12-13 16:14:45,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:14:45,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131293042] [2022-12-13 16:14:45,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:45,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:14:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 16:14:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 16:14:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 16:14:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:14:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 16:14:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 16:14:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-12-13 16:14:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 16:14:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 16:14:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-12-13 16:14:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,381 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 16:14:45,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:14:45,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131293042] [2022-12-13 16:14:45,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131293042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:14:45,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:14:45,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:14:45,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596502187] [2022-12-13 16:14:45,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:14:45,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:14:45,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:14:45,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:14:45,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:14:45,383 INFO L87 Difference]: Start difference. First operand 809 states and 1057 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 16:14:45,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:14:45,710 INFO L93 Difference]: Finished difference Result 1695 states and 2233 transitions. [2022-12-13 16:14:45,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:14:45,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 154 [2022-12-13 16:14:45,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:14:45,714 INFO L225 Difference]: With dead ends: 1695 [2022-12-13 16:14:45,714 INFO L226 Difference]: Without dead ends: 901 [2022-12-13 16:14:45,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 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 16:14:45,716 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 147 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:14:45,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 734 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:14:45,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-12-13 16:14:45,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 863. [2022-12-13 16:14:45,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 673 states have (on average 1.2838038632986628) internal successors, (864), 681 states have internal predecessors, (864), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-12-13 16:14:45,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1131 transitions. [2022-12-13 16:14:45,789 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1131 transitions. Word has length 154 [2022-12-13 16:14:45,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:14:45,789 INFO L495 AbstractCegarLoop]: Abstraction has 863 states and 1131 transitions. [2022-12-13 16:14:45,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 16:14:45,789 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1131 transitions. [2022-12-13 16:14:45,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-13 16:14:45,792 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:14:45,792 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] [2022-12-13 16:14:45,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 16:14:45,793 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:14:45,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:14:45,793 INFO L85 PathProgramCache]: Analyzing trace with hash 281231005, now seen corresponding path program 1 times [2022-12-13 16:14:45,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:14:45,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771681385] [2022-12-13 16:14:45,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:45,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:14:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:14:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:14:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 16:14:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 16:14:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-12-13 16:14:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-12-13 16:14:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 16:14:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:45,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-12-13 16:14:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-12-13 16:14:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 16:14:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,019 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 16:14:46,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:14:46,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771681385] [2022-12-13 16:14:46,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771681385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:14:46,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:14:46,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 16:14:46,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233957412] [2022-12-13 16:14:46,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:14:46,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:14:46,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:14:46,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:14:46,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:14:46,021 INFO L87 Difference]: Start difference. First operand 863 states and 1131 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 16:14:46,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:14:46,511 INFO L93 Difference]: Finished difference Result 2305 states and 3112 transitions. [2022-12-13 16:14:46,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:14:46,512 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 163 [2022-12-13 16:14:46,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:14:46,520 INFO L225 Difference]: With dead ends: 2305 [2022-12-13 16:14:46,520 INFO L226 Difference]: Without dead ends: 1461 [2022-12-13 16:14:46,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 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 16:14:46,522 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 455 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:14:46,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1773 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:14:46,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2022-12-13 16:14:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 875. [2022-12-13 16:14:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 685 states have (on average 1.2788321167883212) internal successors, (876), 693 states have internal predecessors, (876), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-12-13 16:14:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1143 transitions. [2022-12-13 16:14:46,581 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1143 transitions. Word has length 163 [2022-12-13 16:14:46,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:14:46,581 INFO L495 AbstractCegarLoop]: Abstraction has 875 states and 1143 transitions. [2022-12-13 16:14:46,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 16:14:46,582 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1143 transitions. [2022-12-13 16:14:46,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 16:14:46,585 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:14:46,585 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] [2022-12-13 16:14:46,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 16:14:46,586 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:14:46,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:14:46,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1992328740, now seen corresponding path program 1 times [2022-12-13 16:14:46,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:14:46,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782666976] [2022-12-13 16:14:46,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:46,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:14:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:14:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:14:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 16:14:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 16:14:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 16:14:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-12-13 16:14:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-12-13 16:14:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-12-13 16:14:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 16:14:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 16:14:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:46,852 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 16:14:46,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:14:46,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782666976] [2022-12-13 16:14:46,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782666976] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:14:46,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236188101] [2022-12-13 16:14:46,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:46,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:14:46,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:14:46,853 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:14:46,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 16:14:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:47,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 16:14:47,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:14:47,213 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 16:14:47,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:14:47,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236188101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:14:47,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:14:47,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-12-13 16:14:47,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697507890] [2022-12-13 16:14:47,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:14:47,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:14:47,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:14:47,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:14:47,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:14:47,215 INFO L87 Difference]: Start difference. First operand 875 states and 1143 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 16:14:47,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:14:47,449 INFO L93 Difference]: Finished difference Result 2833 states and 3730 transitions. [2022-12-13 16:14:47,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:14:47,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 165 [2022-12-13 16:14:47,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:14:47,458 INFO L225 Difference]: With dead ends: 2833 [2022-12-13 16:14:47,458 INFO L226 Difference]: Without dead ends: 1977 [2022-12-13 16:14:47,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 195 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 16:14:47,462 INFO L413 NwaCegarLoop]: 592 mSDtfsCounter, 400 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1908 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 16:14:47,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1908 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:14:47,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2022-12-13 16:14:47,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 911. [2022-12-13 16:14:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 713 states have (on average 1.2678821879382889) internal successors, (904), 721 states have internal predecessors, (904), 142 states have call successors, (142), 56 states have call predecessors, (142), 55 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-12-13 16:14:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1187 transitions. [2022-12-13 16:14:47,551 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1187 transitions. Word has length 165 [2022-12-13 16:14:47,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:14:47,551 INFO L495 AbstractCegarLoop]: Abstraction has 911 states and 1187 transitions. [2022-12-13 16:14:47,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 16:14:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1187 transitions. [2022-12-13 16:14:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 16:14:47,554 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:14:47,554 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] [2022-12-13 16:14:47,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 16:14:47,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:14:47,754 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:14:47,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:14:47,755 INFO L85 PathProgramCache]: Analyzing trace with hash 981211490, now seen corresponding path program 1 times [2022-12-13 16:14:47,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:14:47,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063511984] [2022-12-13 16:14:47,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:47,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:14:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:48,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:48,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:48,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:48,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:14:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:48,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:48,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:48,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:14:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:48,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 16:14:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:48,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 16:14:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:48,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 16:14:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:48,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:48,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-12-13 16:14:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:48,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:48,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-12-13 16:14:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:48,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-12-13 16:14:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:48,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 16:14:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:48,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 16:14:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:48,133 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 16:14:48,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:14:48,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063511984] [2022-12-13 16:14:48,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063511984] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:14:48,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308485661] [2022-12-13 16:14:48,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:48,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:14:48,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:14:48,135 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:14:48,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 16:14:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:48,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 1324 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 16:14:48,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:14:48,503 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 16:14:48,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:14:48,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308485661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:14:48,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:14:48,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2022-12-13 16:14:48,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072208578] [2022-12-13 16:14:48,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:14:48,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:14:48,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:14:48,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:14:48,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:14:48,505 INFO L87 Difference]: Start difference. First operand 911 states and 1187 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 16:14:48,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:14:48,636 INFO L93 Difference]: Finished difference Result 1831 states and 2411 transitions. [2022-12-13 16:14:48,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:14:48,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 165 [2022-12-13 16:14:48,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:14:48,640 INFO L225 Difference]: With dead ends: 1831 [2022-12-13 16:14:48,640 INFO L226 Difference]: Without dead ends: 939 [2022-12-13 16:14:48,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:14:48,642 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 1 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:14:48,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1132 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:14:48,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-12-13 16:14:48,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 927. [2022-12-13 16:14:48,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 725 states have (on average 1.2634482758620689) internal successors, (916), 733 states have internal predecessors, (916), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 145 states have call predecessors, (161), 141 states have call successors, (161) [2022-12-13 16:14:48,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1219 transitions. [2022-12-13 16:14:48,704 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1219 transitions. Word has length 165 [2022-12-13 16:14:48,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:14:48,704 INFO L495 AbstractCegarLoop]: Abstraction has 927 states and 1219 transitions. [2022-12-13 16:14:48,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 16:14:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1219 transitions. [2022-12-13 16:14:48,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-13 16:14:48,707 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:14:48,707 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] [2022-12-13 16:14:48,713 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 16:14:48,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 16:14:48,907 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:14:48,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:14:48,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1506840738, now seen corresponding path program 1 times [2022-12-13 16:14:48,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:14:48,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593172819] [2022-12-13 16:14:48,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:48,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:14:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:49,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:49,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:49,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:49,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:14:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:49,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:49,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:49,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:14:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:49,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:49,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 16:14:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:49,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 16:14:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:49,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 16:14:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:49,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:49,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 16:14:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:49,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:49,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-12-13 16:14:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:49,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-12-13 16:14:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:49,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-12-13 16:14:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:49,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-12-13 16:14:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:49,665 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 16:14:49,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:14:49,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593172819] [2022-12-13 16:14:49,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593172819] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:14:49,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646802637] [2022-12-13 16:14:49,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:49,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:14:49,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:14:49,666 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:14:49,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 16:14:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:50,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 1350 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-13 16:14:50,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:14:50,177 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-12-13 16:14:50,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:14:50,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646802637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:14:50,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:14:50,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 18 [2022-12-13 16:14:50,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782479619] [2022-12-13 16:14:50,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:14:50,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:14:50,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:14:50,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:14:50,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-12-13 16:14:50,179 INFO L87 Difference]: Start difference. First operand 927 states and 1219 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 6 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 16:14:50,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:14:50,837 INFO L93 Difference]: Finished difference Result 3347 states and 4705 transitions. [2022-12-13 16:14:50,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 16:14:50,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 6 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) Word has length 171 [2022-12-13 16:14:50,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:14:50,855 INFO L225 Difference]: With dead ends: 3347 [2022-12-13 16:14:50,855 INFO L226 Difference]: Without dead ends: 2889 [2022-12-13 16:14:50,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2022-12-13 16:14:50,858 INFO L413 NwaCegarLoop]: 575 mSDtfsCounter, 841 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 3554 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:14:50,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 3554 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:14:50,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2022-12-13 16:14:50,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 939. [2022-12-13 16:14:50,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 737 states have (on average 1.2591587516960652) internal successors, (928), 741 states have internal predecessors, (928), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 149 states have call predecessors, (161), 141 states have call successors, (161) [2022-12-13 16:14:50,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1231 transitions. [2022-12-13 16:14:50,966 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1231 transitions. Word has length 171 [2022-12-13 16:14:50,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:14:50,966 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 1231 transitions. [2022-12-13 16:14:50,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 6 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 16:14:50,966 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1231 transitions. [2022-12-13 16:14:50,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-13 16:14:50,969 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:14:50,969 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] [2022-12-13 16:14:50,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 16:14:51,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 16:14:51,169 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:14:51,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:14:51,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1514027366, now seen corresponding path program 2 times [2022-12-13 16:14:51,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:14:51,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955609] [2022-12-13 16:14:51,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:51,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:14:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:51,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:51,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:51,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:51,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:14:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:51,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:51,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:51,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:14:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:51,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:51,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 16:14:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:51,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 16:14:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:51,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 16:14:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:51,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:51,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 16:14:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:51,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:51,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-12-13 16:14:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:51,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-12-13 16:14:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:51,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:51,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 16:14:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:51,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-12-13 16:14:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:51,838 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 16:14:51,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:14:51,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955609] [2022-12-13 16:14:51,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955609] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:14:51,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945080743] [2022-12-13 16:14:51,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:14:51,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:14:51,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:14:51,840 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:14:51,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 16:14:52,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 16:14:52,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:14:52,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 16:14:52,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:14:52,214 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 16:14:52,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:14:52,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945080743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:14:52,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:14:52,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2022-12-13 16:14:52,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989351212] [2022-12-13 16:14:52,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:14:52,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:14:52,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:14:52,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:14:52,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-12-13 16:14:52,217 INFO L87 Difference]: Start difference. First operand 939 states and 1231 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 16:14:52,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:14:52,624 INFO L93 Difference]: Finished difference Result 1903 states and 2581 transitions. [2022-12-13 16:14:52,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:14:52,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 177 [2022-12-13 16:14:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:14:52,629 INFO L225 Difference]: With dead ends: 1903 [2022-12-13 16:14:52,629 INFO L226 Difference]: Without dead ends: 1439 [2022-12-13 16:14:52,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-12-13 16:14:52,636 INFO L413 NwaCegarLoop]: 478 mSDtfsCounter, 572 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:14:52,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1976 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:14:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2022-12-13 16:14:52,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 945. [2022-12-13 16:14:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 743 states have (on average 1.2570659488559892) internal successors, (934), 747 states have internal predecessors, (934), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 149 states have call predecessors, (161), 141 states have call successors, (161) [2022-12-13 16:14:52,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1237 transitions. [2022-12-13 16:14:52,740 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1237 transitions. Word has length 177 [2022-12-13 16:14:52,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:14:52,740 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1237 transitions. [2022-12-13 16:14:52,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 16:14:52,740 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1237 transitions. [2022-12-13 16:14:52,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-12-13 16:14:52,743 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:14:52,743 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:14:52,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 16:14:52,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 16:14:52,944 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:14:52,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:14:52,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1738426959, now seen corresponding path program 1 times [2022-12-13 16:14:52,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:14:52,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481722049] [2022-12-13 16:14:52,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:52,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:14:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:14:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:14:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 16:14:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 16:14:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 16:14:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 16:14:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-12-13 16:14:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-12-13 16:14:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-12-13 16:14:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-12-13 16:14:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-12-13 16:14:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-12-13 16:14:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,238 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 16:14:53,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:14:53,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481722049] [2022-12-13 16:14:53,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481722049] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:14:53,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530835954] [2022-12-13 16:14:53,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:53,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:14:53,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:14:53,239 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:14:53,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 16:14:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:53,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 1823 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:14:53,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:14:53,755 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 16:14:53,755 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:14:53,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530835954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:14:53,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:14:53,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-12-13 16:14:53,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126177571] [2022-12-13 16:14:53,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:14:53,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:14:53,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:14:53,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:14:53,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:14:53,758 INFO L87 Difference]: Start difference. First operand 945 states and 1237 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, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-12-13 16:14:54,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:14:54,289 INFO L93 Difference]: Finished difference Result 2799 states and 3674 transitions. [2022-12-13 16:14:54,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:14:54,290 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, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 205 [2022-12-13 16:14:54,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:14:54,297 INFO L225 Difference]: With dead ends: 2799 [2022-12-13 16:14:54,297 INFO L226 Difference]: Without dead ends: 2791 [2022-12-13 16:14:54,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 243 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 16:14:54,298 INFO L413 NwaCegarLoop]: 585 mSDtfsCounter, 412 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:14:54,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1065 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:14:54,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2022-12-13 16:14:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2777. [2022-12-13 16:14:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2777 states, 2187 states have (on average 1.2610882487425696) internal successors, (2758), 2203 states have internal predecessors, (2758), 418 states have call successors, (418), 160 states have call predecessors, (418), 171 states have return successors, (477), 437 states have call predecessors, (477), 417 states have call successors, (477) [2022-12-13 16:14:54,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 3653 transitions. [2022-12-13 16:14:54,608 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 3653 transitions. Word has length 205 [2022-12-13 16:14:54,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:14:54,608 INFO L495 AbstractCegarLoop]: Abstraction has 2777 states and 3653 transitions. [2022-12-13 16:14:54,609 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, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-12-13 16:14:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3653 transitions. [2022-12-13 16:14:54,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-12-13 16:14:54,616 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:14:54,617 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:14:54,623 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 16:14:54,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 16:14:54,819 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:14:54,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:14:54,820 INFO L85 PathProgramCache]: Analyzing trace with hash 727309709, now seen corresponding path program 1 times [2022-12-13 16:14:54,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:14:54,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722020362] [2022-12-13 16:14:54,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:54,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:14:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:14:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:14:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 16:14:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 16:14:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 16:14:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 16:14:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-12-13 16:14:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-12-13 16:14:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-12-13 16:14:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-12-13 16:14:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-12-13 16:14:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-12-13 16:14:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:55,201 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 16:14:55,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:14:55,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722020362] [2022-12-13 16:14:55,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722020362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:14:55,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:14:55,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:14:55,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047127020] [2022-12-13 16:14:55,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:14:55,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:14:55,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:14:55,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:14:55,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:14:55,204 INFO L87 Difference]: Start difference. First operand 2777 states and 3653 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, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-12-13 16:14:56,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:14:56,361 INFO L93 Difference]: Finished difference Result 8919 states and 11788 transitions. [2022-12-13 16:14:56,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 16:14:56,362 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, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 205 [2022-12-13 16:14:56,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:14:56,375 INFO L225 Difference]: With dead ends: 8919 [2022-12-13 16:14:56,375 INFO L226 Difference]: Without dead ends: 6161 [2022-12-13 16:14:56,378 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 16:14:56,379 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 572 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:14:56,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1291 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:14:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6161 states. [2022-12-13 16:14:56,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6161 to 2789. [2022-12-13 16:14:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2199 states have (on average 1.259663483401546) internal successors, (2770), 2219 states have internal predecessors, (2770), 418 states have call successors, (418), 160 states have call predecessors, (418), 171 states have return successors, (477), 433 states have call predecessors, (477), 417 states have call successors, (477) [2022-12-13 16:14:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 3665 transitions. [2022-12-13 16:14:56,734 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 3665 transitions. Word has length 205 [2022-12-13 16:14:56,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:14:56,734 INFO L495 AbstractCegarLoop]: Abstraction has 2789 states and 3665 transitions. [2022-12-13 16:14:56,734 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, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-12-13 16:14:56,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3665 transitions. [2022-12-13 16:14:56,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-12-13 16:14:56,737 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:14:56,737 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 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, 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 16:14:56,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 16:14:56,738 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:14:56,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:14:56,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1660857439, now seen corresponding path program 1 times [2022-12-13 16:14:56,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:14:56,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302233384] [2022-12-13 16:14:56,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:56,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:14:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:14:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:14:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:14:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 16:14:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 16:14:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 16:14:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 16:14:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:14:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-12-13 16:14:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-12-13 16:14:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:14:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-12-13 16:14:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-12-13 16:14:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-12-13 16:14:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-12-13 16:14:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-12-13 16:14:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-12-13 16:14:57,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:14:57,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302233384] [2022-12-13 16:14:57,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302233384] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:14:57,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637309518] [2022-12-13 16:14:57,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:14:57,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:14:57,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:14:57,601 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:14:57,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 16:14:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:14:57,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 1837 conjuncts, 94 conjunts are in the unsatisfiable core [2022-12-13 16:14:57,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:14:57,997 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 16:14:58,059 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 16:14:58,391 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1036 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1036))) is different from true [2022-12-13 16:14:58,435 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 16:14:58,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:14:58,458 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 16:14:58,465 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 16:14:58,466 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 16:14:59,326 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 16:14:59,458 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 16:14:59,469 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 16:14:59,619 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 16:14:59,627 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 16:14:59,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:14:59,647 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 16:14:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 40 proven. 29 refuted. 0 times theorem prover too weak. 44 trivial. 2 not checked. [2022-12-13 16:14:59,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:15:01,699 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1047 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1047) |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 16:15:01,708 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1047 (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_1047) |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 16:15:01,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637309518] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:15:01,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:15:01,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 31] total 41 [2022-12-13 16:15:01,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933841190] [2022-12-13 16:15:01,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:15:01,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-13 16:15:01,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:15:01,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-13 16:15:01,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1422, Unknown=15, NotChecked=234, Total=1806 [2022-12-13 16:15:01,722 INFO L87 Difference]: Start difference. First operand 2789 states and 3665 transitions. Second operand has 41 states, 38 states have (on average 6.5) internal successors, (247), 28 states have internal predecessors, (247), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) [2022-12-13 16:15:10,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:15:10,591 INFO L93 Difference]: Finished difference Result 15250 states and 20682 transitions. [2022-12-13 16:15:10,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-12-13 16:15:10,592 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 6.5) internal successors, (247), 28 states have internal predecessors, (247), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) Word has length 212 [2022-12-13 16:15:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:15:10,623 INFO L225 Difference]: With dead ends: 15250 [2022-12-13 16:15:10,623 INFO L226 Difference]: Without dead ends: 12480 [2022-12-13 16:15:10,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 281 SyntacticMatches, 14 SemanticMatches, 102 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=951, Invalid=9138, Unknown=23, NotChecked=600, Total=10712 [2022-12-13 16:15:10,631 INFO L413 NwaCegarLoop]: 494 mSDtfsCounter, 2169 mSDsluCounter, 12097 mSDsCounter, 0 mSdLazyCounter, 7922 mSolverCounterSat, 770 mSolverCounterUnsat, 72 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2197 SdHoareTripleChecker+Valid, 12591 SdHoareTripleChecker+Invalid, 9648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 770 IncrementalHoareTripleChecker+Valid, 7922 IncrementalHoareTripleChecker+Invalid, 72 IncrementalHoareTripleChecker+Unknown, 884 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:15:10,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2197 Valid, 12591 Invalid, 9648 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [770 Valid, 7922 Invalid, 72 Unknown, 884 Unchecked, 5.5s Time] [2022-12-13 16:15:10,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12480 states. [2022-12-13 16:15:11,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12480 to 6541. [2022-12-13 16:15:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6541 states, 5231 states have (on average 1.2735614605238004) internal successors, (6662), 5315 states have internal predecessors, (6662), 862 states have call successors, (862), 388 states have call predecessors, (862), 447 states have return successors, (1125), 909 states have call predecessors, (1125), 861 states have call successors, (1125) [2022-12-13 16:15:11,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6541 states to 6541 states and 8649 transitions. [2022-12-13 16:15:11,488 INFO L78 Accepts]: Start accepts. Automaton has 6541 states and 8649 transitions. Word has length 212 [2022-12-13 16:15:11,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:15:11,488 INFO L495 AbstractCegarLoop]: Abstraction has 6541 states and 8649 transitions. [2022-12-13 16:15:11,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 6.5) internal successors, (247), 28 states have internal predecessors, (247), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) [2022-12-13 16:15:11,488 INFO L276 IsEmpty]: Start isEmpty. Operand 6541 states and 8649 transitions. [2022-12-13 16:15:11,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-12-13 16:15:11,496 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:15:11,496 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 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 16:15:11,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 16:15:11,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:15:11,697 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:15:11,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:15:11,697 INFO L85 PathProgramCache]: Analyzing trace with hash -789994785, now seen corresponding path program 2 times [2022-12-13 16:15:11,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:15:11,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153474930] [2022-12-13 16:15:11,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:15:11,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:15:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:15:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:15:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:15:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:15:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:15:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:15:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:15:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:15:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 16:15:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 16:15:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 16:15:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:15:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:15:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 16:15:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:15:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:15:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-12-13 16:15:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-12-13 16:15:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:15:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-12-13 16:15:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-12-13 16:15:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-12-13 16:15:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 16:15:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 16:15:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-12-13 16:15:12,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:15:12,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153474930] [2022-12-13 16:15:12,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153474930] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:15:12,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908335545] [2022-12-13 16:15:12,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:15:12,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:15:12,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:15:12,502 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:15:12,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 16:15:12,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 16:15:12,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:15:12,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 1889 conjuncts, 156 conjunts are in the unsatisfiable core [2022-12-13 16:15:12,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:15:12,874 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 16:15:12,895 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 16:15:13,082 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 16:15:13,086 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1338 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1338) |c_#memory_int|)) is different from true [2022-12-13 16:15:13,139 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 16:15:13,142 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 16:15:13,187 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:15:13,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 19 [2022-12-13 16:15:13,198 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 16:15:13,198 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 16:15:13,296 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 16:15:13,360 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 16:15:13,461 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 16:15:13,461 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 16:15:13,996 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 16:15:14,078 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 16:15:14,392 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 16:15:14,392 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 16:15:14,552 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 16:15:14,896 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-13 16:15:14,896 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 16:15:15,135 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 16:15:15,257 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 16:15:15,265 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 16:15:15,410 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 16:15:15,415 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 16:15:15,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:15:15,425 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 16:15:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 46 proven. 77 refuted. 9 times theorem prover too weak. 27 trivial. 2 not checked. [2022-12-13 16:15:15,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:15:17,520 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1351 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)))) is different from false [2022-12-13 16:15:17,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908335545] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:15:17,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:15:17,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 51] total 58 [2022-12-13 16:15:17,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557823045] [2022-12-13 16:15:17,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:15:17,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-12-13 16:15:17,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:15:17,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-12-13 16:15:17,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=3163, Unknown=9, NotChecked=230, Total=3660 [2022-12-13 16:15:17,534 INFO L87 Difference]: Start difference. First operand 6541 states and 8649 transitions. Second operand has 58 states, 54 states have (on average 4.777777777777778) internal successors, (258), 42 states have internal predecessors, (258), 17 states have call successors, (42), 13 states have call predecessors, (42), 16 states have return successors, (42), 21 states have call predecessors, (42), 17 states have call successors, (42) [2022-12-13 16:15:37,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:15:37,205 INFO L93 Difference]: Finished difference Result 26452 states and 36237 transitions. [2022-12-13 16:15:37,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-12-13 16:15:37,206 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 54 states have (on average 4.777777777777778) internal successors, (258), 42 states have internal predecessors, (258), 17 states have call successors, (42), 13 states have call predecessors, (42), 16 states have return successors, (42), 21 states have call predecessors, (42), 17 states have call successors, (42) Word has length 224 [2022-12-13 16:15:37,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:15:37,242 INFO L225 Difference]: With dead ends: 26452 [2022-12-13 16:15:37,242 INFO L226 Difference]: Without dead ends: 19930 [2022-12-13 16:15:37,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 291 SyntacticMatches, 13 SemanticMatches, 146 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6462 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1588, Invalid=19578, Unknown=12, NotChecked=578, Total=21756 [2022-12-13 16:15:37,254 INFO L413 NwaCegarLoop]: 811 mSDtfsCounter, 3296 mSDsluCounter, 24095 mSDsCounter, 0 mSdLazyCounter, 16242 mSolverCounterSat, 1447 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3330 SdHoareTripleChecker+Valid, 24906 SdHoareTripleChecker+Invalid, 19358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1447 IncrementalHoareTripleChecker+Valid, 16242 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 1664 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:15:37,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3330 Valid, 24906 Invalid, 19358 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1447 Valid, 16242 Invalid, 5 Unknown, 1664 Unchecked, 13.2s Time] [2022-12-13 16:15:37,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19930 states. [2022-12-13 16:15:38,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19930 to 8547. [2022-12-13 16:15:38,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8547 states, 6966 states have (on average 1.2810795291415447) internal successors, (8924), 7042 states have internal predecessors, (8924), 1033 states have call successors, (1033), 486 states have call predecessors, (1033), 547 states have return successors, (1324), 1094 states have call predecessors, (1324), 1032 states have call successors, (1324) [2022-12-13 16:15:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8547 states to 8547 states and 11281 transitions. [2022-12-13 16:15:38,565 INFO L78 Accepts]: Start accepts. Automaton has 8547 states and 11281 transitions. Word has length 224 [2022-12-13 16:15:38,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:15:38,565 INFO L495 AbstractCegarLoop]: Abstraction has 8547 states and 11281 transitions. [2022-12-13 16:15:38,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 54 states have (on average 4.777777777777778) internal successors, (258), 42 states have internal predecessors, (258), 17 states have call successors, (42), 13 states have call predecessors, (42), 16 states have return successors, (42), 21 states have call predecessors, (42), 17 states have call successors, (42) [2022-12-13 16:15:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 8547 states and 11281 transitions. [2022-12-13 16:15:38,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-12-13 16:15:38,572 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:15:38,572 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 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 16:15:38,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 16:15:38,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 16:15:38,773 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:15:38,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:15:38,773 INFO L85 PathProgramCache]: Analyzing trace with hash 930840231, now seen corresponding path program 3 times [2022-12-13 16:15:38,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:15:38,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685961768] [2022-12-13 16:15:38,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:15:38,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:15:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:15:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:15:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:15:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:15:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:15:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:15:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:15:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:15:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 16:15:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 16:15:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 16:15:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:15:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:15:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 16:15:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:15:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-12-13 16:15:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:15:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-12-13 16:15:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:15:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-12-13 16:15:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-12-13 16:15:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-12-13 16:15:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 16:15:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-12-13 16:15:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-12-13 16:15:39,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:15:39,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685961768] [2022-12-13 16:15:39,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685961768] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:15:39,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783918204] [2022-12-13 16:15:39,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 16:15:39,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:15:39,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:15:39,577 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:15:39,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 16:15:39,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 16:15:39,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:15:39,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 1320 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 16:15:39,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:15:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-12-13 16:15:40,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:15:40,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783918204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:15:40,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:15:40,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 16 [2022-12-13 16:15:40,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329679497] [2022-12-13 16:15:40,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:15:40,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:15:40,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:15:40,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:15:40,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-12-13 16:15:40,061 INFO L87 Difference]: Start difference. First operand 8547 states and 11281 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-12-13 16:15:41,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:15:41,262 INFO L93 Difference]: Finished difference Result 16599 states and 21884 transitions. [2022-12-13 16:15:41,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:15:41,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 224 [2022-12-13 16:15:41,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:15:41,291 INFO L225 Difference]: With dead ends: 16599 [2022-12-13 16:15:41,292 INFO L226 Difference]: Without dead ends: 8547 [2022-12-13 16:15:41,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-12-13 16:15:41,309 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 0 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:15:41,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1125 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:15:41,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8547 states. [2022-12-13 16:15:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8547 to 8547. [2022-12-13 16:15:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8547 states, 6966 states have (on average 1.280792420327304) internal successors, (8922), 7042 states have internal predecessors, (8922), 1033 states have call successors, (1033), 486 states have call predecessors, (1033), 547 states have return successors, (1310), 1094 states have call predecessors, (1310), 1032 states have call successors, (1310) [2022-12-13 16:15:42,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8547 states to 8547 states and 11265 transitions. [2022-12-13 16:15:42,590 INFO L78 Accepts]: Start accepts. Automaton has 8547 states and 11265 transitions. Word has length 224 [2022-12-13 16:15:42,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:15:42,590 INFO L495 AbstractCegarLoop]: Abstraction has 8547 states and 11265 transitions. [2022-12-13 16:15:42,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-12-13 16:15:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 8547 states and 11265 transitions. [2022-12-13 16:15:42,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2022-12-13 16:15:42,596 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:15:42,597 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 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, 1, 1] [2022-12-13 16:15:42,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 16:15:42,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 16:15:42,797 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:15:42,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:15:42,798 INFO L85 PathProgramCache]: Analyzing trace with hash -139006429, now seen corresponding path program 4 times [2022-12-13 16:15:42,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:15:42,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033149196] [2022-12-13 16:15:42,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:15:42,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:15:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:15:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:15:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:15:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:15:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:15:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:15:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:15:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:15:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 16:15:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 16:15:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 16:15:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:15:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:15:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 16:15:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:15:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-12-13 16:15:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:15:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-12-13 16:15:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:15:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-12-13 16:15:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-12-13 16:15:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:15:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-12-13 16:15:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-12-13 16:15:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 16:15:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:15:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-12-13 16:15:43,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:15:43,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033149196] [2022-12-13 16:15:43,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033149196] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:15:43,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676914821] [2022-12-13 16:15:43,503 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 16:15:43,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:15:43,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:15:43,503 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:15:43,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 16:15:43,856 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 16:15:43,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:15:43,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 112 conjunts are in the unsatisfiable core [2022-12-13 16:15:43,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:15:43,877 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 16:15:43,910 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 16:15:44,294 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 16:15:44,298 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1931 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1931) |c_#memory_int|)) is different from true [2022-12-13 16:15:44,351 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 16:15:44,352 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 16:15:44,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:15:44,379 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 16:15:44,392 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 16:15:44,392 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 16:15:44,487 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 16:15:44,577 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 16:15:44,654 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 16:15:44,654 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 16:15:44,953 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 16:15:45,278 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 16:15:45,278 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 16:15:45,924 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 16:15:46,057 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 16:15:46,066 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 16:15:46,201 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 16:15:46,207 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 16:15:46,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:15:46,218 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 16:15:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 76 proven. 63 refuted. 12 times theorem prover too weak. 40 trivial. 2 not checked. [2022-12-13 16:15:46,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:15:48,262 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1942 (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_1942) |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 16:15:48,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676914821] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:15:48,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:15:48,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 39] total 50 [2022-12-13 16:15:48,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147989739] [2022-12-13 16:15:48,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:15:48,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-13 16:15:48,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:15:48,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-13 16:15:48,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2170, Unknown=32, NotChecked=190, Total=2550 [2022-12-13 16:15:48,276 INFO L87 Difference]: Start difference. First operand 8547 states and 11265 transitions. Second operand has 50 states, 47 states have (on average 5.553191489361702) internal successors, (261), 36 states have internal predecessors, (261), 15 states have call successors, (43), 11 states have call predecessors, (43), 15 states have return successors, (43), 19 states have call predecessors, (43), 15 states have call successors, (43) [2022-12-13 16:16:03,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:16:03,530 INFO L93 Difference]: Finished difference Result 27073 states and 36844 transitions. [2022-12-13 16:16:03,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-12-13 16:16:03,530 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 5.553191489361702) internal successors, (261), 36 states have internal predecessors, (261), 15 states have call successors, (43), 11 states have call predecessors, (43), 15 states have return successors, (43), 19 states have call predecessors, (43), 15 states have call successors, (43) Word has length 230 [2022-12-13 16:16:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:16:03,558 INFO L225 Difference]: With dead ends: 27073 [2022-12-13 16:16:03,558 INFO L226 Difference]: Without dead ends: 18889 [2022-12-13 16:16:03,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 312 SyntacticMatches, 14 SemanticMatches, 118 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3962 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1040, Invalid=12714, Unknown=60, NotChecked=466, Total=14280 [2022-12-13 16:16:03,571 INFO L413 NwaCegarLoop]: 629 mSDtfsCounter, 2264 mSDsluCounter, 19879 mSDsCounter, 0 mSdLazyCounter, 12748 mSolverCounterSat, 880 mSolverCounterUnsat, 205 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2294 SdHoareTripleChecker+Valid, 20508 SdHoareTripleChecker+Invalid, 14839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 880 IncrementalHoareTripleChecker+Valid, 12748 IncrementalHoareTripleChecker+Invalid, 205 IncrementalHoareTripleChecker+Unknown, 1006 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-12-13 16:16:03,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2294 Valid, 20508 Invalid, 14839 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [880 Valid, 12748 Invalid, 205 Unknown, 1006 Unchecked, 9.8s Time] [2022-12-13 16:16:03,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18889 states. [2022-12-13 16:16:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18889 to 8471. [2022-12-13 16:16:04,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8471 states, 6900 states have (on average 1.28) internal successors, (8832), 6976 states have internal predecessors, (8832), 1019 states have call successors, (1019), 490 states have call predecessors, (1019), 551 states have return successors, (1292), 1080 states have call predecessors, (1292), 1018 states have call successors, (1292) [2022-12-13 16:16:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8471 states to 8471 states and 11143 transitions. [2022-12-13 16:16:04,986 INFO L78 Accepts]: Start accepts. Automaton has 8471 states and 11143 transitions. Word has length 230 [2022-12-13 16:16:04,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:16:04,986 INFO L495 AbstractCegarLoop]: Abstraction has 8471 states and 11143 transitions. [2022-12-13 16:16:04,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 5.553191489361702) internal successors, (261), 36 states have internal predecessors, (261), 15 states have call successors, (43), 11 states have call predecessors, (43), 15 states have return successors, (43), 19 states have call predecessors, (43), 15 states have call successors, (43) [2022-12-13 16:16:04,986 INFO L276 IsEmpty]: Start isEmpty. Operand 8471 states and 11143 transitions. [2022-12-13 16:16:04,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-12-13 16:16:04,992 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:16:04,992 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 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] [2022-12-13 16:16:05,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 16:16:05,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:16:05,192 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:16:05,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:16:05,193 INFO L85 PathProgramCache]: Analyzing trace with hash -835442034, now seen corresponding path program 1 times [2022-12-13 16:16:05,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:16:05,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963857194] [2022-12-13 16:16:05,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:16:05,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:16:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:07,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:16:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:07,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:16:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:07,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:16:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:07,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 16:16:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:07,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:16:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:08,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 16:16:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:08,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:16:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:08,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:16:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:08,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 16:16:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:08,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 16:16:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:08,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 16:16:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:08,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:16:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:08,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:16:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:08,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 16:16:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:08,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:16:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:09,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:16:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:09,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-12-13 16:16:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:09,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:16:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:09,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 16:16:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:09,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:16:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:09,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-12-13 16:16:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:09,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-12-13 16:16:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:09,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:16:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:09,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-12-13 16:16:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:09,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 16:16:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:09,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-12-13 16:16:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 11 proven. 69 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-12-13 16:16:09,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:16:09,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963857194] [2022-12-13 16:16:09,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963857194] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:16:09,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920093476] [2022-12-13 16:16:09,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:16:09,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:16:09,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:16:09,111 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:16:09,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 16:16:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:09,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 1956 conjuncts, 153 conjunts are in the unsatisfiable core [2022-12-13 16:16:09,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:16:09,503 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 16:16:09,547 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 16:16:09,919 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 16:16:10,154 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 16:16:10,156 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 16:16:10,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:16:10,305 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 16:16:10,314 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 16:16:10,314 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 16:16:10,544 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 16:16:10,686 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 16:16:10,937 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 16:16:10,937 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 16:16:12,126 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 16 treesize of output 10 [2022-12-13 16:16:12,191 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 16:16:12,629 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-13 16:16:12,629 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 27 treesize of output 45 [2022-12-13 16:16:12,871 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 21 treesize of output 13 [2022-12-13 16:16:13,368 INFO L321 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-12-13 16:16:13,369 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 26 treesize of output 32 [2022-12-13 16:16:13,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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 16:16:14,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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 16:16:14,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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 16:16:14,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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 16:16:14,297 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 16:16:14,340 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 16:16:14,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:16:14,349 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 16:16:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 77 proven. 118 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-13 16:16:14,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:16:16,366 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_2271 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2271) |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 16:16:16,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920093476] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:16:16,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:16:16,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 49] total 88 [2022-12-13 16:16:16,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698653796] [2022-12-13 16:16:16,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:16:16,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-12-13 16:16:16,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:16:16,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-12-13 16:16:16,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=7186, Unknown=48, NotChecked=172, Total=7832 [2022-12-13 16:16:16,380 INFO L87 Difference]: Start difference. First operand 8471 states and 11143 transitions. Second operand has 88 states, 81 states have (on average 3.4074074074074074) internal successors, (276), 70 states have internal predecessors, (276), 28 states have call successors, (47), 14 states have call predecessors, (47), 23 states have return successors, (47), 32 states have call predecessors, (47), 28 states have call successors, (47) [2022-12-13 16:16:41,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:16:41,092 INFO L93 Difference]: Finished difference Result 21140 states and 28079 transitions. [2022-12-13 16:16:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-12-13 16:16:41,093 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 81 states have (on average 3.4074074074074074) internal successors, (276), 70 states have internal predecessors, (276), 28 states have call successors, (47), 14 states have call predecessors, (47), 23 states have return successors, (47), 32 states have call predecessors, (47), 28 states have call successors, (47) Word has length 237 [2022-12-13 16:16:41,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:16:41,111 INFO L225 Difference]: With dead ends: 21140 [2022-12-13 16:16:41,111 INFO L226 Difference]: Without dead ends: 13108 [2022-12-13 16:16:41,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 295 SyntacticMatches, 18 SemanticMatches, 175 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10625 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=2359, Invalid=28341, Unknown=104, NotChecked=348, Total=31152 [2022-12-13 16:16:41,123 INFO L413 NwaCegarLoop]: 532 mSDtfsCounter, 3427 mSDsluCounter, 18319 mSDsCounter, 0 mSdLazyCounter, 16969 mSolverCounterSat, 1690 mSolverCounterUnsat, 678 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3457 SdHoareTripleChecker+Valid, 18851 SdHoareTripleChecker+Invalid, 19337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1690 IncrementalHoareTripleChecker+Valid, 16969 IncrementalHoareTripleChecker+Invalid, 678 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2022-12-13 16:16:41,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3457 Valid, 18851 Invalid, 19337 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1690 Valid, 16969 Invalid, 678 Unknown, 0 Unchecked, 14.8s Time] [2022-12-13 16:16:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13108 states. [2022-12-13 16:16:42,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13108 to 8668. [2022-12-13 16:16:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8668 states, 7061 states have (on average 1.2795638011613086) internal successors, (9035), 7144 states have internal predecessors, (9035), 1035 states have call successors, (1035), 506 states have call predecessors, (1035), 571 states have return successors, (1314), 1093 states have call predecessors, (1314), 1034 states have call successors, (1314) [2022-12-13 16:16:42,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8668 states to 8668 states and 11384 transitions. [2022-12-13 16:16:42,605 INFO L78 Accepts]: Start accepts. Automaton has 8668 states and 11384 transitions. Word has length 237 [2022-12-13 16:16:42,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:16:42,605 INFO L495 AbstractCegarLoop]: Abstraction has 8668 states and 11384 transitions. [2022-12-13 16:16:42,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 81 states have (on average 3.4074074074074074) internal successors, (276), 70 states have internal predecessors, (276), 28 states have call successors, (47), 14 states have call predecessors, (47), 23 states have return successors, (47), 32 states have call predecessors, (47), 28 states have call successors, (47) [2022-12-13 16:16:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 8668 states and 11384 transitions. [2022-12-13 16:16:42,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-12-13 16:16:42,611 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:16:42,611 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 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, 1, 1] [2022-12-13 16:16:42,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 16:16:42,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:16:42,813 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:16:42,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:16:42,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1440317130, now seen corresponding path program 1 times [2022-12-13 16:16:42,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:16:42,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763489112] [2022-12-13 16:16:42,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:16:42,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:16:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:16:43,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:16:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:16:43,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 16:16:43,621 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:16:43,622 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 16:16:43,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 16:16:43,625 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:16:43,628 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:16:43,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:16:43 BoogieIcfgContainer [2022-12-13 16:16:43,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:16:43,796 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:16:43,796 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:16:43,796 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:16:43,796 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:14:40" (3/4) ... [2022-12-13 16:16:43,799 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 16:16:43,799 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:16:43,799 INFO L158 Benchmark]: Toolchain (without parser) took 124508.29ms. Allocated memory was 125.8MB in the beginning and 1.1GB in the end (delta: 929.0MB). Free memory was 81.8MB in the beginning and 340.5MB in the end (delta: -258.7MB). Peak memory consumption was 672.9MB. Max. memory is 16.1GB. [2022-12-13 16:16:43,799 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory is still 92.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:16:43,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 750.94ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 81.3MB in the beginning and 83.2MB in the end (delta: -1.9MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2022-12-13 16:16:43,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.83ms. Allocated memory is still 151.0MB. Free memory was 83.2MB in the beginning and 76.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 16:16:43,800 INFO L158 Benchmark]: Boogie Preprocessor took 40.08ms. Allocated memory is still 151.0MB. Free memory was 76.9MB in the beginning and 71.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 16:16:43,800 INFO L158 Benchmark]: RCFGBuilder took 793.14ms. Allocated memory is still 151.0MB. Free memory was 71.2MB in the beginning and 53.8MB in the end (delta: 17.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-13 16:16:43,800 INFO L158 Benchmark]: TraceAbstraction took 122857.49ms. Allocated memory was 151.0MB in the beginning and 1.1GB in the end (delta: 903.9MB). Free memory was 102.4MB in the beginning and 340.5MB in the end (delta: -238.1MB). Peak memory consumption was 665.2MB. Max. memory is 16.1GB. [2022-12-13 16:16:43,800 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 1.1GB. Free memory is still 340.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:16:43,801 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.18ms. Allocated memory is still 125.8MB. Free memory is still 92.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 750.94ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 81.3MB in the beginning and 83.2MB in the end (delta: -1.9MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.83ms. Allocated memory is still 151.0MB. Free memory was 83.2MB in the beginning and 76.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.08ms. Allocated memory is still 151.0MB. Free memory was 76.9MB in the beginning and 71.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 793.14ms. Allocated memory is still 151.0MB. Free memory was 71.2MB in the beginning and 53.8MB in the end (delta: 17.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 122857.49ms. Allocated memory was 151.0MB in the beginning and 1.1GB in the end (delta: 903.9MB). Free memory was 102.4MB in the beginning and 340.5MB in the end (delta: -238.1MB). Peak memory consumption was 665.2MB. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 1.1GB. Free memory is still 340.5MB. 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: 4063]: 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 3839, overapproximation of strlen at line 3778, overapproximation of bitwiseOr at line 3801, overapproximation of bitwiseAnd at line 3406, overapproximation of snprintf at line 3350. Possible FailurePath: [L3543] int LDV_IN_INTERRUPT = 1; [L3544] int ref_cnt ; [L3545] int ldv_state_variable_1 ; [L3546] int usb_counter ; [L3547] struct usb_interface *usb_acecad_driver_group1 ; [L3548] int ldv_state_variable_0 ; [L3832-L3836] 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}}; [L3837] struct usb_device_id const __mod_usb_device_table ; [L3838-L3843] 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}; [L3865] int ldv_retval_0 ; [L3866] int ldv_retval_1 ; [L4066] int URB_STATE = 0; [L4067] int DEV_STATE = 0; [L4068] int INTERF_STATE = 0; [L4069] int SERIAL_STATE = 0; [L4070] void *usb_intfdata = (void *)0; [L4071] struct urb *int_urb = (struct urb *)0; [L4072] struct urb *bulk_urb = (struct urb *)0; [L4073] void (*completeFnInt)(struct urb * ) ; [L4074] 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3880] struct usb_device_id *ldvarg0 ; [L3881] void *tmp ; [L3882] int tmp___0 ; [L3883] int tmp___1 ; [L3884] 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3497] void *p ; [L3498] void *tmp ; [L3500] 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, bulk_urb={0:0}, calloc(1UL, size)={-18446744073709551617:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3500] tmp = calloc(1UL, size) [L3501] 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, bulk_urb={0:0}, calloc(1UL, size)={-18446744073709551617:0}, DEV_STATE=0, int_urb={0: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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-18446744073709551617:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] 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, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] 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, bulk_urb={0:0}, calloc(1UL, size)={-18446744073709551617:0}, DEV_STATE=0, int_urb={0: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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-18446744073709551617:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3503] return (p); VAL [={0:0}, ={0:0}, \old(size)=24, \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, bulk_urb={0:0}, calloc(1UL, size)={-18446744073709551617:0}, DEV_STATE=0, int_urb={0: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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-18446744073709551617:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(24UL)={-18446744073709551617: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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] tmp = ldv_init_zalloc(24UL) [L3887] ldvarg0 = (struct usb_device_id *)tmp [L3888] FCALL ldv_initialize() [L3889] ldv_state_variable_1 = 0 [L3890] ref_cnt = 0 [L3891] 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3893] tmp___0 = __VERIFIER_nondet_int() [L3895] case 0: [L3925] 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3926] COND TRUE ldv_state_variable_0 != 0 [L3927] tmp___2 = __VERIFIER_nondet_int() [L3929] case 0: [L3937] 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3938] COND TRUE ldv_state_variable_0 == 1 [L3939] CALL, EXPR usb_acecad_init() [L3846] int result ; [L3847] int tmp ; [L3849] CALL, EXPR usb_register(& usb_acecad_driver) [L3359] int tmp ; [L3361] CALL, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3980] ldv_func_ret_type ldv_func_res ; [L3981] int tmp ; [L3983] CALL, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L4343] return __VERIFIER_nondet_int(); [L3983] RET, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3983] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3984] ldv_func_res = tmp [L3985] ldv_state_variable_1 = 1 [L3986] usb_counter = 0 [L3987] CALL ldv_usb_driver_1() [L3871] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3497] void *p ; [L3498] void *tmp ; [L3500] 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:18446744073709551643}, bulk_urb={0:0}, calloc(1UL, size)={-36893488147419103233:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3500] tmp = calloc(1UL, size) [L3501] 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:18446744073709551643}, bulk_urb={0:0}, calloc(1UL, size)={-36893488147419103233:0}, DEV_STATE=0, int_urb={0: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={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] 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:18446744073709551643}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] 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:18446744073709551643}, bulk_urb={0:0}, calloc(1UL, size)={-36893488147419103233:0}, DEV_STATE=0, int_urb={0: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={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3503] return (p); VAL [={0:0}, ={0:0}, \old(size)=1248, \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:18446744073709551643}, bulk_urb={0:0}, calloc(1UL, size)={-36893488147419103233:0}, DEV_STATE=0, int_urb={0: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={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(1248UL)={-36893488147419103233: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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] tmp = ldv_init_zalloc(1248UL) [L3874] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3987] RET ldv_usb_driver_1() [L3988] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, ldv_func_arg1={12:0}, ldv_func_arg1={12:0}, ldv_func_arg2={18446744073709551618:18446744073709551643}, ldv_func_arg2={18446744073709551618:18446744073709551643}, 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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3361] RET, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3361] tmp = ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3362] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, driver={12:0}, driver={12:0}, int_urb={0: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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3849] RET, EXPR usb_register(& usb_acecad_driver) [L3849] tmp = usb_register(& usb_acecad_driver) [L3850] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3851] COND TRUE result == 0 [L3855] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3939] RET, EXPR usb_acecad_init() [L3939] ldv_retval_1 = usb_acecad_init() [L3940] COND TRUE ldv_retval_1 == 0 [L3941] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3944] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3893] tmp___0 = __VERIFIER_nondet_int() [L3895] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=0, tmp___2=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3896] COND TRUE ldv_state_variable_1 != 0 [L3897] tmp___1 = __VERIFIER_nondet_int() [L3899] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=0, tmp___1=0, tmp___2=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3900] COND TRUE ldv_state_variable_1 == 1 [L3901] CALL, EXPR usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3693] struct usb_device *dev ; [L3694] struct usb_device *tmp ; [L3695] struct usb_host_interface *interface ; [L3696] struct usb_endpoint_descriptor *endpoint ; [L3697] struct usb_acecad *acecad ; [L3698] struct input_dev *input_dev ; [L3699] int pipe ; [L3700] int maxp ; [L3701] int err ; [L3702] int tmp___0 ; [L3703] unsigned int tmp___1 ; [L3704] __u16 tmp___2 ; [L3705] void *tmp___3 ; [L3706] void *tmp___4 ; [L3707] size_t tmp___5 ; [L3708] size_t tmp___6 ; [L3710] CALL, EXPR interface_to_usbdev(intf) [L3971] struct usb_device *tmp ; [L3973] CALL, EXPR ldv_interface_to_usbdev() [L4189] void *result ; 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, size=1822, tmp={-55340232221128654849:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] 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:18446744073709551643}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, size=1822, tmp={-55340232221128654849:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=1822, \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, __this_module={18446744073709551618:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, size=1822, tmp={-55340232221128654849:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct usb_device))={-55340232221128654849: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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] result = ldv_malloc(sizeof(struct usb_device)) [L4195] COND FALSE !((unsigned long )result == (unsigned long )((void *)0)) [L4199] return ((struct usb_device *)result); VAL [={0:0}, ={0:0}, \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, __this_module={18446744073709551618:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-55340232221128654849:0}, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3973] RET, EXPR ldv_interface_to_usbdev() [L3973] tmp = ldv_interface_to_usbdev() [L3974] return (tmp); VAL [={0:0}, ={0:0}, \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, __this_module={18446744073709551618:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3710] RET, EXPR interface_to_usbdev(intf) [L3710] tmp = interface_to_usbdev(intf) [L3711] dev = tmp [L3712] EXPR intf->cur_altsetting [L3712] interface = intf->cur_altsetting [L3713] 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:18446744073709551643}, bulk_urb={0:0}, dev={-55340232221128654849:0}, DEV_STATE=0, id={-18446744073709551617:0}, id={-18446744073709551617:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, interface->desc.bNumEndpoints=-255, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3713] COND FALSE !((unsigned int )interface->desc.bNumEndpoints != 1U) [L3717] EXPR interface->endpoint [L3717] endpoint = & (interface->endpoint)->desc [L3718] CALL, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3314] int tmp ; [L3315] int tmp___0 ; [L3316] int tmp___1 ; [L3318] CALL, EXPR usb_endpoint_xfer_int(epd) [L3309] EXPR epd->bmAttributes [L3309] return (((int )epd->bmAttributes & 3) == 3); [L3318] RET, EXPR usb_endpoint_xfer_int(epd) [L3318] tmp = usb_endpoint_xfer_int(epd) [L3319] COND TRUE tmp != 0 [L3320] CALL, EXPR usb_endpoint_dir_in(epd) [L3303] EXPR epd->bEndpointAddress [L3303] return ((int )((signed char )epd->bEndpointAddress) < 0); [L3320] RET, EXPR usb_endpoint_dir_in(epd) [L3320] tmp___0 = usb_endpoint_dir_in(epd) [L3321] COND TRUE tmp___0 != 0 [L3322] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, epd={18446744073709551621:0}, epd={18446744073709551621:0}, int_urb={0: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, tmp___0=1, tmp___1=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3329] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, epd={18446744073709551621:0}, epd={18446744073709551621:0}, int_urb={0: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, tmp___0=1, tmp___1=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3718] RET, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3718] tmp___0 = usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3719] COND FALSE !(tmp___0 == 0) [L3723] EXPR endpoint->bEndpointAddress [L3723] CALL, EXPR __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3383] EXPR dev->devnum [L3383] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L3723] RET, EXPR __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3723] tmp___1 = __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3724] pipe = (int )(tmp___1 | 1073741952U) [L3725] CALL, EXPR usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3388] struct usb_host_endpoint *ep ; [L3389] unsigned int epnum ; [L3390] int __ret_warn_on ; [L3391] long tmp ; [L3392] int __ret_warn_on___0 ; [L3393] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-55340232221128654849:0}, udev={-55340232221128654849:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3395] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0: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={-55340232221128654849:0}, udev={-55340232221128654849:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3396] COND FALSE !(is_out != 0) [L3406] __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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0: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={-55340232221128654849:0}, udev={-55340232221128654849:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3407] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3540] 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:18446744073709551643}, bulk_urb={0:0}, c=0, DEV_STATE=0, exp=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3407] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0: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={-55340232221128654849:0}, udev={-55340232221128654849:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3407] tmp___0 = ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) [L3408] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0: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={-55340232221128654849:0}, udev={-55340232221128654849:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3412] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3540] 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:18446744073709551643}, bulk_urb={0:0}, c=0, DEV_STATE=0, exp=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3412] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0: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={-55340232221128654849:0}, udev={-55340232221128654849:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3413] EXPR udev->ep_in[epnum] [L3413] ep = udev->ep_in[epnum] [L3415] COND TRUE (unsigned long )ep == (unsigned long )((struct usb_host_endpoint *)0) [L3416] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, ep={0:0}, epnum=0, int_urb={0: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={-55340232221128654849:0}, udev={-55340232221128654849:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3725] RET, EXPR usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3725] tmp___2 = usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3726] 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:18446744073709551643}, bulk_urb={0:0}, dev={-55340232221128654849:0}, DEV_STATE=0, endpoint={18446744073709551621:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3727] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3447] void *tmp ; [L3449] CALL, EXPR kmalloc(size, flags | 32768U) [L3438] void *tmp___1 ; [L3440] CALL, EXPR __kmalloc(size, flags) [L3433] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-73786976294838206465:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] 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:18446744073709551643}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-73786976294838206465:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=232, \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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-73786976294838206465:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3433] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-73786976294838206465: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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3433] return ldv_malloc(size); [L3440] RET, EXPR __kmalloc(size, flags) [L3440] tmp___1 = __kmalloc(size, flags) [L3441] return (tmp___1); VAL [={0:0}, ={0:0}, \old(flags)=32768, \old(size)=232, \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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, flags=32768, int_urb={0: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=232, tmp___1={-73786976294838206465:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3449] RET, EXPR kmalloc(size, flags | 32768U) [L3449] tmp = kmalloc(size, flags | 32768U) [L3450] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=208, \old(size)=232, \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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, flags=208, int_urb={0: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=232, tmp={-73786976294838206465:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3727] 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:18446744073709551643}, bulk_urb={0:0}, dev={-55340232221128654849:0}, DEV_STATE=0, endpoint={18446744073709551621:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233:0}, kzalloc(232UL, 208U)={-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={-55340232221128654849:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3727] tmp___3 = kzalloc(232UL, 208U) [L3728] acecad = (struct usb_acecad *)tmp___3 [L3729] CALL, EXPR input_allocate_device() [L3551] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3447] void *tmp ; [L3449] CALL, EXPR kmalloc(size, flags | 32768U) [L3438] void *tmp___1 ; [L3440] CALL, EXPR __kmalloc(size, flags) [L3433] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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=1855, tmp={-36893488147419103231:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] 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:18446744073709551643}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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=1855, tmp={-36893488147419103231:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=1855, \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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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=1855, tmp={-36893488147419103231:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3433] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-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, size=1855, t=32768, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3433] return ldv_malloc(size); [L3440] RET, EXPR __kmalloc(size, flags) [L3440] tmp___1 = __kmalloc(size, flags) [L3441] return (tmp___1); VAL [={0:0}, ={0:0}, \old(flags)=32768, \old(size)=1855, \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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, flags=32768, int_urb={0: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=1855, tmp___1={-36893488147419103231:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3449] RET, EXPR kmalloc(size, flags | 32768U) [L3449] tmp = kmalloc(size, flags | 32768U) [L3450] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=128, \old(size)=1855, \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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, flags=128, int_urb={0: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=1855, tmp={-36893488147419103231:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3551] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u)={-36893488147419103231: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3551] return kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u); [L3729] RET, EXPR input_allocate_device() [L3729] input_dev = input_allocate_device() [L3730] COND FALSE !((unsigned long )acecad == (unsigned long )((struct usb_acecad *)0) || (unsigned long )input_dev == (unsigned long )((struct input_dev *)0)) [L3735] CALL, EXPR usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L4324] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-92233720368547758081:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-92233720368547758081:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] 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:18446744073709551643}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-92233720368547758081:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-92233720368547758081:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=0, \result={-92233720368547758081:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-92233720368547758081:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-92233720368547758081:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4324] 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:18446744073709551643}, arg0={-55340232221128654849:0}, arg0={-55340232221128654849:0}, arg1=8, arg2=208, arg3={-73786976294838206465:224}, arg3={-73786976294838206465:224}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-92233720368547758081: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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4324] return ldv_malloc(0UL); [L3735] RET, EXPR usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L3735] tmp___4 = usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L3736] acecad->data = (unsigned char *)tmp___4 [L3737] 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:18446744073709551643}, acecad={-73786976294838206465:0}, acecad->data={-92233720368547758081:0}, bulk_urb={0:0}, dev={-55340232221128654849:0}, DEV_STATE=0, endpoint={18446744073709551621:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-73786976294838206465:0}, tmp___4={-92233720368547758081:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3737] COND FALSE !((unsigned long )acecad->data == (unsigned long )((unsigned char *)0U)) [L3742] CALL, EXPR ldv_usb_alloc_urb_5(0, 208U) [L4009] ldv_func_ret_type___0 ldv_func_res ; [L4010] struct urb *tmp ; [L4012] CALL, EXPR usb_alloc_urb(ldv_func_arg1, ldv_func_arg2) [L4327] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-110680464442257309697:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-110680464442257309697:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] 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:18446744073709551643}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0: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_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-110680464442257309697:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-110680464442257309697:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=180, \result={-110680464442257309697:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-110680464442257309697:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-110680464442257309697:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4327] RET, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, \old(arg0)=0, \old(arg1)=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:18446744073709551643}, arg0=0, arg1=208, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct urb))={-110680464442257309697: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, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4327] return ldv_malloc(sizeof(struct urb)); [L4012] RET, EXPR usb_alloc_urb(ldv_func_arg1, ldv_func_arg2) [L4012] tmp = usb_alloc_urb(ldv_func_arg1, ldv_func_arg2) [L4013] ldv_func_res = tmp [L4014] CALL ldv_alloc_urb(ldv_func_res) [L4098] COND TRUE (unsigned long )res != (unsigned long )((struct urb *)0) [L4099] URB_STATE = URB_STATE + 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, res={-110680464442257309697:0}, res={-110680464442257309697:0}, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4014] RET ldv_alloc_urb(ldv_func_res) [L4015] return (ldv_func_res); VAL [={0:0}, ={0:0}, \old(ldv_func_arg1)=0, \old(ldv_func_arg2)=208, \result={-110680464442257309697:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, ldv_func_arg1=0, ldv_func_arg2=208, ldv_func_res={-110680464442257309697: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={-110680464442257309697:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3742] RET, EXPR ldv_usb_alloc_urb_5(0, 208U) [L3742] acecad->irq = ldv_usb_alloc_urb_5(0, 208U) [L3743] 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:18446744073709551643}, acecad={-73786976294838206465:0}, acecad->irq={-110680464442257309697:0}, bulk_urb={0:0}, dev={-55340232221128654849:0}, DEV_STATE=0, endpoint={18446744073709551621:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-73786976294838206465:0}, tmp___4={-92233720368547758081:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3743] COND FALSE !((unsigned long )acecad->irq == (unsigned long )((struct urb *)0)) [L3748] acecad->usbdev = dev [L3749] acecad->input = input_dev [L3750] 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:18446744073709551643}, acecad={-73786976294838206465:0}, bulk_urb={0:0}, dev={-55340232221128654849:0}, dev->manufacturer={0:0}, DEV_STATE=0, endpoint={18446744073709551621:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-73786976294838206465:0}, tmp___4={-92233720368547758081:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3750] COND FALSE !((unsigned long )dev->manufacturer != (unsigned long )((char *)0)) [L3754] 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:18446744073709551643}, acecad={-73786976294838206465:0}, bulk_urb={0:0}, dev={-55340232221128654849:0}, dev->product={0:0}, DEV_STATE=0, endpoint={18446744073709551621:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-73786976294838206465:0}, tmp___4={-92233720368547758081:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3754] COND FALSE !((unsigned long )dev->product != (unsigned long )((char *)0)) [L3762] CALL usb_make_path(dev, (char *)(& acecad->phys), 64UL) [L3348] int actual ; [L3350] EXPR dev->bus [L3350] EXPR (dev->bus)->bus_name [L3350] actual = snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, (char *)(& dev->devpath)) [L3351] 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:18446744073709551643}, actual=-1, buf={-73786976294838206465:128}, buf={-73786976294838206465:128}, bulk_urb={0:0}, dev={-55340232221128654849:0}, dev={-55340232221128654849:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3762] RET usb_make_path(dev, (char *)(& acecad->phys), 64UL) [L3763] 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:18446744073709551643}, arg0={-73786976294838206465:128}, arg1={8:0}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4317] return __VERIFIER_nondet_ulong(); [L3763] 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:18446744073709551643}, acecad={-73786976294838206465:0}, bulk_urb={0:0}, dev={-55340232221128654849:0}, DEV_STATE=0, endpoint={18446744073709551621:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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)=18446744073709551642, tmp={-55340232221128654849:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-73786976294838206465:0}, tmp___4={-92233720368547758081:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3764] input_dev->name = (char const *)(& acecad->name) [L3765] input_dev->phys = (char const *)(& acecad->phys) [L3766] CALL usb_to_input_id((struct usb_device const *)dev, & input_dev->id) [L3600] id->bustype = 3U [L3601] EXPR dev->descriptor.idVendor [L3601] id->vendor = dev->descriptor.idVendor [L3602] EXPR dev->descriptor.idProduct [L3602] id->product = dev->descriptor.idProduct [L3603] EXPR dev->descriptor.bcdDevice [L3603] id->version = dev->descriptor.bcdDevice [L3766] RET usb_to_input_id((struct usb_device const *)dev, & input_dev->id) [L3767] input_dev->dev.parent = & intf->dev [L3768] CALL input_set_drvdata(input_dev, (void *)acecad) [L3565] FCALL dev_set_drvdata(& dev->dev, data) [L3768] RET input_set_drvdata(input_dev, (void *)acecad) [L3769] input_dev->open = & usb_acecad_open [L3770] input_dev->close = & usb_acecad_close [L3771] input_dev->evbit[0] = 10UL [L3772] input_dev->keybit[5] = 7169UL [L3773] id->driver_info [L3774] 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:18446744073709551643}, acecad={-73786976294838206465:0}, bulk_urb={0:0}, dev={-55340232221128654849:0}, DEV_STATE=0, endpoint={18446744073709551621:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-73786976294838206465:0}, tmp___4={-92233720368547758081:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3775] 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:18446744073709551643}, acecad={-73786976294838206465:0}, bulk_urb={0:0}, dev={-55340232221128654849:0}, DEV_STATE=0, endpoint={18446744073709551621:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-73786976294838206465:0}, tmp___4={-92233720368547758081:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3776] 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:18446744073709551643}, acecad={-73786976294838206465:0}, bulk_urb={0:0}, dev={-55340232221128654849:0}, DEV_STATE=0, endpoint={18446744073709551621:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-73786976294838206465:0}, tmp___4={-92233720368547758081:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3777] 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:18446744073709551643}, acecad={-73786976294838206465:0}, bulk_urb={0:0}, dev={-55340232221128654849:0}, DEV_STATE=0, endpoint={18446744073709551621:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-73786976294838206465:0}, tmp___4={-92233720368547758081:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3778] tmp___5 = strlen((char const *)(& acecad->name)) [L3779] 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:18446744073709551643}, acecad={-73786976294838206465:0}, bulk_urb={0:0}, dev={-55340232221128654849:0}, DEV_STATE=0, endpoint={18446744073709551621:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-73786976294838206465:0}, tmp___4={-92233720368547758081:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3798] EXPR acecad->irq [L3798] EXPR acecad->data [L3799] EXPR endpoint->bInterval [L3798-L3799] 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) [L4024] CALL ldv_fill_int_urb(complete_fn) [L4120] struct urb *value ; [L4121] 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:18446744073709551643}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0: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_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4123] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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=180, tmp={-18446744073709551615:0}, tmp___0=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] 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:18446744073709551643}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0: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_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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=180, tmp={-18446744073709551615:0}, tmp___0=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=180, \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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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=180, tmp={-18446744073709551615:0}, tmp___0=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4123] 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:18446744073709551643}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct urb))={-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, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4123] value = ldv_malloc(sizeof(struct urb)) [L4124] COND FALSE !((unsigned long )value == (unsigned long )((struct urb *)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:18446744073709551643}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0: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_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}, value={-18446744073709551615:0}] [L4128] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3516] int tmp ; [L3518] tmp = __VERIFIER_nondet_int() [L3519] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4128] 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:18446744073709551643}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0: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()=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}, value={-18446744073709551615:0}] [L4128] tmp___0 = ldv_undef_int() [L4129] COND FALSE !(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:18446744073709551643}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0: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___0=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}, value={-18446744073709551615:0}] [L4024] RET ldv_fill_int_urb(complete_fn) [L3798-L3799] 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) [L3800] EXPR acecad->irq [L3800] EXPR acecad->data_dma [L3800] (acecad->irq)->transfer_dma = acecad->data_dma [L3801] EXPR acecad->irq [L3801] EXPR acecad->irq [L3801] EXPR (acecad->irq)->transfer_flags [L3801] (acecad->irq)->transfer_flags = (acecad->irq)->transfer_flags | 4U [L3802] EXPR acecad->input [L3802] CALL, EXPR input_register_device(acecad->input) [L4300] return __VERIFIER_nondet_int(); [L3802] RET, EXPR input_register_device(acecad->input) [L3802] err = input_register_device(acecad->input) [L3803] COND TRUE err != 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:18446744073709551643}, acecad={-73786976294838206465:0}, bulk_urb={0:0}, dev={-55340232221128654849:0}, DEV_STATE=0, endpoint={18446744073709551621:0}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-73786976294838206465:0}, tmp___4={-92233720368547758081:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3810] EXPR acecad->data [L3810] EXPR acecad->data_dma 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:18446744073709551643}, acecad={-73786976294838206465:0}, acecad->data={-92233720368547758081:0}, acecad->data_dma=0, bulk_urb={0:0}, dev={-55340232221128654849:0}, DEV_STATE=0, endpoint={18446744073709551621:0}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-73786976294838206465:0}, tmp___4={-92233720368547758081:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3810] FCALL usb_free_coherent(dev, 8UL, (void *)acecad->data, acecad->data_dma) 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:18446744073709551643}, acecad={-73786976294838206465:0}, acecad->data={-92233720368547758081:0}, acecad->data_dma=0, bulk_urb={0:0}, dev={-55340232221128654849:0}, DEV_STATE=0, endpoint={18446744073709551621:0}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-73786976294838206465:0}, tmp___4={-92233720368547758081:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3812] FCALL input_free_device(input_dev) [L3813] CALL kfree((void const *)acecad) 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3813] RET kfree((void const *)acecad) 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:18446744073709551643}, acecad={-73786976294838206465:0}, bulk_urb={0:0}, dev={-55340232221128654849:0}, DEV_STATE=0, endpoint={18446744073709551621:0}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-73786976294838206465:0}, tmp___4={-92233720368547758081:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3814] return (err); 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:18446744073709551643}, acecad={-73786976294838206465:0}, bulk_urb={0:0}, dev={-55340232221128654849:0}, DEV_STATE=0, endpoint={18446744073709551621:0}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-73786976294838206465:0}, tmp___4={-92233720368547758081:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3901] RET, EXPR usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3901] ldv_retval_0 = usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3902] COND FALSE !(ldv_retval_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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=0, tmp___1=0, tmp___2=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3893] tmp___0 = __VERIFIER_nondet_int() [L3895] case 0: [L3925] 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, __this_module={18446744073709551618:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___1=0, tmp___2=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3926] COND TRUE ldv_state_variable_0 != 0 [L3927] tmp___2 = __VERIFIER_nondet_int() [L3929] 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___1=0, tmp___2=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3930] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L3931] CALL usb_acecad_exit() [L3861] CALL ldv_usb_deregister_11(& usb_acecad_driver) [L4054] FCALL usb_deregister(arg) [L4055] ldv_state_variable_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:18446744073709551643}, arg={12:0}, arg={12:0}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3861] RET ldv_usb_deregister_11(& usb_acecad_driver) [L3931] RET usb_acecad_exit() [L3932] ldv_state_variable_0 = 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___1=0, tmp___2=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3965] CALL ldv_check_final_state() [L4267] COND TRUE URB_STATE != 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4268] CALL ldv_error() 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4063] reach_error() 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:18446744073709551643}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0: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, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 236 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 122.6s, OverallIterations: 21, TraceHistogramMax: 8, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 76.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 960 mSolverCounterUnknown, 17399 SdHoareTripleChecker+Valid, 47.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16975 mSDsluCounter, 95802 SdHoareTripleChecker+Invalid, 42.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3554 IncrementalHoareTripleChecker+Unchecked, 87736 mSDsCounter, 6249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57110 IncrementalHoareTripleChecker+Invalid, 67873 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6249 mSolverCounterUnsat, 8066 mSDtfsCounter, 57110 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 960 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3443 GetRequests, 2685 SyntacticMatches, 64 SemanticMatches, 694 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 24306 ImplicationChecksByTransitivity, 33.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8668occurred in iteration=20, InterpolantAutomatonStates: 477, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 40011 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 30.6s InterpolantComputationTime, 5135 NumberOfCodeBlocks, 4910 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 4857 ConstructedInterpolants, 388 QuantifiedInterpolants, 19763 SizeOfPredicates, 179 NumberOfNonLiveVariables, 15348 ConjunctsInSsa, 631 ConjunctsInUnsatCore, 30 InterpolantComputations, 16 PerfectInterpolantSequences, 2466/2922 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 16:16:43,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-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_adbdd61d-2443-413f-ab56-781933f38dab/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_adbdd61d-2443-413f-ab56-781933f38dab/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 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b --- 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 16:16:45,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:16:45,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:16:45,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:16:45,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:16:45,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:16:45,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:16:45,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:16:45,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:16:45,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:16:45,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:16:45,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:16:45,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:16:45,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:16:45,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:16:45,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:16:45,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:16:45,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:16:45,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:16:45,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:16:45,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:16:45,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:16:45,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:16:45,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:16:45,389 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:16:45,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:16:45,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:16:45,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:16:45,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:16:45,391 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:16:45,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:16:45,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:16:45,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:16:45,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:16:45,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:16:45,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:16:45,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:16:45,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:16:45,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:16:45,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:16:45,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:16:45,405 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-12-13 16:16:45,422 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:16:45,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:16:45,422 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:16:45,423 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:16:45,423 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:16:45,423 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:16:45,424 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:16:45,424 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:16:45,424 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:16:45,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:16:45,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:16:45,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:16:45,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:16:45,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:16:45,425 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 16:16:45,425 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 16:16:45,425 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 16:16:45,426 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:16:45,426 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:16:45,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:16:45,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:16:45,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:16:45,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:16:45,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:16:45,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:16:45,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:16:45,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:16:45,427 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 16:16:45,427 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 16:16:45,428 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:16:45,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:16:45,428 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:16:45,428 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:16:45,428 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 16:16:45,428 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:16:45,428 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_adbdd61d-2443-413f-ab56-781933f38dab/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_adbdd61d-2443-413f-ab56-781933f38dab/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 -> 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b [2022-12-13 16:16:45,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:16:45,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:16:45,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:16:45,655 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:16:45,655 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:16:45,656 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-12-13 16:16:48,167 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:16:48,436 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:16:48,436 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-12-13 16:16:48,453 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/data/adbef1e3c/31e9adfc43754f1592e98b647ebe9efa/FLAGb847ad702 [2022-12-13 16:16:48,722 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/data/adbef1e3c/31e9adfc43754f1592e98b647ebe9efa [2022-12-13 16:16:48,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:16:48,724 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:16:48,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:16:48,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:16:48,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:16:48,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:16:48" (1/1) ... [2022-12-13 16:16:48,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700111e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:16:48, skipping insertion in model container [2022-12-13 16:16:48,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:16:48" (1/1) ... [2022-12-13 16:16:48,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:16:48,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:16:49,255 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 16:16:49,256 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 16:16:49,288 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,343 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-12-13 16:16:49,346 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-12-13 16:16:49,355 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 16:16:49,358 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 16:16:49,360 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 16:16:49,373 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 16:16:49,380 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 16:16:49,386 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_coherent [2022-12-13 16:16:49,387 WARN L623 FunctionHandler]: Unknown extern function strlcpy [2022-12-13 16:16:49,388 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 16:16:49,389 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 16:16:49,390 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 16:16:49,401 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:16:49,401 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:16:49,401 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:16:49,402 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:16:49,402 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:16:49,403 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:16:49,405 WARN L623 FunctionHandler]: Unknown extern function input_register_device [2022-12-13 16:16:49,405 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 16:16:49,406 WARN L623 FunctionHandler]: Unknown extern function input_free_device [2022-12-13 16:16:49,406 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 16:16:49,409 WARN L623 FunctionHandler]: Unknown extern function input_unregister_device [2022-12-13 16:16:49,409 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 16:16:49,410 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 16:16:49,417 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 16:16:49,430 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-12-13 16:16:49,434 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-12-13 16:16:49,436 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_urb [2022-12-13 16:16:49,437 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-12-13 16:16:49,438 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-12-13 16:16:49,442 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_adbdd61d-2443-413f-ab56-781933f38dab/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-12-13 16:16:49,449 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,452 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,457 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,473 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,474 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,475 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:16:49,496 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-13 16:16:49,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:16:49,565 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 16:16:49,565 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 16:16:49,566 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,570 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-12-13 16:16:49,570 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-12-13 16:16:49,571 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 16:16:49,571 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 16:16:49,571 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 16:16:49,575 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 16:16:49,576 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 16:16:49,578 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_coherent [2022-12-13 16:16:49,579 WARN L623 FunctionHandler]: Unknown extern function strlcpy [2022-12-13 16:16:49,580 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 16:16:49,580 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 16:16:49,581 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 16:16:49,582 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:16:49,583 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:16:49,583 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:16:49,584 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:16:49,584 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:16:49,584 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:16:49,586 WARN L623 FunctionHandler]: Unknown extern function input_register_device [2022-12-13 16:16:49,586 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 16:16:49,586 WARN L623 FunctionHandler]: Unknown extern function input_free_device [2022-12-13 16:16:49,586 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 16:16:49,587 WARN L623 FunctionHandler]: Unknown extern function input_unregister_device [2022-12-13 16:16:49,587 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 16:16:49,588 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 16:16:49,589 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 16:16:49,590 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-12-13 16:16:49,592 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-12-13 16:16:49,593 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_urb [2022-12-13 16:16:49,594 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-12-13 16:16:49,594 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-12-13 16:16:49,594 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_adbdd61d-2443-413f-ab56-781933f38dab/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-12-13 16:16:49,596 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,596 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,598 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,599 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,601 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,601 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:16:49,606 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:16:49,671 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 16:16:49,672 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-12-13 16:16:49,673 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,677 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-12-13 16:16:49,678 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-12-13 16:16:49,678 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 16:16:49,678 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 16:16:49,679 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-12-13 16:16:49,682 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 16:16:49,684 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 16:16:49,686 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_coherent [2022-12-13 16:16:49,687 WARN L623 FunctionHandler]: Unknown extern function strlcpy [2022-12-13 16:16:49,688 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 16:16:49,689 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 16:16:49,689 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-12-13 16:16:49,695 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:16:49,696 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:16:49,696 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:16:49,697 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:16:49,697 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:16:49,697 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-12-13 16:16:49,698 WARN L623 FunctionHandler]: Unknown extern function input_register_device [2022-12-13 16:16:49,699 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 16:16:49,699 WARN L623 FunctionHandler]: Unknown extern function input_free_device [2022-12-13 16:16:49,699 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 16:16:49,700 WARN L623 FunctionHandler]: Unknown extern function input_unregister_device [2022-12-13 16:16:49,700 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 16:16:49,701 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 16:16:49,702 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 16:16:49,703 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-12-13 16:16:49,705 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-12-13 16:16:49,706 WARN L623 FunctionHandler]: Unknown extern function usb_alloc_urb [2022-12-13 16:16:49,706 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-12-13 16:16:49,707 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-12-13 16:16:49,707 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_adbdd61d-2443-413f-ab56-781933f38dab/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-12-13 16:16:49,708 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,709 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,710 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,711 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,712 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,713 WARN L623 FunctionHandler]: Unknown extern function ldv_malloc [2022-12-13 16:16:49,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:16:49,735 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:16:49,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:16:49 WrapperNode [2022-12-13 16:16:49,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:16:49,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:16:49,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:16:49,737 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:16:49,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:16:49" (1/1) ... [2022-12-13 16:16:49,768 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:16:49" (1/1) ... [2022-12-13 16:16:49,797 INFO L138 Inliner]: procedures = 118, calls = 318, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 771 [2022-12-13 16:16:49,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:16:49,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:16:49,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:16:49,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:16:49,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:16:49" (1/1) ... [2022-12-13 16:16:49,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:16:49" (1/1) ... [2022-12-13 16:16:49,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:16:49" (1/1) ... [2022-12-13 16:16:49,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:16:49" (1/1) ... [2022-12-13 16:16:49,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:16:49" (1/1) ... [2022-12-13 16:16:49,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:16:49" (1/1) ... [2022-12-13 16:16:49,836 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:16:49" (1/1) ... [2022-12-13 16:16:49,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:16:49" (1/1) ... [2022-12-13 16:16:49,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:16:49,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:16:49,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:16:49,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:16:49,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:16:49" (1/1) ... [2022-12-13 16:16:49,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:16:49,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:16:49,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:16:49,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:16:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-12-13 16:16:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-12-13 16:16:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 16:16:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-12-13 16:16:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-12-13 16:16:49,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-12-13 16:16:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-12-13 16:16:49,909 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-12-13 16:16:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-12-13 16:16:49,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-12-13 16:16:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-12-13 16:16:49,909 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-12-13 16:16:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-12-13 16:16:49,909 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-12-13 16:16:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-12-13 16:16:49,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-12-13 16:16:49,910 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-12-13 16:16:49,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-12-13 16:16:49,910 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-12-13 16:16:49,910 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-12-13 16:16:49,910 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-12-13 16:16:49,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-12-13 16:16:49,910 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 16:16:49,910 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 16:16:49,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 16:16:49,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:16:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-12-13 16:16:49,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-12-13 16:16:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 16:16:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-12-13 16:16:49,911 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-12-13 16:16:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-12-13 16:16:49,911 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-12-13 16:16:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-12-13 16:16:49,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-12-13 16:16:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 16:16:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-12-13 16:16:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-12-13 16:16:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-12-13 16:16:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:16:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 16:16:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 16:16:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-12-13 16:16:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-12-13 16:16:49,912 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-12-13 16:16:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 16:16:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-12-13 16:16:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-12-13 16:16:49,913 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-12-13 16:16:49,913 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-12-13 16:16:49,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:16:49,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:16:50,147 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:16:50,149 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:16:50,224 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-12-13 16:16:56,692 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:16:56,700 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:16:56,701 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 16:16:56,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:16:56 BoogieIcfgContainer [2022-12-13 16:16:56,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:16:56,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:16:56,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:16:56,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:16:56,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:16:48" (1/3) ... [2022-12-13 16:16:56,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178c011b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:16:56, skipping insertion in model container [2022-12-13 16:16:56,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:16:49" (2/3) ... [2022-12-13 16:16:56,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178c011b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:16:56, skipping insertion in model container [2022-12-13 16:16:56,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:16:56" (3/3) ... [2022-12-13 16:16:56,712 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-12-13 16:16:56,729 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:16:56,730 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 16:16:56,769 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:16:56,773 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;@552be33f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:16:56,773 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 16:16:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 172 states have (on average 1.319767441860465) internal successors, (227), 183 states have internal predecessors, (227), 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 16:16:56,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 16:16:56,783 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:16:56,784 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 16:16:56,784 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:16:56,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:16:56,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1744056524, now seen corresponding path program 1 times [2022-12-13 16:16:56,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:16:56,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508714247] [2022-12-13 16:16:56,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:16:56,802 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 16:16:56,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:16:56,803 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:16:56,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:16:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:57,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 16:16:57,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:16:57,055 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 16:16:57,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:16:57,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:16:57,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508714247] [2022-12-13 16:16:57,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508714247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:16:57,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:16:57,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:16:57,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900396693] [2022-12-13 16:16:57,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:16:57,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 16:16:57,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:16:57,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 16:16:57,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:16:57,090 INFO L87 Difference]: Start difference. First operand has 232 states, 172 states have (on average 1.319767441860465) internal successors, (227), 183 states have internal predecessors, (227), 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 16:16:57,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:16:57,141 INFO L93 Difference]: Finished difference Result 459 states and 624 transitions. [2022-12-13 16:16:57,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 16:16:57,143 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 16:16:57,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:16:57,152 INFO L225 Difference]: With dead ends: 459 [2022-12-13 16:16:57,152 INFO L226 Difference]: Without dead ends: 221 [2022-12-13 16:16:57,155 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 16:16:57,158 INFO L413 NwaCegarLoop]: 302 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, 302 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 16:16:57,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:16:57,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-12-13 16:16:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-12-13 16:16:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 167 states have (on average 1.2874251497005988) internal successors, (215), 172 states have internal predecessors, (215), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-13 16:16:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 289 transitions. [2022-12-13 16:16:57,205 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 289 transitions. Word has length 32 [2022-12-13 16:16:57,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:16:57,206 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 289 transitions. [2022-12-13 16:16:57,206 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 16:16:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 289 transitions. [2022-12-13 16:16:57,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 16:16:57,208 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:16:57,208 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 16:16:57,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:16:57,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:16:57,410 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:16:57,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:16:57,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2128208946, now seen corresponding path program 1 times [2022-12-13 16:16:57,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:16:57,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328206127] [2022-12-13 16:16:57,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:16:57,416 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 16:16:57,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:16:57,420 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:16:57,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:16:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:57,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:16:57,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:16:57,815 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 16:16:57,815 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:16:57,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:16:57,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328206127] [2022-12-13 16:16:57,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328206127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:16:57,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:16:57,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:16:57,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125488749] [2022-12-13 16:16:57,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:16:57,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:16:57,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:16:57,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:16:57,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:16:57,817 INFO L87 Difference]: Start difference. First operand 221 states and 289 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 16:16:57,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:16:57,963 INFO L93 Difference]: Finished difference Result 629 states and 826 transitions. [2022-12-13 16:16:57,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:16:57,964 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 16:16:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:16:57,967 INFO L225 Difference]: With dead ends: 629 [2022-12-13 16:16:57,968 INFO L226 Difference]: Without dead ends: 413 [2022-12-13 16:16:57,969 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 16:16:57,970 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 257 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 598 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 16:16:57,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 598 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:16:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-12-13 16:16:58,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2022-12-13 16:16:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 312 states have (on average 1.2820512820512822) internal successors, (400), 319 states have internal predecessors, (400), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-12-13 16:16:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 540 transitions. [2022-12-13 16:16:58,008 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 540 transitions. Word has length 32 [2022-12-13 16:16:58,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:16:58,009 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 540 transitions. [2022-12-13 16:16:58,009 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 16:16:58,009 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 540 transitions. [2022-12-13 16:16:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 16:16:58,011 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:16:58,011 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 16:16:58,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:16:58,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:16:58,212 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:16:58,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:16:58,212 INFO L85 PathProgramCache]: Analyzing trace with hash 283881045, now seen corresponding path program 1 times [2022-12-13 16:16:58,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:16:58,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360153762] [2022-12-13 16:16:58,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:16:58,213 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 16:16:58,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:16:58,214 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:16:58,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:16:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:58,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 16:16:58,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:16:58,493 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 16:16:58,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:16:58,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:16:58,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360153762] [2022-12-13 16:16:58,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360153762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:16:58,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:16:58,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:16:58,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25232397] [2022-12-13 16:16:58,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:16:58,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:16:58,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:16:58,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:16:58,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:16:58,495 INFO L87 Difference]: Start difference. First operand 413 states and 540 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 16:16:58,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:16:58,799 INFO L93 Difference]: Finished difference Result 961 states and 1286 transitions. [2022-12-13 16:16:58,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:16:58,799 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 16:16:58,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:16:58,806 INFO L225 Difference]: With dead ends: 961 [2022-12-13 16:16:58,806 INFO L226 Difference]: Without dead ends: 563 [2022-12-13 16:16:58,809 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 16:16:58,810 INFO L413 NwaCegarLoop]: 457 mSDtfsCounter, 625 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:16:58,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1116 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:16:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-12-13 16:16:58,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 416. [2022-12-13 16:16:58,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 315 states have (on average 1.276190476190476) internal successors, (402), 322 states have internal predecessors, (402), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-12-13 16:16:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 542 transitions. [2022-12-13 16:16:58,857 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 542 transitions. Word has length 55 [2022-12-13 16:16:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:16:58,857 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 542 transitions. [2022-12-13 16:16:58,857 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 16:16:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 542 transitions. [2022-12-13 16:16:58,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 16:16:58,859 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:16:58,859 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 16:16:58,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:16:59,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:16:59,061 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:16:59,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:16:59,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1021197717, now seen corresponding path program 1 times [2022-12-13 16:16:59,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:16:59,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647179818] [2022-12-13 16:16:59,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:16:59,067 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 16:16:59,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:16:59,070 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:16:59,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:16:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:16:59,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:16:59,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:16:59,536 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 16:16:59,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:16:59,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:16:59,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647179818] [2022-12-13 16:16:59,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647179818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:16:59,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:16:59,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:16:59,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603931464] [2022-12-13 16:16:59,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:16:59,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:16:59,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:16:59,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:16:59,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:16:59,539 INFO L87 Difference]: Start difference. First operand 416 states and 542 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 16:16:59,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:16:59,630 INFO L93 Difference]: Finished difference Result 1211 states and 1587 transitions. [2022-12-13 16:16:59,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:16:59,631 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 16:16:59,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:16:59,634 INFO L225 Difference]: With dead ends: 1211 [2022-12-13 16:16:59,634 INFO L226 Difference]: Without dead ends: 810 [2022-12-13 16:16:59,635 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 16:16:59,635 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 245 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:16:59,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 659 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:16:59,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-12-13 16:16:59,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 808. [2022-12-13 16:16:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 616 states have (on average 1.271103896103896) internal successors, (783), 627 states have internal predecessors, (783), 137 states have call successors, (137), 55 states have call predecessors, (137), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-12-13 16:16:59,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1053 transitions. [2022-12-13 16:16:59,683 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1053 transitions. Word has length 55 [2022-12-13 16:16:59,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:16:59,683 INFO L495 AbstractCegarLoop]: Abstraction has 808 states and 1053 transitions. [2022-12-13 16:16:59,684 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 16:16:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1053 transitions. [2022-12-13 16:16:59,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 16:16:59,685 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:16:59,685 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 16:16:59,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:16:59,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:16:59,886 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:16:59,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:16:59,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1592367837, now seen corresponding path program 1 times [2022-12-13 16:16:59,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:16:59,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766198769] [2022-12-13 16:16:59,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:16:59,887 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 16:16:59,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:16:59,888 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:16:59,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:17:00,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:17:00,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:17:00,235 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 16:17:00,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:17:00,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:17:00,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766198769] [2022-12-13 16:17:00,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766198769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:17:00,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:17:00,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:17:00,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805743332] [2022-12-13 16:17:00,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:17:00,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:17:00,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:17:00,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:17:00,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:17:00,240 INFO L87 Difference]: Start difference. First operand 808 states and 1053 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 16:17:00,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:17:00,291 INFO L93 Difference]: Finished difference Result 810 states and 1054 transitions. [2022-12-13 16:17:00,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:17:00,291 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 16:17:00,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:17:00,294 INFO L225 Difference]: With dead ends: 810 [2022-12-13 16:17:00,294 INFO L226 Difference]: Without dead ends: 807 [2022-12-13 16:17:00,294 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 16:17:00,295 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 247 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 286 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 16:17:00,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 286 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:17:00,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2022-12-13 16:17:00,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 807. [2022-12-13 16:17:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 616 states have (on average 1.2694805194805194) internal successors, (782), 626 states have internal predecessors, (782), 136 states have call successors, (136), 55 states have call predecessors, (136), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-12-13 16:17:00,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1051 transitions. [2022-12-13 16:17:00,339 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1051 transitions. Word has length 56 [2022-12-13 16:17:00,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:17:00,340 INFO L495 AbstractCegarLoop]: Abstraction has 807 states and 1051 transitions. [2022-12-13 16:17:00,340 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 16:17:00,340 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1051 transitions. [2022-12-13 16:17:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 16:17:00,341 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:17:00,341 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 16:17:00,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:00,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:00,542 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:17:00,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:17:00,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2118777240, now seen corresponding path program 1 times [2022-12-13 16:17:00,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:17:00,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312495578] [2022-12-13 16:17:00,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:17:00,543 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 16:17:00,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:17:00,543 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:00,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:17:00,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:17:00,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:17:00,888 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 16:17:00,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:17:00,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:17:00,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312495578] [2022-12-13 16:17:00,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312495578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:17:00,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:17:00,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:17:00,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434075052] [2022-12-13 16:17:00,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:17:00,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:17:00,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:17:00,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:17:00,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:17:00,891 INFO L87 Difference]: Start difference. First operand 807 states and 1051 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 16:17:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:17:00,939 INFO L93 Difference]: Finished difference Result 809 states and 1052 transitions. [2022-12-13 16:17:00,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:17:00,940 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 16:17:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:17:00,942 INFO L225 Difference]: With dead ends: 809 [2022-12-13 16:17:00,942 INFO L226 Difference]: Without dead ends: 806 [2022-12-13 16:17:00,943 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 16:17:00,943 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 244 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 284 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 16:17:00,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 284 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:17:00,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-12-13 16:17:00,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2022-12-13 16:17:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 616 states have (on average 1.2678571428571428) internal successors, (781), 625 states have internal predecessors, (781), 135 states have call successors, (135), 55 states have call predecessors, (135), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-12-13 16:17:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1049 transitions. [2022-12-13 16:17:00,989 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1049 transitions. Word has length 57 [2022-12-13 16:17:00,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:17:00,989 INFO L495 AbstractCegarLoop]: Abstraction has 806 states and 1049 transitions. [2022-12-13 16:17:00,989 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 16:17:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1049 transitions. [2022-12-13 16:17:00,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 16:17:00,990 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:17:00,990 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 16:17:01,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:01,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:01,192 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:17:01,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:17:01,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1257604416, now seen corresponding path program 1 times [2022-12-13 16:17:01,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:17:01,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497962390] [2022-12-13 16:17:01,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:17:01,196 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 16:17:01,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:17:01,198 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:01,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:17:01,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:17:01,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:17:01,588 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 16:17:01,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:17:01,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:17:01,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497962390] [2022-12-13 16:17:01,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497962390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:17:01,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:17:01,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:17:01,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917873344] [2022-12-13 16:17:01,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:17:01,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:17:01,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:17:01,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:17:01,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:17:01,590 INFO L87 Difference]: Start difference. First operand 806 states and 1049 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 16:17:01,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:17:01,629 INFO L93 Difference]: Finished difference Result 808 states and 1050 transitions. [2022-12-13 16:17:01,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:17:01,629 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 16:17:01,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:17:01,631 INFO L225 Difference]: With dead ends: 808 [2022-12-13 16:17:01,632 INFO L226 Difference]: Without dead ends: 797 [2022-12-13 16:17:01,632 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 16:17:01,632 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 241 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 283 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 16:17:01,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:17:01,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2022-12-13 16:17:01,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2022-12-13 16:17:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 608 states have (on average 1.2664473684210527) internal successors, (770), 616 states have internal predecessors, (770), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-12-13 16:17:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1037 transitions. [2022-12-13 16:17:01,679 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1037 transitions. Word has length 58 [2022-12-13 16:17:01,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:17:01,679 INFO L495 AbstractCegarLoop]: Abstraction has 797 states and 1037 transitions. [2022-12-13 16:17:01,679 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 16:17:01,679 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1037 transitions. [2022-12-13 16:17:01,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-12-13 16:17:01,681 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:17:01,682 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] [2022-12-13 16:17:01,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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)] Forceful destruction successful, exit code 0 [2022-12-13 16:17:01,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:01,882 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:17:01,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:17:01,883 INFO L85 PathProgramCache]: Analyzing trace with hash 89004713, now seen corresponding path program 1 times [2022-12-13 16:17:01,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:17:01,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165439801] [2022-12-13 16:17:01,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:17:01,884 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 16:17:01,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:17:01,884 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:01,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:17:02,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:17:02,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:17:02,280 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 16:17:02,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:17:02,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:17:02,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165439801] [2022-12-13 16:17:02,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165439801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:17:02,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:17:02,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:17:02,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121864151] [2022-12-13 16:17:02,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:17:02,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:17:02,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:17:02,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:17:02,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:17:02,283 INFO L87 Difference]: Start difference. First operand 797 states and 1037 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 16:17:02,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:17:02,407 INFO L93 Difference]: Finished difference Result 1643 states and 2145 transitions. [2022-12-13 16:17:02,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:17:02,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 152 [2022-12-13 16:17:02,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:17:02,411 INFO L225 Difference]: With dead ends: 1643 [2022-12-13 16:17:02,411 INFO L226 Difference]: Without dead ends: 861 [2022-12-13 16:17:02,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 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 16:17:02,413 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 41 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 547 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 16:17:02,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 547 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:17:02,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2022-12-13 16:17:02,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 851. [2022-12-13 16:17:02,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 661 states have (on average 1.2768532526475038) internal successors, (844), 669 states have internal predecessors, (844), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-12-13 16:17:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1111 transitions. [2022-12-13 16:17:02,467 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1111 transitions. Word has length 152 [2022-12-13 16:17:02,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:17:02,468 INFO L495 AbstractCegarLoop]: Abstraction has 851 states and 1111 transitions. [2022-12-13 16:17:02,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 16:17:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1111 transitions. [2022-12-13 16:17:02,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 16:17:02,470 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:17:02,470 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] [2022-12-13 16:17:02,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:02,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:02,671 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:17:02,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:17:02,671 INFO L85 PathProgramCache]: Analyzing trace with hash 478785898, now seen corresponding path program 1 times [2022-12-13 16:17:02,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:17:02,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011431169] [2022-12-13 16:17:02,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:17:02,672 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 16:17:02,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:17:02,673 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:02,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:17:03,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 16:17:03,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:17:03,084 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 16:17:03,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:17:03,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:17:03,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011431169] [2022-12-13 16:17:03,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011431169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:17:03,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:17:03,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:17:03,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218780906] [2022-12-13 16:17:03,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:17:03,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:17:03,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:17:03,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:17:03,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:17:03,087 INFO L87 Difference]: Start difference. First operand 851 states and 1111 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 16:17:03,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:17:03,207 INFO L93 Difference]: Finished difference Result 1711 states and 2259 transitions. [2022-12-13 16:17:03,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:17:03,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 161 [2022-12-13 16:17:03,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:17:03,212 INFO L225 Difference]: With dead ends: 1711 [2022-12-13 16:17:03,212 INFO L226 Difference]: Without dead ends: 879 [2022-12-13 16:17:03,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:17:03,214 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 1 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:17:03,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1112 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:17:03,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2022-12-13 16:17:03,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 867. [2022-12-13 16:17:03,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 673 states have (on average 1.2719167904903417) internal successors, (856), 681 states have internal predecessors, (856), 134 states have call successors, (134), 56 states have call predecessors, (134), 59 states have return successors, (153), 137 states have call predecessors, (153), 133 states have call successors, (153) [2022-12-13 16:17:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1143 transitions. [2022-12-13 16:17:03,273 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1143 transitions. Word has length 161 [2022-12-13 16:17:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:17:03,273 INFO L495 AbstractCegarLoop]: Abstraction has 867 states and 1143 transitions. [2022-12-13 16:17:03,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 16:17:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1143 transitions. [2022-12-13 16:17:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-13 16:17:03,276 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:17:03,276 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] [2022-12-13 16:17:03,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:03,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:03,476 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:17:03,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:17:03,477 INFO L85 PathProgramCache]: Analyzing trace with hash -2130922114, now seen corresponding path program 1 times [2022-12-13 16:17:03,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:17:03,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491343258] [2022-12-13 16:17:03,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:17:03,477 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 16:17:03,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:17:03,478 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:03,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:17:03,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 16:17:03,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:17:03,874 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 16:17:03,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:17:03,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:17:03,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491343258] [2022-12-13 16:17:03,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491343258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:17:03,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:17:03,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:17:03,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192151590] [2022-12-13 16:17:03,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:17:03,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:17:03,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:17:03,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:17:03,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:17:03,875 INFO L87 Difference]: Start difference. First operand 867 states and 1143 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 16:17:04,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:17:04,001 INFO L93 Difference]: Finished difference Result 2293 states and 3096 transitions. [2022-12-13 16:17:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:17:04,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 167 [2022-12-13 16:17:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:17:04,005 INFO L225 Difference]: With dead ends: 2293 [2022-12-13 16:17:04,006 INFO L226 Difference]: Without dead ends: 1445 [2022-12-13 16:17:04,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 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 16:17:04,007 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 322 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1371 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:17:04,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1371 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:17:04,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2022-12-13 16:17:04,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 879. [2022-12-13 16:17:04,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 685 states have (on average 1.2671532846715328) internal successors, (868), 693 states have internal predecessors, (868), 134 states have call successors, (134), 56 states have call predecessors, (134), 59 states have return successors, (153), 137 states have call predecessors, (153), 133 states have call successors, (153) [2022-12-13 16:17:04,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1155 transitions. [2022-12-13 16:17:04,068 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1155 transitions. Word has length 167 [2022-12-13 16:17:04,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:17:04,068 INFO L495 AbstractCegarLoop]: Abstraction has 879 states and 1155 transitions. [2022-12-13 16:17:04,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 16:17:04,069 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1155 transitions. [2022-12-13 16:17:04,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-13 16:17:04,071 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:17:04,071 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] [2022-12-13 16:17:04,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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)] Forceful destruction successful, exit code 0 [2022-12-13 16:17:04,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:04,272 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:17:04,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:17:04,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1336268347, now seen corresponding path program 1 times [2022-12-13 16:17:04,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:17:04,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714094188] [2022-12-13 16:17:04,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:17:04,273 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 16:17:04,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:17:04,274 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:04,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:17:04,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 16:17:04,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:17:04,901 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 16:17:04,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:17:04,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:17:04,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714094188] [2022-12-13 16:17:04,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714094188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:17:04,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:17:04,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 16:17:04,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195307818] [2022-12-13 16:17:04,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:17:04,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 16:17:04,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:17:04,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 16:17:04,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:17:04,902 INFO L87 Difference]: Start difference. First operand 879 states and 1155 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 16:17:07,164 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 16:17:08,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 16:17:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:17:09,032 INFO L93 Difference]: Finished difference Result 2287 states and 3081 transitions. [2022-12-13 16:17:09,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 16:17:09,033 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) Word has length 169 [2022-12-13 16:17:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:17:09,036 INFO L225 Difference]: With dead ends: 2287 [2022-12-13 16:17:09,037 INFO L226 Difference]: Without dead ends: 1427 [2022-12-13 16:17:09,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 161 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 16:17:09,038 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 203 mSDsluCounter, 2986 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 3377 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:17:09,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 3377 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-12-13 16:17:09,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2022-12-13 16:17:09,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 911. [2022-12-13 16:17:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 713 states have (on average 1.2566619915848527) internal successors, (896), 717 states have internal predecessors, (896), 134 states have call successors, (134), 56 states have call predecessors, (134), 63 states have return successors, (161), 145 states have call predecessors, (161), 133 states have call successors, (161) [2022-12-13 16:17:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1191 transitions. [2022-12-13 16:17:09,106 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1191 transitions. Word has length 169 [2022-12-13 16:17:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:17:09,106 INFO L495 AbstractCegarLoop]: Abstraction has 911 states and 1191 transitions. [2022-12-13 16:17:09,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 16:17:09,106 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1191 transitions. [2022-12-13 16:17:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-13 16:17:09,114 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:17:09,114 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] [2022-12-13 16:17:09,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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)] Forceful destruction successful, exit code 0 [2022-12-13 16:17:09,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:09,314 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:17:09,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:17:09,315 INFO L85 PathProgramCache]: Analyzing trace with hash -981805263, now seen corresponding path program 2 times [2022-12-13 16:17:09,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:17:09,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041093466] [2022-12-13 16:17:09,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:17:09,315 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 16:17:09,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:17:09,316 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:09,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:09,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 16:17:09,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:17:09,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 16:17:09,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:17:09,654 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 16:17:09,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:17:09,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:17:09,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041093466] [2022-12-13 16:17:09,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041093466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:17:09,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:17:09,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:17:09,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132911457] [2022-12-13 16:17:09,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:17:09,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:17:09,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:17:09,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:17:09,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:17:09,656 INFO L87 Difference]: Start difference. First operand 911 states and 1191 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 16:17:10,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:17:10,761 INFO L93 Difference]: Finished difference Result 1849 states and 2509 transitions. [2022-12-13 16:17:10,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:17:10,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 175 [2022-12-13 16:17:10,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:17:10,766 INFO L225 Difference]: With dead ends: 1849 [2022-12-13 16:17:10,766 INFO L226 Difference]: Without dead ends: 1399 [2022-12-13 16:17:10,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:17:10,767 INFO L413 NwaCegarLoop]: 422 mSDtfsCounter, 590 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 16:17:10,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 1814 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 16:17:10,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2022-12-13 16:17:10,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 917. [2022-12-13 16:17:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 719 states have (on average 1.25452016689847) internal successors, (902), 723 states have internal predecessors, (902), 134 states have call successors, (134), 56 states have call predecessors, (134), 63 states have return successors, (161), 145 states have call predecessors, (161), 133 states have call successors, (161) [2022-12-13 16:17:10,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1197 transitions. [2022-12-13 16:17:10,873 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1197 transitions. Word has length 175 [2022-12-13 16:17:10,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:17:10,873 INFO L495 AbstractCegarLoop]: Abstraction has 917 states and 1197 transitions. [2022-12-13 16:17:10,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 16:17:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1197 transitions. [2022-12-13 16:17:10,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-12-13 16:17:10,876 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:17:10,876 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 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, 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 16:17:10,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:11,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:11,077 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:17:11,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:17:11,077 INFO L85 PathProgramCache]: Analyzing trace with hash 329175588, now seen corresponding path program 1 times [2022-12-13 16:17:11,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:17:11,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063157562] [2022-12-13 16:17:11,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:17:11,078 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 16:17:11,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:17:11,079 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:11,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:17:11,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 16:17:11,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:17:12,040 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-12-13 16:17:12,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:17:12,707 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-12-13 16:17:12,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:17:12,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063157562] [2022-12-13 16:17:12,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063157562] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:17:12,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:17:12,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-12-13 16:17:12,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572054744] [2022-12-13 16:17:12,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:17:12,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 16:17:12,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:17:12,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 16:17:12,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-12-13 16:17:12,710 INFO L87 Difference]: Start difference. First operand 917 states and 1197 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, (25), 2 states have call predecessors, (25), 6 states have return successors, (27), 8 states have call predecessors, (27), 4 states have call successors, (27) [2022-12-13 16:17:15,161 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 16:17:17,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 16:17:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:17:17,311 INFO L93 Difference]: Finished difference Result 2041 states and 2694 transitions. [2022-12-13 16:17:17,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:17:17,313 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, (25), 2 states have call predecessors, (25), 6 states have return successors, (27), 8 states have call predecessors, (27), 4 states have call successors, (27) Word has length 203 [2022-12-13 16:17:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:17:17,315 INFO L225 Difference]: With dead ends: 2041 [2022-12-13 16:17:17,316 INFO L226 Difference]: Without dead ends: 1143 [2022-12-13 16:17:17,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 390 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 16:17:17,317 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 61 mSDsluCounter, 4176 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 4512 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:17:17,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 4512 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-12-13 16:17:17,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2022-12-13 16:17:17,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 925. [2022-12-13 16:17:17,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 723 states have (on average 1.2531120331950207) internal successors, (906), 727 states have internal predecessors, (906), 138 states have call successors, (138), 56 states have call predecessors, (138), 63 states have return successors, (169), 149 states have call predecessors, (169), 137 states have call successors, (169) [2022-12-13 16:17:17,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1213 transitions. [2022-12-13 16:17:17,401 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1213 transitions. Word has length 203 [2022-12-13 16:17:17,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:17:17,401 INFO L495 AbstractCegarLoop]: Abstraction has 925 states and 1213 transitions. [2022-12-13 16:17:17,402 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, (25), 2 states have call predecessors, (25), 6 states have return successors, (27), 8 states have call predecessors, (27), 4 states have call successors, (27) [2022-12-13 16:17:17,402 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1213 transitions. [2022-12-13 16:17:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-12-13 16:17:17,404 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:17:17,404 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:17:17,434 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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)] Ended with exit code 0 [2022-12-13 16:17:17,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:17,605 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:17:17,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:17:17,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1423611720, now seen corresponding path program 2 times [2022-12-13 16:17:17,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:17:17,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812845843] [2022-12-13 16:17:17,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:17:17,606 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 16:17:17,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:17:17,607 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:17,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:18,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 16:17:18,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:17:18,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 1291 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:17:18,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:17:18,948 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-12-13 16:17:18,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:17:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-12-13 16:17:19,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:17:19,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812845843] [2022-12-13 16:17:19,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812845843] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:17:19,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:17:19,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-12-13 16:17:19,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894657018] [2022-12-13 16:17:19,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:17:19,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:17:19,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:17:19,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:17:19,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:17:19,236 INFO L87 Difference]: Start difference. First operand 925 states and 1213 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, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-12-13 16:17:20,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:17:20,891 INFO L93 Difference]: Finished difference Result 5448 states and 7175 transitions. [2022-12-13 16:17:20,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:17:20,893 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, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 209 [2022-12-13 16:17:20,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:17:20,904 INFO L225 Difference]: With dead ends: 5448 [2022-12-13 16:17:20,904 INFO L226 Difference]: Without dead ends: 5440 [2022-12-13 16:17:20,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 413 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 16:17:20,906 INFO L413 NwaCegarLoop]: 696 mSDtfsCounter, 1079 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:17:20,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 1993 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-13 16:17:20,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2022-12-13 16:17:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5407. [2022-12-13 16:17:21,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5407 states, 4235 states have (on average 1.2578512396694215) internal successors, (5327), 4267 states have internal predecessors, (5327), 808 states have call successors, (808), 316 states have call predecessors, (808), 363 states have return successors, (999), 871 states have call predecessors, (999), 807 states have call successors, (999) [2022-12-13 16:17:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5407 states to 5407 states and 7134 transitions. [2022-12-13 16:17:21,518 INFO L78 Accepts]: Start accepts. Automaton has 5407 states and 7134 transitions. Word has length 209 [2022-12-13 16:17:21,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:17:21,518 INFO L495 AbstractCegarLoop]: Abstraction has 5407 states and 7134 transitions. [2022-12-13 16:17:21,519 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, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-12-13 16:17:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 5407 states and 7134 transitions. [2022-12-13 16:17:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-12-13 16:17:21,525 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:17:21,525 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:17:21,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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)] Forceful destruction successful, exit code 0 [2022-12-13 16:17:21,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:21,726 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:17:21,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:17:21,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1860238326, now seen corresponding path program 1 times [2022-12-13 16:17:21,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:17:21,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240595702] [2022-12-13 16:17:21,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:17:21,727 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 16:17:21,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:17:21,728 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:21,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:17:22,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 16:17:22,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:17:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 16:17:22,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:17:22,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:17:22,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240595702] [2022-12-13 16:17:22,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240595702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:17:22,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:17:22,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:17:22,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576891178] [2022-12-13 16:17:22,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:17:22,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:17:22,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:17:22,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:17:22,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:17:22,623 INFO L87 Difference]: Start difference. First operand 5407 states and 7134 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, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-12-13 16:17:23,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:17:23,521 INFO L93 Difference]: Finished difference Result 13073 states and 17607 transitions. [2022-12-13 16:17:23,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:17:23,523 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, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 209 [2022-12-13 16:17:23,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:17:23,540 INFO L225 Difference]: With dead ends: 13073 [2022-12-13 16:17:23,540 INFO L226 Difference]: Without dead ends: 7685 [2022-12-13 16:17:23,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 204 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 16:17:23,547 INFO L413 NwaCegarLoop]: 394 mSDtfsCounter, 93 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:17:23,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1853 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:17:23,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7685 states. [2022-12-13 16:17:24,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7685 to 5479. [2022-12-13 16:17:24,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5479 states, 4307 states have (on average 1.2535407476201532) internal successors, (5399), 4315 states have internal predecessors, (5399), 808 states have call successors, (808), 316 states have call predecessors, (808), 363 states have return successors, (999), 895 states have call predecessors, (999), 807 states have call successors, (999) [2022-12-13 16:17:24,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 7206 transitions. [2022-12-13 16:17:24,192 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 7206 transitions. Word has length 209 [2022-12-13 16:17:24,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:17:24,192 INFO L495 AbstractCegarLoop]: Abstraction has 5479 states and 7206 transitions. [2022-12-13 16:17:24,192 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, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-12-13 16:17:24,192 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 7206 transitions. [2022-12-13 16:17:24,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-12-13 16:17:24,198 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:17:24,198 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 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 16:17:24,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:24,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:24,399 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:17:24,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:17:24,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2085141046, now seen corresponding path program 2 times [2022-12-13 16:17:24,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:17:24,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548584405] [2022-12-13 16:17:24,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:17:24,401 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 16:17:24,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:17:24,401 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:24,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:24,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 16:17:24,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:17:24,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:17:24,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:17:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-12-13 16:17:24,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:17:24,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:17:24,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548584405] [2022-12-13 16:17:24,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548584405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:17:24,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:17:24,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:17:24,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880630913] [2022-12-13 16:17:24,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:17:24,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:17:24,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:17:24,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:17:24,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:17:24,737 INFO L87 Difference]: Start difference. First operand 5479 states and 7206 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-12-13 16:17:26,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:17:26,005 INFO L93 Difference]: Finished difference Result 17429 states and 23042 transitions. [2022-12-13 16:17:26,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:17:26,006 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 215 [2022-12-13 16:17:26,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:17:26,046 INFO L225 Difference]: With dead ends: 17429 [2022-12-13 16:17:26,046 INFO L226 Difference]: Without dead ends: 11969 [2022-12-13 16:17:26,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 213 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 16:17:26,058 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 337 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 957 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 16:17:26,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 957 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:17:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11969 states. [2022-12-13 16:17:26,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11969 to 5503. [2022-12-13 16:17:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5503 states, 4331 states have (on average 1.252135765412145) internal successors, (5423), 4347 states have internal predecessors, (5423), 808 states have call successors, (808), 316 states have call predecessors, (808), 363 states have return successors, (999), 887 states have call predecessors, (999), 807 states have call successors, (999) [2022-12-13 16:17:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5503 states to 5503 states and 7230 transitions. [2022-12-13 16:17:26,788 INFO L78 Accepts]: Start accepts. Automaton has 5503 states and 7230 transitions. Word has length 215 [2022-12-13 16:17:26,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:17:26,788 INFO L495 AbstractCegarLoop]: Abstraction has 5503 states and 7230 transitions. [2022-12-13 16:17:26,789 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-12-13 16:17:26,789 INFO L276 IsEmpty]: Start isEmpty. Operand 5503 states and 7230 transitions. [2022-12-13 16:17:26,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-12-13 16:17:26,794 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:17:26,795 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 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 16:17:26,805 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:26,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:26,995 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:17:26,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:17:26,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1577658726, now seen corresponding path program 1 times [2022-12-13 16:17:26,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:17:26,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262224913] [2022-12-13 16:17:26,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:17:26,997 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 16:17:26,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:17:26,997 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:26,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:17:27,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 1320 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 16:17:27,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:17:27,883 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-12-13 16:17:27,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:17:27,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:17:27,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262224913] [2022-12-13 16:17:27,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262224913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:17:27,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:17:27,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:17:27,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590800145] [2022-12-13 16:17:27,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:17:27,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:17:27,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:17:27,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:17:27,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:17:27,885 INFO L87 Difference]: Start difference. First operand 5503 states and 7230 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-12-13 16:17:29,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:17:29,321 INFO L93 Difference]: Finished difference Result 12129 states and 16597 transitions. [2022-12-13 16:17:29,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:17:29,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 222 [2022-12-13 16:17:29,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:17:29,339 INFO L225 Difference]: With dead ends: 12129 [2022-12-13 16:17:29,339 INFO L226 Difference]: Without dead ends: 9365 [2022-12-13 16:17:29,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:17:29,344 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 304 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:17:29,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1865 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:17:29,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9365 states. [2022-12-13 16:17:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9365 to 5575. [2022-12-13 16:17:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5575 states, 4403 states have (on average 1.248012718600954) internal successors, (5495), 4395 states have internal predecessors, (5495), 808 states have call successors, (808), 316 states have call predecessors, (808), 363 states have return successors, (999), 911 states have call predecessors, (999), 807 states have call successors, (999) [2022-12-13 16:17:30,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5575 states to 5575 states and 7302 transitions. [2022-12-13 16:17:30,129 INFO L78 Accepts]: Start accepts. Automaton has 5575 states and 7302 transitions. Word has length 222 [2022-12-13 16:17:30,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:17:30,129 INFO L495 AbstractCegarLoop]: Abstraction has 5575 states and 7302 transitions. [2022-12-13 16:17:30,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-12-13 16:17:30,129 INFO L276 IsEmpty]: Start isEmpty. Operand 5575 states and 7302 transitions. [2022-12-13 16:17:30,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-12-13 16:17:30,137 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:17:30,137 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 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 16:17:30,157 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:30,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:30,339 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:17:30,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:17:30,340 INFO L85 PathProgramCache]: Analyzing trace with hash -794308218, now seen corresponding path program 2 times [2022-12-13 16:17:30,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:17:30,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266082264] [2022-12-13 16:17:30,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:17:30,345 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 16:17:30,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:17:30,348 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:30,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:31,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 16:17:31,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:17:31,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 16:17:31,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:17:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-12-13 16:17:32,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:17:32,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:17:32,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266082264] [2022-12-13 16:17:32,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266082264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:17:32,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:17:32,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:17:32,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136102632] [2022-12-13 16:17:32,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:17:32,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:17:32,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:17:32,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:17:32,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:17:32,045 INFO L87 Difference]: Start difference. First operand 5575 states and 7302 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-12-13 16:17:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:17:32,769 INFO L93 Difference]: Finished difference Result 11179 states and 14633 transitions. [2022-12-13 16:17:32,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:17:32,770 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), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 228 [2022-12-13 16:17:32,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:17:32,780 INFO L225 Difference]: With dead ends: 11179 [2022-12-13 16:17:32,780 INFO L226 Difference]: Without dead ends: 5575 [2022-12-13 16:17:32,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 224 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 16:17:32,788 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 0 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:17:32,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1105 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:17:32,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5575 states. [2022-12-13 16:17:33,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5575 to 5575. [2022-12-13 16:17:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5575 states, 4403 states have (on average 1.248012718600954) internal successors, (5495), 4395 states have internal predecessors, (5495), 808 states have call successors, (808), 316 states have call predecessors, (808), 363 states have return successors, (975), 911 states have call predecessors, (975), 807 states have call successors, (975) [2022-12-13 16:17:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5575 states to 5575 states and 7278 transitions. [2022-12-13 16:17:33,495 INFO L78 Accepts]: Start accepts. Automaton has 5575 states and 7278 transitions. Word has length 228 [2022-12-13 16:17:33,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:17:33,495 INFO L495 AbstractCegarLoop]: Abstraction has 5575 states and 7278 transitions. [2022-12-13 16:17:33,495 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), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-12-13 16:17:33,495 INFO L276 IsEmpty]: Start isEmpty. Operand 5575 states and 7278 transitions. [2022-12-13 16:17:33,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-12-13 16:17:33,501 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:17:33,501 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 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] [2022-12-13 16:17:33,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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)] Ended with exit code 0 [2022-12-13 16:17:33,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:33,702 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:17:33,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:17:33,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1382682662, now seen corresponding path program 1 times [2022-12-13 16:17:33,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:17:33,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967529575] [2022-12-13 16:17:33,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:17:33,703 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 16:17:33,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:17:33,704 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:33,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/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 16:17:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:17:38,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-13 16:17:38,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:17:38,391 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 16:17:38,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 7 treesize of output 6 [2022-12-13 16:17:38,903 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 16:17:38,937 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2511 (Array (_ BitVec 64) (_ BitVec 8)))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2511))) is different from true [2022-12-13 16:17:38,960 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc66.base| (_ BitVec 64))) (and (exists ((v_ArrVal_2510 (_ BitVec 1))) (= (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc66.base| v_ArrVal_2510) |c_#valid|)) (= (select |c_old(#valid)| |ldv_init_zalloc_#t~malloc66.base|) (_ bv0 1)) (exists ((v_ArrVal_2511 (Array (_ BitVec 64) (_ BitVec 8)))) (= |c_#memory_int| (store |c_old(#memory_int)| |ldv_init_zalloc_#t~malloc66.base| v_ArrVal_2511))))) is different from true [2022-12-13 16:17:38,981 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 16:17:38,985 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 16:17:39,069 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 16:17:39,069 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 16:17:39,082 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 16:17:39,217 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 7 treesize of output 5 [2022-12-13 16:17:45,398 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 16:17:51,651 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 16:17:51,651 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 16:17:52,610 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 16:17:56,782 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 16:17:58,790 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 16:18:09,432 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-12-13 16:18:09,432 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 16:18:09,876 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 16:18:24,641 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-12-13 16:18:24,642 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 20 treesize of output 22 [2022-12-13 16:18:27,023 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 16:18:27,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 16:18:29,242 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 16:18:29,485 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 16:18:29,503 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 16:18:31,660 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 16:18:31,834 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 16:18:31,843 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 16:18:31,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:18:31,871 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 16:18:31,957 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 86 proven. 18 refuted. 9 times theorem prover too weak. 17 trivial. 101 not checked. [2022-12-13 16:18:31,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:18:31,997 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ BitVec 64)) (v_ArrVal_2522 (Array (_ BitVec 64) (_ BitVec 8)))) (= (_ bv0 64) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2522) |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))))))) is different from false [2022-12-13 16:18:32,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:18:32,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967529575] [2022-12-13 16:18:32,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967529575] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:18:32,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [964776020] [2022-12-13 16:18:32,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:18:32,100 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 16:18:32,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 16:18:32,101 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 16:18:32,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adbdd61d-2443-413f-ab56-781933f38dab/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-12-13 16:25:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:25:14,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 114 conjunts are in the unsatisfiable core [2022-12-13 16:25:14,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:25:14,999 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 16:25:17,139 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 16:25:18,306 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 16:25:18,312 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2870 (Array (_ BitVec 64) (_ BitVec 8)))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2870))) is different from true [2022-12-13 16:25:18,328 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc66.base| (_ BitVec 64))) (and (exists ((v_ArrVal_2510 (_ BitVec 1))) (= (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc66.base| v_ArrVal_2510) |c_#valid|)) (= (select |c_old(#valid)| |ldv_init_zalloc_#t~malloc66.base|) (_ bv0 1)) (exists ((v_ArrVal_2870 (Array (_ BitVec 64) (_ BitVec 8)))) (= (store |c_old(#memory_int)| |ldv_init_zalloc_#t~malloc66.base| v_ArrVal_2870) |c_#memory_int|)))) is different from true [2022-12-13 16:25:18,345 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 16:25:18,348 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 16:25:18,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:25:18,393 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 16:25:18,423 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 16:25:18,423 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 16:25:18,700 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 7 treesize of output 5 [2022-12-13 16:25:22,931 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 16:25:29,403 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 16:25:29,403 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-13 16:25:31,256 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 7 treesize of output 5 [2022-12-13 16:25:33,419 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 16:25:33,419 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 13 treesize of output 13 [2022-12-13 16:25:35,824 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_13| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_13|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-12-13 16:25:52,093 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_14| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_14|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-12-13 16:25:52,454 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 16:25:54,490 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_15| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_15|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-12-13 16:25:54,895 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 16:25:54,922 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 16:25:57,190 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_16| (_ 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_16|))) is different from true [2022-12-13 16:25:57,576 INFO L321 Elim1Store]: treesize reduction 58, result has 23.7 percent of original size [2022-12-13 16:25:57,576 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 63 treesize of output 75 [2022-12-13 16:25:57,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:25:57,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:25:57,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:25:57,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:25:57,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:25:57,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:25:57,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:25:57,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:25:57,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:25:57,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 45 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 89 [2022-12-13 16:25:58,432 INFO L321 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-12-13 16:25:58,432 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 83 treesize of output 93 [2022-12-13 16:25:58,479 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 16:26:01,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:26:01,284 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 160 treesize of output 132 [2022-12-13 16:26:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 86 proven. 27 refuted. 0 times theorem prover too weak. 7 trivial. 111 not checked. [2022-12-13 16:26:01,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:26:26,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [964776020] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:26:26,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:26:26,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 52] total 79 [2022-12-13 16:26:26,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820635202] [2022-12-13 16:26:26,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:26:26,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-12-13 16:26:26,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:26:26,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-12-13 16:26:26,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=4551, Unknown=26, NotChecked=1924, Total=6806 [2022-12-13 16:26:26,357 INFO L87 Difference]: Start difference. First operand 5575 states and 7278 transitions. Second operand has 79 states, 73 states have (on average 3.8219178082191783) internal successors, (279), 64 states have internal predecessors, (279), 31 states have call successors, (43), 17 states have call predecessors, (43), 28 states have return successors, (45), 34 states have call predecessors, (45), 31 states have call successors, (45) [2022-12-13 16:26:28,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:26:30,728 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 [0] [2022-12-13 16:26:32,774 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 [0] [2022-12-13 16:26:34,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:26:44,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:26:47,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:26:53,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:26:55,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:27:03,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:27:05,543 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 [0] [2022-12-13 16:27:07,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]