./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R --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 a63a35a997d4cef3a03c29c7166a2a1f9c94c58040c56bbf24b94b5923949bbd --- 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-38b53e6 [2022-11-25 15:38:20,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:38:20,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:38:20,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:38:20,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:38:20,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:38:20,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:38:20,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:38:20,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:38:20,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:38:20,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:38:20,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:38:20,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:38:20,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:38:20,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:38:20,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:38:20,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:38:20,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:38:20,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:38:20,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:38:20,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:38:20,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:38:20,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:38:20,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:38:20,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:38:20,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:38:20,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:38:20,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:38:20,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:38:20,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:38:20,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:38:20,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:38:20,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:38:20,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:38:20,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:38:20,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:38:20,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:38:20,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:38:20,572 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:38:20,573 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:38:20,574 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:38:20,575 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-25 15:38:20,598 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:38:20,598 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:38:20,599 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:38:20,599 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:38:20,599 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:38:20,600 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:38:20,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:38:20,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:38:20,601 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:38:20,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:38:20,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:38:20,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:38:20,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:38:20,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:38:20,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:38:20,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:38:20,603 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:38:20,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:38:20,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:38:20,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:38:20,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:38:20,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:38:20,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:38:20,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:38:20,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:38:20,605 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:38:20,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:38:20,606 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:38:20,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:38:20,606 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:38:20,607 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:38:20,607 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_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/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_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R 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 -> a63a35a997d4cef3a03c29c7166a2a1f9c94c58040c56bbf24b94b5923949bbd [2022-11-25 15:38:20,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:38:20,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:38:20,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:38:20,865 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:38:20,866 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:38:20,867 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i [2022-11-25 15:38:23,961 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:38:24,628 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:38:24,629 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i [2022-11-25 15:38:24,705 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/data/5f2ca6022/51d46704cc7d4df2a9d23e0a26f81152/FLAG767b2d35c [2022-11-25 15:38:24,724 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/data/5f2ca6022/51d46704cc7d4df2a9d23e0a26f81152 [2022-11-25 15:38:24,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:38:24,732 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:38:24,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:38:24,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:38:24,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:38:24,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:38:24" (1/1) ... [2022-11-25 15:38:24,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626752d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:24, skipping insertion in model container [2022-11-25 15:38:24,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:38:24" (1/1) ... [2022-11-25 15:38:24,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:38:24,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:38:26,229 WARN L623 FunctionHandler]: Unknown extern function kstrtoull [2022-11-25 15:38:26,366 WARN L623 FunctionHandler]: Unknown extern function _raw_spin_unlock_irqrestore [2022-11-25 15:38:26,524 WARN L623 FunctionHandler]: Unknown extern function __raw_spin_lock_init [2022-11-25 15:38:26,546 WARN L623 FunctionHandler]: Unknown extern function request_threaded_irq [2022-11-25 15:38:26,585 WARN L623 FunctionHandler]: Unknown extern function __napi_schedule [2022-11-25 15:38:26,639 WARN L623 FunctionHandler]: Unknown extern function netif_tx_wake_queue [2022-11-25 15:38:26,645 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-11-25 15:38:26,646 WARN L623 FunctionHandler]: Unknown extern function printk [2022-11-25 15:38:26,740 WARN L623 FunctionHandler]: Unknown extern function kfree_skb [2022-11-25 15:38:26,804 WARN L623 FunctionHandler]: Unknown extern function sk_free [2022-11-25 15:38:26,823 WARN L623 FunctionHandler]: Unknown extern function consume_skb [2022-11-25 15:38:26,823 WARN L623 FunctionHandler]: Unknown extern function kfree_skb [2022-11-25 15:38:26,829 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:26,836 WARN L623 FunctionHandler]: Unknown extern function ioread8 [2022-11-25 15:38:26,836 WARN L623 FunctionHandler]: Unknown extern function ioread8 [2022-11-25 15:38:26,840 WARN L623 FunctionHandler]: Unknown extern function __dynamic_netdev_dbg [2022-11-25 15:38:26,842 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:26,848 WARN L623 FunctionHandler]: Unknown extern function ioread8 [2022-11-25 15:38:26,849 WARN L623 FunctionHandler]: Unknown extern function ioread8 [2022-11-25 15:38:26,850 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:26,852 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:26,880 WARN L623 FunctionHandler]: Unknown extern function __dynamic_netdev_dbg [2022-11-25 15:38:26,890 WARN L623 FunctionHandler]: Unknown extern function __dynamic_netdev_dbg [2022-11-25 15:38:26,924 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-11-25 15:38:26,943 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-11-25 15:38:27,034 WARN L623 FunctionHandler]: Unknown extern function __dynamic_netdev_dbg [2022-11-25 15:38:27,041 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:27,042 WARN L623 FunctionHandler]: Unknown extern function alloc_can_err_skb [2022-11-25 15:38:27,043 WARN L623 FunctionHandler]: Unknown extern function netif_rx [2022-11-25 15:38:27,050 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:27,051 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:27,053 WARN L623 FunctionHandler]: Unknown extern function __dynamic_netdev_dbg [2022-11-25 15:38:27,054 WARN L623 FunctionHandler]: Unknown extern function skb_dequeue [2022-11-25 15:38:27,054 WARN L623 FunctionHandler]: Unknown extern function kfree_skb [2022-11-25 15:38:27,055 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:27,056 WARN L623 FunctionHandler]: Unknown extern function alloc_can_err_skb [2022-11-25 15:38:27,058 WARN L623 FunctionHandler]: Unknown extern function __dynamic_netdev_dbg [2022-11-25 15:38:27,060 WARN L623 FunctionHandler]: Unknown extern function __dynamic_netdev_dbg [2022-11-25 15:38:27,061 WARN L623 FunctionHandler]: Unknown extern function can_bus_off [2022-11-25 15:38:27,066 WARN L623 FunctionHandler]: Unknown extern function netif_rx [2022-11-25 15:38:27,072 WARN L623 FunctionHandler]: Unknown extern function complete [2022-11-25 15:38:27,073 WARN L623 FunctionHandler]: Unknown extern function complete [2022-11-25 15:38:27,073 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:27,079 WARN L623 FunctionHandler]: Unknown extern function netdev_warn [2022-11-25 15:38:27,086 WARN L623 FunctionHandler]: Unknown extern function __dynamic_netdev_dbg [2022-11-25 15:38:27,093 WARN L623 FunctionHandler]: Unknown extern function skb_queue_tail [2022-11-25 15:38:27,099 WARN L623 FunctionHandler]: Unknown extern function skb_dequeue [2022-11-25 15:38:27,099 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:27,100 WARN L623 FunctionHandler]: Unknown extern function kfree_skb [2022-11-25 15:38:27,101 WARN L623 FunctionHandler]: Unknown extern function netif_receive_skb [2022-11-25 15:38:27,107 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 15:38:27,114 WARN L623 FunctionHandler]: Unknown extern function ioread8 [2022-11-25 15:38:27,121 WARN L623 FunctionHandler]: Unknown extern function alloc_can_skb [2022-11-25 15:38:27,122 WARN L623 FunctionHandler]: Unknown extern function kfree_skb [2022-11-25 15:38:27,123 WARN L623 FunctionHandler]: Unknown extern function netif_receive_skb [2022-11-25 15:38:27,131 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:27,137 WARN L623 FunctionHandler]: Unknown extern function ioread8 [2022-11-25 15:38:27,137 WARN L623 FunctionHandler]: Unknown extern function ioread8 [2022-11-25 15:38:27,138 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:27,143 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:27,144 WARN L623 FunctionHandler]: Unknown extern function ioread8 [2022-11-25 15:38:27,145 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:27,145 WARN L623 FunctionHandler]: Unknown extern function ioread8 [2022-11-25 15:38:27,151 WARN L623 FunctionHandler]: Unknown extern function msleep [2022-11-25 15:38:27,152 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:27,162 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:27,163 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:27,164 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:27,164 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:27,165 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:27,165 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:27,166 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:27,167 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:27,174 WARN L623 FunctionHandler]: Unknown extern function open_candev [2022-11-25 15:38:27,175 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:27,176 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:27,176 WARN L623 FunctionHandler]: Unknown extern function close_candev [2022-11-25 15:38:27,183 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:27,184 WARN L623 FunctionHandler]: Unknown extern function skb_queue_purge [2022-11-25 15:38:27,186 WARN L623 FunctionHandler]: Unknown extern function close_candev [2022-11-25 15:38:27,199 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:27,210 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:27,227 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:27,233 WARN L623 FunctionHandler]: Unknown extern function netdev_info [2022-11-25 15:38:27,241 WARN L623 FunctionHandler]: Unknown extern function netdev_info [2022-11-25 15:38:27,260 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-11-25 15:38:27,260 WARN L623 FunctionHandler]: Unknown extern function alloc_candev [2022-11-25 15:38:27,261 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 15:38:27,262 WARN L623 FunctionHandler]: Unknown extern function netif_napi_add [2022-11-25 15:38:27,263 WARN L623 FunctionHandler]: Unknown extern function __raw_spin_lock_init [2022-11-25 15:38:27,264 WARN L623 FunctionHandler]: Unknown extern function platform_get_irq [2022-11-25 15:38:27,265 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 15:38:27,266 WARN L623 FunctionHandler]: Unknown extern function platform_get_resource [2022-11-25 15:38:27,266 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 15:38:27,267 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 15:38:27,268 WARN L623 FunctionHandler]: Unknown extern function platform_get_resource [2022-11-25 15:38:27,268 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 15:38:27,273 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 15:38:27,274 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:27,275 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 15:38:27,276 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 15:38:27,276 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 15:38:27,277 WARN L623 FunctionHandler]: Unknown extern function _dev_info [2022-11-25 15:38:27,277 WARN L623 FunctionHandler]: Unknown extern function napi_disable [2022-11-25 15:38:27,277 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:27,278 WARN L623 FunctionHandler]: Unknown extern function free_candev [2022-11-25 15:38:27,283 WARN L623 FunctionHandler]: Unknown extern function napi_disable [2022-11-25 15:38:27,284 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:27,285 WARN L623 FunctionHandler]: Unknown extern function free_candev [2022-11-25 15:38:27,542 WARN L623 FunctionHandler]: Unknown extern function can_change_mtu [2022-11-25 15:38:27,570 WARN L623 FunctionHandler]: Unknown extern function __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-25 15:38:27,570 WARN L623 FunctionHandler]: Unknown extern function __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-25 15:38:27,571 WARN L623 FunctionHandler]: Unknown extern function __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-25 15:38:27,571 WARN L623 FunctionHandler]: Unknown extern function __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-25 15:38:27,571 WARN L623 FunctionHandler]: Unknown extern function __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-25 15:38:27,572 WARN L623 FunctionHandler]: Unknown extern function __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-25 15:38:27,572 WARN L623 FunctionHandler]: Unknown extern function __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-25 15:38:27,573 WARN L623 FunctionHandler]: Unknown extern function __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-25 15:38:27,573 WARN L623 FunctionHandler]: Unknown extern function wait_for_completion_timeout [2022-11-25 15:38:27,573 WARN L623 FunctionHandler]: Unknown extern function wait_for_completion_timeout [2022-11-25 15:38:27,575 WARN L623 FunctionHandler]: Unknown extern function register_candev [2022-11-25 15:38:27,575 WARN L623 FunctionHandler]: Unknown extern function free_irq [2022-11-25 15:38:27,576 WARN L623 FunctionHandler]: Unknown extern function unregister_netdev [2022-11-25 15:38:27,576 WARN L623 FunctionHandler]: Unknown extern function free_irq [2022-11-25 15:38:27,577 WARN L623 FunctionHandler]: Unknown extern function __platform_driver_register [2022-11-25 15:38:27,577 WARN L623 FunctionHandler]: Unknown extern function platform_driver_unregister [2022-11-25 15:38:27,579 WARN L623 FunctionHandler]: Unknown extern function ldv_pre_probe [2022-11-25 15:38:28,147 WARN L623 FunctionHandler]: Unknown extern function ldv_after_alloc [2022-11-25 15:38:28,427 WARN L623 FunctionHandler]: Unknown extern function ldv_assert [2022-11-25 15:38:29,160 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397439,397452] [2022-11-25 15:38:29,165 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397584,397597] [2022-11-25 15:38:29,166 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397730,397743] [2022-11-25 15:38:29,166 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397895,397908] [2022-11-25 15:38:29,166 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398053,398066] [2022-11-25 15:38:29,172 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398211,398224] [2022-11-25 15:38:29,173 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398369,398382] [2022-11-25 15:38:29,173 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398529,398542] [2022-11-25 15:38:29,173 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398688,398701] [2022-11-25 15:38:29,174 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398827,398840] [2022-11-25 15:38:29,174 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398969,398982] [2022-11-25 15:38:29,175 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399118,399131] [2022-11-25 15:38:29,176 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399257,399270] [2022-11-25 15:38:29,176 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399412,399425] [2022-11-25 15:38:29,177 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399572,399585] [2022-11-25 15:38:29,177 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399723,399736] [2022-11-25 15:38:29,178 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399874,399887] [2022-11-25 15:38:29,178 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400026,400039] [2022-11-25 15:38:29,178 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400175,400188] [2022-11-25 15:38:29,179 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400323,400336] [2022-11-25 15:38:29,179 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400480,400493] [2022-11-25 15:38:29,180 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400629,400642] [2022-11-25 15:38:29,181 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400785,400798] [2022-11-25 15:38:29,182 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400938,400951] [2022-11-25 15:38:29,185 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401084,401097] [2022-11-25 15:38:29,186 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401227,401240] [2022-11-25 15:38:29,187 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401379,401392] [2022-11-25 15:38:29,187 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401525,401538] [2022-11-25 15:38:29,188 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401670,401683] [2022-11-25 15:38:29,189 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401824,401837] [2022-11-25 15:38:29,190 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401975,401988] [2022-11-25 15:38:29,190 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402130,402143] [2022-11-25 15:38:29,191 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402282,402295] [2022-11-25 15:38:29,197 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402437,402450] [2022-11-25 15:38:29,198 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402601,402614] [2022-11-25 15:38:29,198 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402757,402770] [2022-11-25 15:38:29,199 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402921,402934] [2022-11-25 15:38:29,199 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403063,403076] [2022-11-25 15:38:29,200 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403221,403234] [2022-11-25 15:38:29,200 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403388,403401] [2022-11-25 15:38:29,201 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403547,403560] [2022-11-25 15:38:29,201 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403706,403719] [2022-11-25 15:38:29,202 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403855,403868] [2022-11-25 15:38:29,202 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404002,404015] [2022-11-25 15:38:29,203 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404141,404154] [2022-11-25 15:38:29,203 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404304,404317] [2022-11-25 15:38:29,204 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404470,404483] [2022-11-25 15:38:29,206 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404634,404647] [2022-11-25 15:38:29,206 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404799,404812] [2022-11-25 15:38:29,207 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404964,404977] [2022-11-25 15:38:29,207 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405130,405143] [2022-11-25 15:38:29,207 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405295,405308] [2022-11-25 15:38:29,208 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405462,405475] [2022-11-25 15:38:29,208 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405622,405635] [2022-11-25 15:38:29,209 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405784,405797] [2022-11-25 15:38:29,209 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405943,405956] [2022-11-25 15:38:29,210 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406089,406102] [2022-11-25 15:38:29,210 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406232,406245] [2022-11-25 15:38:29,210 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406376,406389] [2022-11-25 15:38:29,211 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406519,406532] [2022-11-25 15:38:29,212 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406663,406676] [2022-11-25 15:38:29,213 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406804,406817] [2022-11-25 15:38:29,214 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406942,406955] [2022-11-25 15:38:29,214 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407100,407113] [2022-11-25 15:38:29,215 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407259,407272] [2022-11-25 15:38:29,215 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407415,407428] [2022-11-25 15:38:29,215 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407564,407577] [2022-11-25 15:38:29,216 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407716,407729] [2022-11-25 15:38:29,216 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407867,407880] [2022-11-25 15:38:29,216 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408016,408029] [2022-11-25 15:38:29,217 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408168,408181] [2022-11-25 15:38:29,218 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408316,408329] [2022-11-25 15:38:29,218 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408469,408482] [2022-11-25 15:38:29,219 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408620,408633] [2022-11-25 15:38:29,219 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408770,408783] [2022-11-25 15:38:29,219 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408917,408930] [2022-11-25 15:38:29,220 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409068,409081] [2022-11-25 15:38:29,221 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409219,409232] [2022-11-25 15:38:29,221 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409367,409380] [2022-11-25 15:38:29,222 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409533,409546] [2022-11-25 15:38:29,222 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409702,409715] [2022-11-25 15:38:29,223 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409869,409882] [2022-11-25 15:38:29,223 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410037,410050] [2022-11-25 15:38:29,223 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410187,410200] [2022-11-25 15:38:29,224 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410334,410347] [2022-11-25 15:38:29,224 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410495,410508] [2022-11-25 15:38:29,225 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410665,410678] [2022-11-25 15:38:29,225 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410827,410840] [2022-11-25 15:38:29,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:38:29,266 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:38:29,382 WARN L623 FunctionHandler]: Unknown extern function kstrtoull [2022-11-25 15:38:29,383 WARN L623 FunctionHandler]: Unknown extern function _raw_spin_unlock_irqrestore [2022-11-25 15:38:29,388 WARN L623 FunctionHandler]: Unknown extern function __raw_spin_lock_init [2022-11-25 15:38:29,389 WARN L623 FunctionHandler]: Unknown extern function request_threaded_irq [2022-11-25 15:38:29,390 WARN L623 FunctionHandler]: Unknown extern function __napi_schedule [2022-11-25 15:38:29,392 WARN L623 FunctionHandler]: Unknown extern function netif_tx_wake_queue [2022-11-25 15:38:29,392 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-11-25 15:38:29,393 WARN L623 FunctionHandler]: Unknown extern function printk [2022-11-25 15:38:29,395 WARN L623 FunctionHandler]: Unknown extern function kfree_skb [2022-11-25 15:38:29,397 WARN L623 FunctionHandler]: Unknown extern function sk_free [2022-11-25 15:38:29,414 WARN L623 FunctionHandler]: Unknown extern function consume_skb [2022-11-25 15:38:29,414 WARN L623 FunctionHandler]: Unknown extern function kfree_skb [2022-11-25 15:38:29,415 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:29,416 WARN L623 FunctionHandler]: Unknown extern function ioread8 [2022-11-25 15:38:29,467 WARN L623 FunctionHandler]: Unknown extern function ioread8 [2022-11-25 15:38:29,468 WARN L623 FunctionHandler]: Unknown extern function __dynamic_netdev_dbg [2022-11-25 15:38:29,469 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:29,470 WARN L623 FunctionHandler]: Unknown extern function ioread8 [2022-11-25 15:38:29,470 WARN L623 FunctionHandler]: Unknown extern function ioread8 [2022-11-25 15:38:29,470 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:29,471 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:29,477 WARN L623 FunctionHandler]: Unknown extern function __dynamic_netdev_dbg [2022-11-25 15:38:29,480 WARN L623 FunctionHandler]: Unknown extern function __dynamic_netdev_dbg [2022-11-25 15:38:29,483 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-11-25 15:38:29,485 WARN L623 FunctionHandler]: Unknown extern function warn_slowpath_null [2022-11-25 15:38:29,496 WARN L623 FunctionHandler]: Unknown extern function __dynamic_netdev_dbg [2022-11-25 15:38:29,497 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:29,498 WARN L623 FunctionHandler]: Unknown extern function alloc_can_err_skb [2022-11-25 15:38:29,498 WARN L623 FunctionHandler]: Unknown extern function netif_rx [2022-11-25 15:38:29,499 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:29,500 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:29,501 WARN L623 FunctionHandler]: Unknown extern function __dynamic_netdev_dbg [2022-11-25 15:38:29,502 WARN L623 FunctionHandler]: Unknown extern function skb_dequeue [2022-11-25 15:38:29,502 WARN L623 FunctionHandler]: Unknown extern function kfree_skb [2022-11-25 15:38:29,503 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:29,503 WARN L623 FunctionHandler]: Unknown extern function alloc_can_err_skb [2022-11-25 15:38:29,504 WARN L623 FunctionHandler]: Unknown extern function __dynamic_netdev_dbg [2022-11-25 15:38:29,505 WARN L623 FunctionHandler]: Unknown extern function __dynamic_netdev_dbg [2022-11-25 15:38:29,506 WARN L623 FunctionHandler]: Unknown extern function can_bus_off [2022-11-25 15:38:29,509 WARN L623 FunctionHandler]: Unknown extern function netif_rx [2022-11-25 15:38:29,511 WARN L623 FunctionHandler]: Unknown extern function complete [2022-11-25 15:38:29,511 WARN L623 FunctionHandler]: Unknown extern function complete [2022-11-25 15:38:29,511 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:29,512 WARN L623 FunctionHandler]: Unknown extern function netdev_warn [2022-11-25 15:38:29,513 WARN L623 FunctionHandler]: Unknown extern function __dynamic_netdev_dbg [2022-11-25 15:38:29,514 WARN L623 FunctionHandler]: Unknown extern function skb_queue_tail [2022-11-25 15:38:29,515 WARN L623 FunctionHandler]: Unknown extern function skb_dequeue [2022-11-25 15:38:29,515 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:29,516 WARN L623 FunctionHandler]: Unknown extern function kfree_skb [2022-11-25 15:38:29,519 WARN L623 FunctionHandler]: Unknown extern function netif_receive_skb [2022-11-25 15:38:29,521 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 15:38:29,522 WARN L623 FunctionHandler]: Unknown extern function ioread8 [2022-11-25 15:38:29,523 WARN L623 FunctionHandler]: Unknown extern function alloc_can_skb [2022-11-25 15:38:29,524 WARN L623 FunctionHandler]: Unknown extern function kfree_skb [2022-11-25 15:38:29,524 WARN L623 FunctionHandler]: Unknown extern function netif_receive_skb [2022-11-25 15:38:29,547 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:29,549 WARN L623 FunctionHandler]: Unknown extern function ioread8 [2022-11-25 15:38:29,550 WARN L623 FunctionHandler]: Unknown extern function ioread8 [2022-11-25 15:38:29,550 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:29,551 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:29,551 WARN L623 FunctionHandler]: Unknown extern function ioread8 [2022-11-25 15:38:29,552 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:29,552 WARN L623 FunctionHandler]: Unknown extern function ioread8 [2022-11-25 15:38:29,552 WARN L623 FunctionHandler]: Unknown extern function msleep [2022-11-25 15:38:29,553 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:29,553 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:29,554 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:29,554 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:29,555 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:29,555 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:29,556 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:29,556 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:29,556 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:29,557 WARN L623 FunctionHandler]: Unknown extern function open_candev [2022-11-25 15:38:29,557 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:29,558 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:29,558 WARN L623 FunctionHandler]: Unknown extern function close_candev [2022-11-25 15:38:29,559 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:29,559 WARN L623 FunctionHandler]: Unknown extern function skb_queue_purge [2022-11-25 15:38:29,559 WARN L623 FunctionHandler]: Unknown extern function close_candev [2022-11-25 15:38:29,560 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:29,562 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:29,565 WARN L623 FunctionHandler]: Unknown extern function netdev_err [2022-11-25 15:38:29,566 WARN L623 FunctionHandler]: Unknown extern function netdev_info [2022-11-25 15:38:29,567 WARN L623 FunctionHandler]: Unknown extern function netdev_info [2022-11-25 15:38:29,570 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-11-25 15:38:29,571 WARN L623 FunctionHandler]: Unknown extern function alloc_candev [2022-11-25 15:38:29,571 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 15:38:29,572 WARN L623 FunctionHandler]: Unknown extern function netif_napi_add [2022-11-25 15:38:29,572 WARN L623 FunctionHandler]: Unknown extern function __raw_spin_lock_init [2022-11-25 15:38:29,574 WARN L623 FunctionHandler]: Unknown extern function platform_get_irq [2022-11-25 15:38:29,574 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 15:38:29,574 WARN L623 FunctionHandler]: Unknown extern function platform_get_resource [2022-11-25 15:38:29,575 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 15:38:29,575 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 15:38:29,576 WARN L623 FunctionHandler]: Unknown extern function platform_get_resource [2022-11-25 15:38:29,576 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 15:38:29,577 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 15:38:29,577 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:29,578 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 15:38:29,578 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 15:38:29,578 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 15:38:29,579 WARN L623 FunctionHandler]: Unknown extern function _dev_info [2022-11-25 15:38:29,579 WARN L623 FunctionHandler]: Unknown extern function napi_disable [2022-11-25 15:38:29,579 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:29,580 WARN L623 FunctionHandler]: Unknown extern function free_candev [2022-11-25 15:38:29,581 WARN L623 FunctionHandler]: Unknown extern function napi_disable [2022-11-25 15:38:29,581 WARN L623 FunctionHandler]: Unknown extern function iowrite8 [2022-11-25 15:38:29,581 WARN L623 FunctionHandler]: Unknown extern function free_candev [2022-11-25 15:38:29,586 WARN L623 FunctionHandler]: Unknown extern function can_change_mtu [2022-11-25 15:38:29,625 WARN L623 FunctionHandler]: Unknown extern function __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-25 15:38:29,626 WARN L623 FunctionHandler]: Unknown extern function __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-25 15:38:29,626 WARN L623 FunctionHandler]: Unknown extern function __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-25 15:38:29,626 WARN L623 FunctionHandler]: Unknown extern function __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-25 15:38:29,627 WARN L623 FunctionHandler]: Unknown extern function __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-25 15:38:29,627 WARN L623 FunctionHandler]: Unknown extern function __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-25 15:38:29,627 WARN L623 FunctionHandler]: Unknown extern function __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-25 15:38:29,627 WARN L623 FunctionHandler]: Unknown extern function __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-25 15:38:29,628 WARN L623 FunctionHandler]: Unknown extern function wait_for_completion_timeout [2022-11-25 15:38:29,628 WARN L623 FunctionHandler]: Unknown extern function wait_for_completion_timeout [2022-11-25 15:38:29,629 WARN L623 FunctionHandler]: Unknown extern function register_candev [2022-11-25 15:38:29,629 WARN L623 FunctionHandler]: Unknown extern function free_irq [2022-11-25 15:38:29,630 WARN L623 FunctionHandler]: Unknown extern function unregister_netdev [2022-11-25 15:38:29,630 WARN L623 FunctionHandler]: Unknown extern function free_irq [2022-11-25 15:38:29,630 WARN L623 FunctionHandler]: Unknown extern function __platform_driver_register [2022-11-25 15:38:29,631 WARN L623 FunctionHandler]: Unknown extern function platform_driver_unregister [2022-11-25 15:38:29,631 WARN L623 FunctionHandler]: Unknown extern function ldv_pre_probe [2022-11-25 15:38:29,644 WARN L623 FunctionHandler]: Unknown extern function ldv_after_alloc [2022-11-25 15:38:29,652 WARN L623 FunctionHandler]: Unknown extern function ldv_assert [2022-11-25 15:38:29,676 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397439,397452] [2022-11-25 15:38:29,676 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397584,397597] [2022-11-25 15:38:29,677 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397730,397743] [2022-11-25 15:38:29,677 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[397895,397908] [2022-11-25 15:38:29,678 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398053,398066] [2022-11-25 15:38:29,678 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398211,398224] [2022-11-25 15:38:29,678 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398369,398382] [2022-11-25 15:38:29,679 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398529,398542] [2022-11-25 15:38:29,679 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398688,398701] [2022-11-25 15:38:29,679 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398827,398840] [2022-11-25 15:38:29,680 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[398969,398982] [2022-11-25 15:38:29,680 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399118,399131] [2022-11-25 15:38:29,680 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399257,399270] [2022-11-25 15:38:29,681 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399412,399425] [2022-11-25 15:38:29,681 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399572,399585] [2022-11-25 15:38:29,681 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399723,399736] [2022-11-25 15:38:29,682 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[399874,399887] [2022-11-25 15:38:29,682 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400026,400039] [2022-11-25 15:38:29,682 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400175,400188] [2022-11-25 15:38:29,683 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400323,400336] [2022-11-25 15:38:29,683 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400480,400493] [2022-11-25 15:38:29,684 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400629,400642] [2022-11-25 15:38:29,684 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400785,400798] [2022-11-25 15:38:29,684 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[400938,400951] [2022-11-25 15:38:29,685 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401084,401097] [2022-11-25 15:38:29,685 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401227,401240] [2022-11-25 15:38:29,685 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401379,401392] [2022-11-25 15:38:29,686 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401525,401538] [2022-11-25 15:38:29,686 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401670,401683] [2022-11-25 15:38:29,686 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401824,401837] [2022-11-25 15:38:29,687 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[401975,401988] [2022-11-25 15:38:29,687 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402130,402143] [2022-11-25 15:38:29,687 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402282,402295] [2022-11-25 15:38:29,688 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402437,402450] [2022-11-25 15:38:29,688 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402601,402614] [2022-11-25 15:38:29,688 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402757,402770] [2022-11-25 15:38:29,689 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[402921,402934] [2022-11-25 15:38:29,689 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403063,403076] [2022-11-25 15:38:29,690 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403221,403234] [2022-11-25 15:38:29,690 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403388,403401] [2022-11-25 15:38:29,690 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403547,403560] [2022-11-25 15:38:29,691 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403706,403719] [2022-11-25 15:38:29,691 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[403855,403868] [2022-11-25 15:38:29,691 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404002,404015] [2022-11-25 15:38:29,692 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404141,404154] [2022-11-25 15:38:29,692 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404304,404317] [2022-11-25 15:38:29,692 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404470,404483] [2022-11-25 15:38:29,693 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404634,404647] [2022-11-25 15:38:29,693 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404799,404812] [2022-11-25 15:38:29,693 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[404964,404977] [2022-11-25 15:38:29,694 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405130,405143] [2022-11-25 15:38:29,694 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405295,405308] [2022-11-25 15:38:29,695 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405462,405475] [2022-11-25 15:38:29,695 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405622,405635] [2022-11-25 15:38:29,695 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405784,405797] [2022-11-25 15:38:29,696 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[405943,405956] [2022-11-25 15:38:29,696 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406089,406102] [2022-11-25 15:38:29,696 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406232,406245] [2022-11-25 15:38:29,762 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406376,406389] [2022-11-25 15:38:29,762 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406519,406532] [2022-11-25 15:38:29,762 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406663,406676] [2022-11-25 15:38:29,763 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406804,406817] [2022-11-25 15:38:29,763 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[406942,406955] [2022-11-25 15:38:29,763 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407100,407113] [2022-11-25 15:38:29,764 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407259,407272] [2022-11-25 15:38:29,764 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407415,407428] [2022-11-25 15:38:29,764 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407564,407577] [2022-11-25 15:38:29,765 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407716,407729] [2022-11-25 15:38:29,765 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[407867,407880] [2022-11-25 15:38:29,766 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408016,408029] [2022-11-25 15:38:29,766 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408168,408181] [2022-11-25 15:38:29,766 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408316,408329] [2022-11-25 15:38:29,767 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408469,408482] [2022-11-25 15:38:29,767 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408620,408633] [2022-11-25 15:38:29,767 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408770,408783] [2022-11-25 15:38:29,768 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[408917,408930] [2022-11-25 15:38:29,768 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409068,409081] [2022-11-25 15:38:29,768 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409219,409232] [2022-11-25 15:38:29,769 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409367,409380] [2022-11-25 15:38:29,769 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409533,409546] [2022-11-25 15:38:29,769 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409702,409715] [2022-11-25 15:38:29,770 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[409869,409882] [2022-11-25 15:38:29,770 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410037,410050] [2022-11-25 15:38:29,770 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410187,410200] [2022-11-25 15:38:29,771 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410334,410347] [2022-11-25 15:38:29,772 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410495,410508] [2022-11-25 15:38:29,772 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410665,410678] [2022-11-25 15:38:29,773 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_590ffbec-84f4-4899-b556-c3881bb2151c/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i[410827,410840] [2022-11-25 15:38:29,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:38:30,025 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:38:30,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:30 WrapperNode [2022-11-25 15:38:30,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:38:30,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:38:30,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:38:30,027 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:38:30,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:30" (1/1) ... [2022-11-25 15:38:30,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:30" (1/1) ... [2022-11-25 15:38:30,274 INFO L138 Inliner]: procedures = 641, calls = 2556, calls flagged for inlining = 300, calls inlined = 195, statements flattened = 3270 [2022-11-25 15:38:30,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:38:30,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:38:30,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:38:30,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:38:30,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:30" (1/1) ... [2022-11-25 15:38:30,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:30" (1/1) ... [2022-11-25 15:38:30,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:30" (1/1) ... [2022-11-25 15:38:30,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:30" (1/1) ... [2022-11-25 15:38:30,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:30" (1/1) ... [2022-11-25 15:38:30,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:30" (1/1) ... [2022-11-25 15:38:30,517 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:30" (1/1) ... [2022-11-25 15:38:30,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:30" (1/1) ... [2022-11-25 15:38:30,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:38:30,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:38:30,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:38:30,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:38:30,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:30" (1/1) ... [2022-11-25 15:38:30,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:38:30,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:38:30,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:38:30,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:38:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-11-25 15:38:30,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-11-25 15:38:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_open [2022-11-25 15:38:30,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_open [2022-11-25 15:38:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-25 15:38:30,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-25 15:38:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-11-25 15:38:30,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-11-25 15:38:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-11-25 15:38:30,645 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-11-25 15:38:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-11-25 15:38:30,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-11-25 15:38:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_toio [2022-11-25 15:38:30,645 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_toio [2022-11-25 15:38:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-11-25 15:38:30,645 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-11-25 15:38:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite8 [2022-11-25 15:38:30,646 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite8 [2022-11-25 15:38:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-11-25 15:38:30,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-11-25 15:38:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-11-25 15:38:30,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-11-25 15:38:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-25 15:38:30,646 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-25 15:38:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_reset_module [2022-11-25 15:38:30,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_reset_module [2022-11-25 15:38:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_set_bus_state [2022-11-25 15:38:30,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_set_bus_state [2022-11-25 15:38:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-11-25 15:38:30,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-11-25 15:38:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-11-25 15:38:30,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-11-25 15:38:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-11-25 15:38:30,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-11-25 15:38:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-11-25 15:38:30,648 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-11-25 15:38:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:38:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_set_buserror [2022-11-25 15:38:30,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_set_buserror [2022-11-25 15:38:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-11-25 15:38:30,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-11-25 15:38:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-25 15:38:30,649 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-25 15:38:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-25 15:38:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_remove [2022-11-25 15:38:30,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_remove [2022-11-25 15:38:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-11-25 15:38:30,649 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-11-25 15:38:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-25 15:38:30,650 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-11-25 15:38:30,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-11-25 15:38:30,650 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-11-25 15:38:30,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-11-25 15:38:30,650 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-11-25 15:38:30,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-11-25 15:38:30,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 15:38:30,650 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-11-25 15:38:30,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-11-25 15:38:30,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-25 15:38:30,651 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-25 15:38:30,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-11-25 15:38:30,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-11-25 15:38:30,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-11-25 15:38:30,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-11-25 15:38:30,652 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_txok [2022-11-25 15:38:30,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_txok [2022-11-25 15:38:30,652 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_set_termination [2022-11-25 15:38:30,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_set_termination [2022-11-25 15:38:30,652 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_send_msg [2022-11-25 15:38:30,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_send_msg [2022-11-25 15:38:30,653 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_set_page [2022-11-25 15:38:30,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_set_page [2022-11-25 15:38:30,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-11-25 15:38:30,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-11-25 15:38:30,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-11-25 15:38:30,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-11-25 15:38:30,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 15:38:30,654 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_send_inquiry [2022-11-25 15:38:30,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_send_inquiry [2022-11-25 15:38:30,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:38:30,654 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-25 15:38:30,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-25 15:38:30,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 15:38:30,654 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-25 15:38:30,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-25 15:38:30,655 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-11-25 15:38:30,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-11-25 15:38:30,655 INFO L130 BoogieDeclarations]: Found specification of procedure ioread8 [2022-11-25 15:38:30,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread8 [2022-11-25 15:38:30,655 INFO L130 BoogieDeclarations]: Found specification of procedure napi_disable [2022-11-25 15:38:30,655 INFO L138 BoogieDeclarations]: Found implementation of procedure napi_disable [2022-11-25 15:38:30,655 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-25 15:38:30,656 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-25 15:38:30,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-11-25 15:38:30,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-11-25 15:38:30,656 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2022-11-25 15:38:30,656 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2022-11-25 15:38:30,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:38:30,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:38:30,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-25 15:38:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-25 15:38:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-25 15:38:30,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-25 15:38:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_fromio [2022-11-25 15:38:30,657 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_fromio [2022-11-25 15:38:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-11-25 15:38:30,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-11-25 15:38:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2022-11-25 15:38:30,658 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion_timeout [2022-11-25 15:38:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_stop [2022-11-25 15:38:30,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_stop [2022-11-25 15:38:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-25 15:38:30,658 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-25 15:38:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2022-11-25 15:38:30,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2022-11-25 15:38:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-25 15:38:30,659 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-25 15:38:30,659 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_127 [2022-11-25 15:38:30,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_127 [2022-11-25 15:38:30,659 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-11-25 15:38:30,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-11-25 15:38:30,660 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-11-25 15:38:30,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-11-25 15:38:30,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:38:30,660 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-11-25 15:38:30,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-11-25 15:38:30,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 15:38:30,661 INFO L130 BoogieDeclarations]: Found specification of procedure ioremap [2022-11-25 15:38:30,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ioremap [2022-11-25 15:38:30,661 INFO L130 BoogieDeclarations]: Found specification of procedure ican3_probe [2022-11-25 15:38:30,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ican3_probe [2022-11-25 15:38:30,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 15:38:30,661 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_skb [2022-11-25 15:38:30,662 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_skb [2022-11-25 15:38:30,662 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_sched_completion__wait_without_init [2022-11-25 15:38:30,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_sched_completion__wait_without_init [2022-11-25 15:38:30,662 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-11-25 15:38:30,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-11-25 15:38:30,662 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-25 15:38:30,662 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-25 15:38:30,662 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_ican3_dev [2022-11-25 15:38:30,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_ican3_dev [2022-11-25 15:38:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-11-25 15:38:30,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-11-25 15:38:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2022-11-25 15:38:30,663 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2022-11-25 15:38:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-11-25 15:38:30,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-11-25 15:38:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-11-25 15:38:30,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-11-25 15:38:30,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-11-25 15:38:30,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-11-25 15:38:30,664 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-25 15:38:30,664 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-25 15:38:30,664 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-11-25 15:38:30,664 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-11-25 15:38:30,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-11-25 15:38:30,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-11-25 15:38:30,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:38:30,665 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-11-25 15:38:30,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-11-25 15:38:30,665 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-25 15:38:30,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-25 15:38:30,665 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-11-25 15:38:30,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-11-25 15:38:30,666 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-11-25 15:38:30,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-11-25 15:38:30,666 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-11-25 15:38:30,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-11-25 15:38:30,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:38:30,666 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-11-25 15:38:30,666 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-11-25 15:38:31,325 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:38:31,329 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:38:31,493 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-25 15:38:34,858 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:38:34,876 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:38:34,877 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:38:34,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:38:34 BoogieIcfgContainer [2022-11-25 15:38:34,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:38:34,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:38:34,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:38:34,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:38:34,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:38:24" (1/3) ... [2022-11-25 15:38:34,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70564afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:38:34, skipping insertion in model container [2022-11-25 15:38:34,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:38:30" (2/3) ... [2022-11-25 15:38:34,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70564afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:38:34, skipping insertion in model container [2022-11-25 15:38:34,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:38:34" (3/3) ... [2022-11-25 15:38:34,890 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--can--janz-ican3.ko.cil.i [2022-11-25 15:38:34,911 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:38:34,911 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-11-25 15:38:34,994 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:38:35,000 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;@6544448b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:38:35,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-11-25 15:38:35,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 1237 states, 822 states have (on average 1.2530413625304135) internal successors, (1030), 869 states have internal predecessors, (1030), 308 states have call successors, (308), 78 states have call predecessors, (308), 77 states have return successors, (302), 302 states have call predecessors, (302), 302 states have call successors, (302) [2022-11-25 15:38:35,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-25 15:38:35,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:38:35,023 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-11-25 15:38:35,024 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:38:35,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:35,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1690379916, now seen corresponding path program 1 times [2022-11-25 15:38:35,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:38:35,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861605539] [2022-11-25 15:38:35,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:35,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:38:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:35,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:38:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:35,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:38:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:35,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:38:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:36,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:38:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:36,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:38:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:36,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:38:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:36,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:38:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:36,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:38:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:36,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:38:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:36,087 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:38:36,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:38:36,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861605539] [2022-11-25 15:38:36,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861605539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:36,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:36,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:38:36,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739027768] [2022-11-25 15:38:36,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:36,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:38:36,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:38:36,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:38:36,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:38:36,131 INFO L87 Difference]: Start difference. First operand has 1237 states, 822 states have (on average 1.2530413625304135) internal successors, (1030), 869 states have internal predecessors, (1030), 308 states have call successors, (308), 78 states have call predecessors, (308), 77 states have return successors, (302), 302 states have call predecessors, (302), 302 states have call successors, (302) Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 15:38:39,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:38:47,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:38:47,487 INFO L93 Difference]: Finished difference Result 3261 states and 4525 transitions. [2022-11-25 15:38:47,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 15:38:47,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2022-11-25 15:38:47,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:38:47,530 INFO L225 Difference]: With dead ends: 3261 [2022-11-25 15:38:47,530 INFO L226 Difference]: Without dead ends: 2022 [2022-11-25 15:38:47,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-25 15:38:47,551 INFO L413 NwaCegarLoop]: 578 mSDtfsCounter, 2860 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 4543 mSolverCounterSat, 1674 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2937 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 6218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1674 IncrementalHoareTripleChecker+Valid, 4543 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-11-25 15:38:47,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2937 Valid, 1789 Invalid, 6218 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1674 Valid, 4543 Invalid, 1 Unknown, 0 Unchecked, 10.7s Time] [2022-11-25 15:38:47,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2022-11-25 15:38:47,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1810. [2022-11-25 15:38:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1218 states have (on average 1.2044334975369457) internal successors, (1467), 1270 states have internal predecessors, (1467), 443 states have call successors, (443), 122 states have call predecessors, (443), 120 states have return successors, (465), 435 states have call predecessors, (465), 441 states have call successors, (465) [2022-11-25 15:38:47,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2375 transitions. [2022-11-25 15:38:47,874 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2375 transitions. Word has length 64 [2022-11-25 15:38:47,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:38:47,878 INFO L495 AbstractCegarLoop]: Abstraction has 1810 states and 2375 transitions. [2022-11-25 15:38:47,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 15:38:47,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2375 transitions. [2022-11-25 15:38:47,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-25 15:38:47,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:38:47,890 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-11-25 15:38:47,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:38:47,890 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:38:47,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:47,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1395616413, now seen corresponding path program 1 times [2022-11-25 15:38:47,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:38:47,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465831524] [2022-11-25 15:38:47,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:47,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:38:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:48,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:38:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:48,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:38:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:48,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:38:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:48,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:38:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:48,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:38:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:48,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:38:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:48,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:38:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:48,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:38:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:48,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:38:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:48,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:38:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:38:48,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:38:48,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465831524] [2022-11-25 15:38:48,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465831524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:48,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:48,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:38:48,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114464822] [2022-11-25 15:38:48,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:48,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:38:48,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:38:48,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:38:48,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:38:48,448 INFO L87 Difference]: Start difference. First operand 1810 states and 2375 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 15:38:50,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:38:52,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:38:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:38:57,860 INFO L93 Difference]: Finished difference Result 1810 states and 2375 transitions. [2022-11-25 15:38:57,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:38:57,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2022-11-25 15:38:57,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:38:57,874 INFO L225 Difference]: With dead ends: 1810 [2022-11-25 15:38:57,875 INFO L226 Difference]: Without dead ends: 1808 [2022-11-25 15:38:57,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:38:57,880 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 2540 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 2568 mSolverCounterSat, 1374 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2638 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 3943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 2568 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:38:57,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2638 Valid, 1307 Invalid, 3943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 2568 Invalid, 1 Unknown, 0 Unchecked, 9.1s Time] [2022-11-25 15:38:57,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-11-25 15:38:58,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2022-11-25 15:38:58,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1217 states have (on average 1.2037797863599013) internal successors, (1465), 1268 states have internal predecessors, (1465), 443 states have call successors, (443), 122 states have call predecessors, (443), 120 states have return successors, (465), 435 states have call predecessors, (465), 441 states have call successors, (465) [2022-11-25 15:38:58,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2373 transitions. [2022-11-25 15:38:58,046 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2373 transitions. Word has length 70 [2022-11-25 15:38:58,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:38:58,049 INFO L495 AbstractCegarLoop]: Abstraction has 1808 states and 2373 transitions. [2022-11-25 15:38:58,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 15:38:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2373 transitions. [2022-11-25 15:38:58,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-25 15:38:58,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:38:58,056 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-11-25 15:38:58,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:38:58,056 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:38:58,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:58,059 INFO L85 PathProgramCache]: Analyzing trace with hash 736691208, now seen corresponding path program 1 times [2022-11-25 15:38:58,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:38:58,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978630878] [2022-11-25 15:38:58,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:58,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:38:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:58,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:38:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:58,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:38:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:58,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:38:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:58,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:38:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:58,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:38:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:58,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:38:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:58,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:38:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:58,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:38:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:58,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:38:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:58,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:38:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:58,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:38:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:58,496 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:38:58,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:38:58,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978630878] [2022-11-25 15:38:58,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978630878] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:58,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:58,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:38:58,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067288448] [2022-11-25 15:38:58,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:58,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:38:58,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:38:58,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:38:58,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:38:58,499 INFO L87 Difference]: Start difference. First operand 1808 states and 2373 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-25 15:39:00,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:39:06,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:39:06,337 INFO L93 Difference]: Finished difference Result 1808 states and 2373 transitions. [2022-11-25 15:39:06,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:39:06,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2022-11-25 15:39:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:39:06,347 INFO L225 Difference]: With dead ends: 1808 [2022-11-25 15:39:06,347 INFO L226 Difference]: Without dead ends: 1806 [2022-11-25 15:39:06,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:39:06,349 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 2534 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 2565 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2631 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 3939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 2565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:39:06,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2631 Valid, 1307 Invalid, 3939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 2565 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-11-25 15:39:06,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2022-11-25 15:39:06,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1806. [2022-11-25 15:39:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1216 states have (on average 1.203125) internal successors, (1463), 1266 states have internal predecessors, (1463), 443 states have call successors, (443), 122 states have call predecessors, (443), 120 states have return successors, (465), 435 states have call predecessors, (465), 441 states have call successors, (465) [2022-11-25 15:39:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2371 transitions. [2022-11-25 15:39:06,471 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2371 transitions. Word has length 76 [2022-11-25 15:39:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:39:06,472 INFO L495 AbstractCegarLoop]: Abstraction has 1806 states and 2371 transitions. [2022-11-25 15:39:06,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-25 15:39:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2371 transitions. [2022-11-25 15:39:06,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-25 15:39:06,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:39:06,475 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-11-25 15:39:06,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:39:06,475 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:39:06,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:06,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2078127421, now seen corresponding path program 1 times [2022-11-25 15:39:06,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:06,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556992452] [2022-11-25 15:39:06,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:06,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:06,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:39:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:06,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:39:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:06,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:39:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:06,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:39:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:06,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:39:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:06,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:39:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:06,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:39:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:06,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:39:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:06,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:39:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:06,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:39:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:06,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:39:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:06,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:39:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:39:06,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:06,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556992452] [2022-11-25 15:39:06,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556992452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:06,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:06,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:39:06,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962217703] [2022-11-25 15:39:06,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:06,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:39:06,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:06,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:39:06,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:39:06,910 INFO L87 Difference]: Start difference. First operand 1806 states and 2371 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-25 15:39:09,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:39:15,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:39:15,928 INFO L93 Difference]: Finished difference Result 2050 states and 2648 transitions. [2022-11-25 15:39:15,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:39:15,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2022-11-25 15:39:15,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:39:15,939 INFO L225 Difference]: With dead ends: 2050 [2022-11-25 15:39:15,939 INFO L226 Difference]: Without dead ends: 2048 [2022-11-25 15:39:15,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:39:15,941 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 2487 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 3547 mSolverCounterSat, 1351 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2584 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 4899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1351 IncrementalHoareTripleChecker+Valid, 3547 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-11-25 15:39:15,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2584 Valid, 1310 Invalid, 4899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1351 Valid, 3547 Invalid, 1 Unknown, 0 Unchecked, 8.7s Time] [2022-11-25 15:39:15,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2022-11-25 15:39:16,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2042. [2022-11-25 15:39:16,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 1366 states have (on average 1.1939970717423134) internal successors, (1631), 1416 states have internal predecessors, (1631), 494 states have call successors, (494), 157 states have call predecessors, (494), 156 states have return successors, (518), 486 states have call predecessors, (518), 492 states have call successors, (518) [2022-11-25 15:39:16,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2643 transitions. [2022-11-25 15:39:16,075 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2643 transitions. Word has length 82 [2022-11-25 15:39:16,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:39:16,076 INFO L495 AbstractCegarLoop]: Abstraction has 2042 states and 2643 transitions. [2022-11-25 15:39:16,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-25 15:39:16,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2643 transitions. [2022-11-25 15:39:16,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-25 15:39:16,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:39:16,078 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-11-25 15:39:16,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:39:16,078 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:39:16,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:16,079 INFO L85 PathProgramCache]: Analyzing trace with hash -299599558, now seen corresponding path program 1 times [2022-11-25 15:39:16,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:16,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919807461] [2022-11-25 15:39:16,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:16,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:16,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:39:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:16,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:39:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:16,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:39:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:16,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:39:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:16,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:39:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:16,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:39:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:16,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:39:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:16,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 15:39:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:16,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:39:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:16,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:39:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:16,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:39:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:16,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:39:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:16,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-25 15:39:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:16,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:39:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:16,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 15:39:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-11-25 15:39:16,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:16,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919807461] [2022-11-25 15:39:16,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919807461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:16,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:16,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 15:39:16,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983852134] [2022-11-25 15:39:16,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:16,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:39:16,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:16,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:39:16,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:39:16,470 INFO L87 Difference]: Start difference. First operand 2042 states and 2643 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-25 15:39:20,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:39:27,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:39:27,330 INFO L93 Difference]: Finished difference Result 4141 states and 5446 transitions. [2022-11-25 15:39:27,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:39:27,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2022-11-25 15:39:27,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:39:27,344 INFO L225 Difference]: With dead ends: 4141 [2022-11-25 15:39:27,345 INFO L226 Difference]: Without dead ends: 2118 [2022-11-25 15:39:27,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:39:27,353 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 2963 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 3067 mSolverCounterSat, 1861 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3066 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 4929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1861 IncrementalHoareTripleChecker+Valid, 3067 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:39:27,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3066 Valid, 1246 Invalid, 4929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1861 Valid, 3067 Invalid, 1 Unknown, 0 Unchecked, 10.4s Time] [2022-11-25 15:39:27,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2022-11-25 15:39:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 2042. [2022-11-25 15:39:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 1365 states have (on average 1.1912087912087912) internal successors, (1626), 1415 states have internal predecessors, (1626), 494 states have call successors, (494), 157 states have call predecessors, (494), 158 states have return successors, (541), 487 states have call predecessors, (541), 492 states have call successors, (541) [2022-11-25 15:39:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2661 transitions. [2022-11-25 15:39:27,536 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2661 transitions. Word has length 93 [2022-11-25 15:39:27,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:39:27,537 INFO L495 AbstractCegarLoop]: Abstraction has 2042 states and 2661 transitions. [2022-11-25 15:39:27,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-25 15:39:27,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2661 transitions. [2022-11-25 15:39:27,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-25 15:39:27,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:39:27,539 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-11-25 15:39:27,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:39:27,540 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:39:27,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:27,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1226029994, now seen corresponding path program 1 times [2022-11-25 15:39:27,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:27,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670712676] [2022-11-25 15:39:27,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:27,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:27,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:39:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:27,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:39:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:27,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:39:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:27,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:39:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:27,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:39:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:27,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:39:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:27,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:39:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:27,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:39:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:27,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:39:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:27,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:39:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:27,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:39:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:27,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:39:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:27,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:39:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:27,942 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:39:27,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:27,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670712676] [2022-11-25 15:39:27,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670712676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:27,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:27,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:39:27,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934170863] [2022-11-25 15:39:27,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:27,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:39:27,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:27,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:39:27,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:39:27,946 INFO L87 Difference]: Start difference. First operand 2042 states and 2661 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-25 15:39:30,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:39:35,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:39:35,572 INFO L93 Difference]: Finished difference Result 2042 states and 2661 transitions. [2022-11-25 15:39:35,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:39:35,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2022-11-25 15:39:35,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:39:35,583 INFO L225 Difference]: With dead ends: 2042 [2022-11-25 15:39:35,583 INFO L226 Difference]: Without dead ends: 2040 [2022-11-25 15:39:35,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:39:35,586 INFO L413 NwaCegarLoop]: 458 mSDtfsCounter, 2517 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 1374 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2612 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 3930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:39:35,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2612 Valid, 1288 Invalid, 3930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 2555 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2022-11-25 15:39:35,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2022-11-25 15:39:35,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 2040. [2022-11-25 15:39:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2040 states, 1364 states have (on average 1.1906158357771262) internal successors, (1624), 1413 states have internal predecessors, (1624), 494 states have call successors, (494), 157 states have call predecessors, (494), 158 states have return successors, (541), 487 states have call predecessors, (541), 492 states have call successors, (541) [2022-11-25 15:39:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 2659 transitions. [2022-11-25 15:39:35,766 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 2659 transitions. Word has length 88 [2022-11-25 15:39:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:39:35,767 INFO L495 AbstractCegarLoop]: Abstraction has 2040 states and 2659 transitions. [2022-11-25 15:39:35,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-25 15:39:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2659 transitions. [2022-11-25 15:39:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-25 15:39:35,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:39:35,769 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-11-25 15:39:35,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:39:35,769 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:39:35,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:35,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2039882921, now seen corresponding path program 1 times [2022-11-25 15:39:35,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:35,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054480327] [2022-11-25 15:39:35,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:35,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:36,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:39:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:36,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:39:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:36,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:39:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:36,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:39:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:36,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:39:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:36,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:39:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:36,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:39:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:36,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 15:39:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:36,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:39:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:36,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:39:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:36,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:39:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:36,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:39:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:36,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-25 15:39:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:36,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:39:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:36,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 15:39:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:36,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-25 15:39:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-25 15:39:36,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:36,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054480327] [2022-11-25 15:39:36,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054480327] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:39:36,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160120890] [2022-11-25 15:39:36,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:36,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:39:36,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:39:36,279 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:39:36,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 15:39:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:36,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 1518 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 15:39:36,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:39:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-11-25 15:39:37,031 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:39:37,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160120890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:37,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:39:37,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-25 15:39:37,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545911529] [2022-11-25 15:39:37,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:37,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:39:37,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:37,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:39:37,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:39:37,034 INFO L87 Difference]: Start difference. First operand 2040 states and 2659 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-25 15:39:37,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:39:37,335 INFO L93 Difference]: Finished difference Result 4055 states and 5283 transitions. [2022-11-25 15:39:37,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:39:37,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 99 [2022-11-25 15:39:37,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:39:37,345 INFO L225 Difference]: With dead ends: 4055 [2022-11-25 15:39:37,346 INFO L226 Difference]: Without dead ends: 2034 [2022-11-25 15:39:37,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:39:37,353 INFO L413 NwaCegarLoop]: 1567 mSDtfsCounter, 1547 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:39:37,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1547 Valid, 1567 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:39:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2022-11-25 15:39:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2034. [2022-11-25 15:39:37,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 1359 states have (on average 1.188373804267844) internal successors, (1615), 1407 states have internal predecessors, (1615), 494 states have call successors, (494), 157 states have call predecessors, (494), 158 states have return successors, (541), 487 states have call predecessors, (541), 492 states have call successors, (541) [2022-11-25 15:39:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2650 transitions. [2022-11-25 15:39:37,548 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2650 transitions. Word has length 99 [2022-11-25 15:39:37,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:39:37,548 INFO L495 AbstractCegarLoop]: Abstraction has 2034 states and 2650 transitions. [2022-11-25 15:39:37,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-25 15:39:37,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2650 transitions. [2022-11-25 15:39:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-25 15:39:37,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:39:37,550 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:37,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 15:39:37,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-25 15:39:37,759 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:39:37,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:37,760 INFO L85 PathProgramCache]: Analyzing trace with hash 310310147, now seen corresponding path program 1 times [2022-11-25 15:39:37,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:37,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491703174] [2022-11-25 15:39:37,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:37,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:37,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:39:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:38,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:39:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:38,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:39:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:38,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:39:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:38,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:39:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:38,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:39:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:38,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:39:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:38,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:39:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:38,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:39:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:38,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:39:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:38,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:39:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:38,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:39:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:38,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:39:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:38,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:39:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:39:38,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:38,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491703174] [2022-11-25 15:39:38,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491703174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:38,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:38,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:39:38,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005631340] [2022-11-25 15:39:38,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:38,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:39:38,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:38,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:39:38,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:39:38,131 INFO L87 Difference]: Start difference. First operand 2034 states and 2650 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 15:39:40,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:39:42,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:39:47,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:39:47,474 INFO L93 Difference]: Finished difference Result 2034 states and 2650 transitions. [2022-11-25 15:39:47,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:39:47,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 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 94 [2022-11-25 15:39:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:39:47,489 INFO L225 Difference]: With dead ends: 2034 [2022-11-25 15:39:47,489 INFO L226 Difference]: Without dead ends: 2032 [2022-11-25 15:39:47,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:39:47,491 INFO L413 NwaCegarLoop]: 453 mSDtfsCounter, 2506 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 1374 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2600 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 3925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:39:47,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2600 Valid, 1269 Invalid, 3925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 2550 Invalid, 1 Unknown, 0 Unchecked, 9.0s Time] [2022-11-25 15:39:47,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2022-11-25 15:39:47,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 2032. [2022-11-25 15:39:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2032 states, 1358 states have (on average 1.1877761413843888) internal successors, (1613), 1405 states have internal predecessors, (1613), 494 states have call successors, (494), 157 states have call predecessors, (494), 158 states have return successors, (541), 487 states have call predecessors, (541), 492 states have call successors, (541) [2022-11-25 15:39:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 2648 transitions. [2022-11-25 15:39:47,709 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 2648 transitions. Word has length 94 [2022-11-25 15:39:47,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:39:47,709 INFO L495 AbstractCegarLoop]: Abstraction has 2032 states and 2648 transitions. [2022-11-25 15:39:47,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 15:39:47,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 2648 transitions. [2022-11-25 15:39:47,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-25 15:39:47,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:39:47,715 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:47,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:39:47,716 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:39:47,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:47,716 INFO L85 PathProgramCache]: Analyzing trace with hash -556420155, now seen corresponding path program 1 times [2022-11-25 15:39:47,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:47,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989704931] [2022-11-25 15:39:47,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:47,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:47,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:39:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:48,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:39:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:48,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:39:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:48,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:39:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:48,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:39:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:48,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:39:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:48,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:39:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:48,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:39:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:48,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:39:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:48,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:39:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:48,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:39:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:48,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:39:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:48,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:39:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:48,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:39:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:48,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:39:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:39:48,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:48,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989704931] [2022-11-25 15:39:48,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989704931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:48,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:48,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:39:48,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824750309] [2022-11-25 15:39:48,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:48,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:39:48,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:48,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:39:48,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:39:48,180 INFO L87 Difference]: Start difference. First operand 2032 states and 2648 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-25 15:39:50,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:39:57,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:39:57,430 INFO L93 Difference]: Finished difference Result 2038 states and 2651 transitions. [2022-11-25 15:39:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:39:57,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2022-11-25 15:39:57,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:39:57,438 INFO L225 Difference]: With dead ends: 2038 [2022-11-25 15:39:57,438 INFO L226 Difference]: Without dead ends: 2036 [2022-11-25 15:39:57,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:39:57,440 INFO L413 NwaCegarLoop]: 454 mSDtfsCounter, 2459 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 3533 mSolverCounterSat, 1351 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2553 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 4885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1351 IncrementalHoareTripleChecker+Valid, 3533 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-11-25 15:39:57,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2553 Valid, 1272 Invalid, 4885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1351 Valid, 3533 Invalid, 1 Unknown, 0 Unchecked, 8.9s Time] [2022-11-25 15:39:57,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2022-11-25 15:39:57,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 2030. [2022-11-25 15:39:57,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2030 states, 1357 states have (on average 1.187177597641857) internal successors, (1611), 1403 states have internal predecessors, (1611), 494 states have call successors, (494), 157 states have call predecessors, (494), 158 states have return successors, (541), 487 states have call predecessors, (541), 492 states have call successors, (541) [2022-11-25 15:39:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 2646 transitions. [2022-11-25 15:39:57,636 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 2646 transitions. Word has length 100 [2022-11-25 15:39:57,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:39:57,637 INFO L495 AbstractCegarLoop]: Abstraction has 2030 states and 2646 transitions. [2022-11-25 15:39:57,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-25 15:39:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2646 transitions. [2022-11-25 15:39:57,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-25 15:39:57,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:39:57,639 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-11-25 15:39:57,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:39:57,640 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:39:57,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:57,640 INFO L85 PathProgramCache]: Analyzing trace with hash 332103133, now seen corresponding path program 1 times [2022-11-25 15:39:57,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:57,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901785808] [2022-11-25 15:39:57,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:57,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:57,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:39:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:57,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:39:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:57,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:39:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:57,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:39:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:57,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:39:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:57,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:39:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:57,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:39:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:57,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:39:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:57,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:39:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:57,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:39:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:57,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:39:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:57,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:39:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:58,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:39:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:58,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:39:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:58,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:39:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:58,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:39:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:58,041 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:39:58,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:58,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901785808] [2022-11-25 15:39:58,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901785808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:58,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:58,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:39:58,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528223793] [2022-11-25 15:39:58,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:58,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:39:58,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:58,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:39:58,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:39:58,044 INFO L87 Difference]: Start difference. First operand 2030 states and 2646 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-25 15:40:00,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:40:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:06,636 INFO L93 Difference]: Finished difference Result 2036 states and 2649 transitions. [2022-11-25 15:40:06,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:40:06,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2022-11-25 15:40:06,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:06,650 INFO L225 Difference]: With dead ends: 2036 [2022-11-25 15:40:06,650 INFO L226 Difference]: Without dead ends: 2034 [2022-11-25 15:40:06,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:40:06,652 INFO L413 NwaCegarLoop]: 454 mSDtfsCounter, 2457 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 3525 mSolverCounterSat, 1351 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2550 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 4877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1351 IncrementalHoareTripleChecker+Valid, 3525 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:06,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2550 Valid, 1272 Invalid, 4877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1351 Valid, 3525 Invalid, 1 Unknown, 0 Unchecked, 8.3s Time] [2022-11-25 15:40:06,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2022-11-25 15:40:06,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2028. [2022-11-25 15:40:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2028 states, 1356 states have (on average 1.1865781710914454) internal successors, (1609), 1401 states have internal predecessors, (1609), 494 states have call successors, (494), 157 states have call predecessors, (494), 158 states have return successors, (541), 487 states have call predecessors, (541), 492 states have call successors, (541) [2022-11-25 15:40:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 2644 transitions. [2022-11-25 15:40:06,941 INFO L78 Accepts]: Start accepts. Automaton has 2028 states and 2644 transitions. Word has length 106 [2022-11-25 15:40:06,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:06,942 INFO L495 AbstractCegarLoop]: Abstraction has 2028 states and 2644 transitions. [2022-11-25 15:40:06,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-25 15:40:06,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2644 transitions. [2022-11-25 15:40:06,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-25 15:40:06,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:06,944 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:06,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:40:06,945 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:40:06,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:06,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1323668416, now seen corresponding path program 1 times [2022-11-25 15:40:06,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:06,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589523631] [2022-11-25 15:40:06,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:06,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:07,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:40:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:07,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:40:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:07,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:40:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:07,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:40:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:07,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:40:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:07,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:40:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:07,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:40:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:07,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:40:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:07,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:40:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:07,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:40:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:07,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:40:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:07,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:40:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:07,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:40:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:07,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:40:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:07,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:40:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:07,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:40:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:07,330 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:40:07,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:07,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589523631] [2022-11-25 15:40:07,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589523631] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:07,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:07,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:40:07,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144127837] [2022-11-25 15:40:07,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:07,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:40:07,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:07,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:40:07,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:40:07,334 INFO L87 Difference]: Start difference. First operand 2028 states and 2644 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-25 15:40:09,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:40:14,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:14,262 INFO L93 Difference]: Finished difference Result 2028 states and 2644 transitions. [2022-11-25 15:40:14,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:40:14,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2022-11-25 15:40:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:14,271 INFO L225 Difference]: With dead ends: 2028 [2022-11-25 15:40:14,271 INFO L226 Difference]: Without dead ends: 2026 [2022-11-25 15:40:14,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:40:14,273 INFO L413 NwaCegarLoop]: 453 mSDtfsCounter, 2486 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 2539 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2578 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 3913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 2539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:14,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2578 Valid, 1269 Invalid, 3913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 2539 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-11-25 15:40:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2022-11-25 15:40:14,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2026. [2022-11-25 15:40:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2026 states, 1355 states have (on average 1.1859778597785977) internal successors, (1607), 1399 states have internal predecessors, (1607), 494 states have call successors, (494), 157 states have call predecessors, (494), 158 states have return successors, (541), 487 states have call predecessors, (541), 492 states have call successors, (541) [2022-11-25 15:40:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2642 transitions. [2022-11-25 15:40:14,509 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2642 transitions. Word has length 108 [2022-11-25 15:40:14,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:14,514 INFO L495 AbstractCegarLoop]: Abstraction has 2026 states and 2642 transitions. [2022-11-25 15:40:14,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-25 15:40:14,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2642 transitions. [2022-11-25 15:40:14,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-25 15:40:14,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:14,517 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:14,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:40:14,517 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:40:14,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:14,518 INFO L85 PathProgramCache]: Analyzing trace with hash -745515035, now seen corresponding path program 1 times [2022-11-25 15:40:14,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:14,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726822825] [2022-11-25 15:40:14,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:14,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:14,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:40:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:14,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:40:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:14,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:40:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:14,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:40:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:14,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:40:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:14,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:40:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:14,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:40:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:14,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:40:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:14,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:40:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:14,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:40:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:14,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:40:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:14,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:40:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:14,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:40:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:14,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:40:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:14,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:40:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:14,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:40:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:14,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 15:40:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:40:14,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:14,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726822825] [2022-11-25 15:40:14,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726822825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:14,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:14,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:40:14,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531578307] [2022-11-25 15:40:14,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:14,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:40:14,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:14,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:40:14,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:40:14,969 INFO L87 Difference]: Start difference. First operand 2026 states and 2642 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-25 15:40:18,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:40:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:23,018 INFO L93 Difference]: Finished difference Result 2026 states and 2642 transitions. [2022-11-25 15:40:23,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:40:23,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 114 [2022-11-25 15:40:23,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:23,024 INFO L225 Difference]: With dead ends: 2026 [2022-11-25 15:40:23,024 INFO L226 Difference]: Without dead ends: 2024 [2022-11-25 15:40:23,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:40:23,026 INFO L413 NwaCegarLoop]: 453 mSDtfsCounter, 2482 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 1374 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2573 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 3909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:23,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2573 Valid, 1269 Invalid, 3909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 2534 Invalid, 1 Unknown, 0 Unchecked, 7.7s Time] [2022-11-25 15:40:23,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2022-11-25 15:40:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 2024. [2022-11-25 15:40:23,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 1354 states have (on average 1.1853766617429837) internal successors, (1605), 1397 states have internal predecessors, (1605), 494 states have call successors, (494), 157 states have call predecessors, (494), 158 states have return successors, (541), 487 states have call predecessors, (541), 492 states have call successors, (541) [2022-11-25 15:40:23,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2640 transitions. [2022-11-25 15:40:23,309 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2640 transitions. Word has length 114 [2022-11-25 15:40:23,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:23,310 INFO L495 AbstractCegarLoop]: Abstraction has 2024 states and 2640 transitions. [2022-11-25 15:40:23,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-25 15:40:23,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2640 transitions. [2022-11-25 15:40:23,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-25 15:40:23,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:23,313 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 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] [2022-11-25 15:40:23,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 15:40:23,313 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:40:23,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:23,314 INFO L85 PathProgramCache]: Analyzing trace with hash 88133661, now seen corresponding path program 1 times [2022-11-25 15:40:23,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:23,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340769571] [2022-11-25 15:40:23,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:23,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:40:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:40:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:40:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:40:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:40:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:40:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:40:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:40:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:40:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:40:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:40:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:40:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:40:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:40:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 15:40:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 15:40:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:40:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:40:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:40:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-25 15:40:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-25 15:40:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:23,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-25 15:40:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-11-25 15:40:24,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:24,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340769571] [2022-11-25 15:40:24,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340769571] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:24,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:24,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 15:40:24,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360122615] [2022-11-25 15:40:24,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:24,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:40:24,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:24,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:40:24,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:40:24,003 INFO L87 Difference]: Start difference. First operand 2024 states and 2640 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-25 15:40:27,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:40:39,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:39,638 INFO L93 Difference]: Finished difference Result 2973 states and 4077 transitions. [2022-11-25 15:40:39,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 15:40:39,639 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 139 [2022-11-25 15:40:39,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:39,652 INFO L225 Difference]: With dead ends: 2973 [2022-11-25 15:40:39,653 INFO L226 Difference]: Without dead ends: 2971 [2022-11-25 15:40:39,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2022-11-25 15:40:39,655 INFO L413 NwaCegarLoop]: 794 mSDtfsCounter, 3668 mSDsluCounter, 2765 mSDsCounter, 0 mSdLazyCounter, 8495 mSolverCounterSat, 2704 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3735 SdHoareTripleChecker+Valid, 3559 SdHoareTripleChecker+Invalid, 11200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2704 IncrementalHoareTripleChecker+Valid, 8495 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:39,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3735 Valid, 3559 Invalid, 11200 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2704 Valid, 8495 Invalid, 1 Unknown, 0 Unchecked, 14.8s Time] [2022-11-25 15:40:39,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2022-11-25 15:40:39,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2607. [2022-11-25 15:40:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2607 states, 1750 states have (on average 1.184) internal successors, (2072), 1811 states have internal predecessors, (2072), 628 states have call successors, (628), 215 states have call predecessors, (628), 211 states have return successors, (778), 602 states have call predecessors, (778), 626 states have call successors, (778) [2022-11-25 15:40:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 3478 transitions. [2022-11-25 15:40:40,007 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 3478 transitions. Word has length 139 [2022-11-25 15:40:40,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:40,008 INFO L495 AbstractCegarLoop]: Abstraction has 2607 states and 3478 transitions. [2022-11-25 15:40:40,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-25 15:40:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 3478 transitions. [2022-11-25 15:40:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-25 15:40:40,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:40,010 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:40,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 15:40:40,011 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:40:40,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:40,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2035379020, now seen corresponding path program 1 times [2022-11-25 15:40:40,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:40,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974707023] [2022-11-25 15:40:40,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:40,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:40,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:40:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:40,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:40:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:40,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:40:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:40,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:40:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:40,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:40:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:40,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:40:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:40,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:40:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:40,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:40:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:40,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:40:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:40,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:40:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:40,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:40:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:40,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:40:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:40,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:40:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:40,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:40:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:40,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:40:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:40,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:40:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:40,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 15:40:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:40,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 15:40:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:40,479 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:40:40,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:40,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974707023] [2022-11-25 15:40:40,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974707023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:40,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:40,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:40:40,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829456822] [2022-11-25 15:40:40,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:40,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:40:40,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:40,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:40:40,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:40:40,482 INFO L87 Difference]: Start difference. First operand 2607 states and 3478 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-25 15:40:42,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:40:43,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:40:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:47,860 INFO L93 Difference]: Finished difference Result 2607 states and 3478 transitions. [2022-11-25 15:40:47,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:40:47,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2022-11-25 15:40:47,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:47,873 INFO L225 Difference]: With dead ends: 2607 [2022-11-25 15:40:47,873 INFO L226 Difference]: Without dead ends: 2605 [2022-11-25 15:40:47,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:40:47,875 INFO L413 NwaCegarLoop]: 453 mSDtfsCounter, 2476 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2566 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 3905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:47,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2566 Valid, 1269 Invalid, 3905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-11-25 15:40:47,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2022-11-25 15:40:48,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 2605. [2022-11-25 15:40:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2605 states, 1749 states have (on average 1.183533447684391) internal successors, (2070), 1809 states have internal predecessors, (2070), 628 states have call successors, (628), 215 states have call predecessors, (628), 211 states have return successors, (778), 602 states have call predecessors, (778), 626 states have call successors, (778) [2022-11-25 15:40:48,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 3476 transitions. [2022-11-25 15:40:48,209 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 3476 transitions. Word has length 120 [2022-11-25 15:40:48,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:48,210 INFO L495 AbstractCegarLoop]: Abstraction has 2605 states and 3476 transitions. [2022-11-25 15:40:48,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-25 15:40:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 3476 transitions. [2022-11-25 15:40:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-11-25 15:40:48,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:48,212 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-11-25 15:40:48,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 15:40:48,213 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:40:48,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:48,213 INFO L85 PathProgramCache]: Analyzing trace with hash 295968949, now seen corresponding path program 1 times [2022-11-25 15:40:48,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:48,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139593716] [2022-11-25 15:40:48,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:48,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:48,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:40:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:48,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:40:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:48,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:40:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:48,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:40:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:48,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:40:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:48,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:40:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:48,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:40:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:48,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:40:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:48,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:40:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:48,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:40:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:48,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:40:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:48,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:40:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:48,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:40:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:48,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:40:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:48,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:40:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:48,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:40:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:48,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 15:40:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:48,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 15:40:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:48,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 15:40:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:40:48,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:48,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139593716] [2022-11-25 15:40:48,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139593716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:48,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:48,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:40:48,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268429520] [2022-11-25 15:40:48,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:48,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:40:48,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:48,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:40:48,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:40:48,680 INFO L87 Difference]: Start difference. First operand 2605 states and 3476 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-25 15:40:51,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:40:56,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:40:56,083 INFO L93 Difference]: Finished difference Result 2605 states and 3476 transitions. [2022-11-25 15:40:56,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:40:56,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2022-11-25 15:40:56,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:40:56,095 INFO L225 Difference]: With dead ends: 2605 [2022-11-25 15:40:56,095 INFO L226 Difference]: Without dead ends: 2603 [2022-11-25 15:40:56,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:40:56,098 INFO L413 NwaCegarLoop]: 453 mSDtfsCounter, 2470 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 2527 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2559 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 3901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 2527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-11-25 15:40:56,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2559 Valid, 1269 Invalid, 3901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 2527 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-11-25 15:40:56,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2022-11-25 15:40:56,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 2603. [2022-11-25 15:40:56,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2603 states, 1748 states have (on average 1.1830663615560641) internal successors, (2068), 1807 states have internal predecessors, (2068), 628 states have call successors, (628), 215 states have call predecessors, (628), 211 states have return successors, (778), 602 states have call predecessors, (778), 626 states have call successors, (778) [2022-11-25 15:40:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2603 states and 3474 transitions. [2022-11-25 15:40:56,485 INFO L78 Accepts]: Start accepts. Automaton has 2603 states and 3474 transitions. Word has length 126 [2022-11-25 15:40:56,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:40:56,485 INFO L495 AbstractCegarLoop]: Abstraction has 2603 states and 3474 transitions. [2022-11-25 15:40:56,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-25 15:40:56,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2603 states and 3474 transitions. [2022-11-25 15:40:56,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-25 15:40:56,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:40:56,489 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-11-25 15:40:56,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 15:40:56,489 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:40:56,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:56,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1676902186, now seen corresponding path program 1 times [2022-11-25 15:40:56,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:40:56,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199131545] [2022-11-25 15:40:56,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:40:56,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:40:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:40:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:40:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:40:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:40:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:40:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:40:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:40:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:40:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:40:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:40:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:40:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:40:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:40:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:40:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:40:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:40:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 15:40:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 15:40:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 15:40:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 15:40:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:40:56,934 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:40:56,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:40:56,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199131545] [2022-11-25 15:40:56,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199131545] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:40:56,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:40:56,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:40:56,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000012103] [2022-11-25 15:40:56,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:40:56,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:40:56,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:40:56,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:40:56,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:40:56,937 INFO L87 Difference]: Start difference. First operand 2603 states and 3474 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-25 15:40:58,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:41:04,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:41:04,751 INFO L93 Difference]: Finished difference Result 2603 states and 3474 transitions. [2022-11-25 15:41:04,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:41:04,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2022-11-25 15:41:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:41:04,762 INFO L225 Difference]: With dead ends: 2603 [2022-11-25 15:41:04,762 INFO L226 Difference]: Without dead ends: 2601 [2022-11-25 15:41:04,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:41:04,764 INFO L413 NwaCegarLoop]: 453 mSDtfsCounter, 2464 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 2523 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2552 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 3897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 2523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:41:04,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2552 Valid, 1269 Invalid, 3897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 2523 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-11-25 15:41:04,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2022-11-25 15:41:05,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 2601. [2022-11-25 15:41:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2601 states, 1747 states have (on average 1.18259874069834) internal successors, (2066), 1805 states have internal predecessors, (2066), 628 states have call successors, (628), 215 states have call predecessors, (628), 211 states have return successors, (778), 602 states have call predecessors, (778), 626 states have call successors, (778) [2022-11-25 15:41:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2601 states and 3472 transitions. [2022-11-25 15:41:05,050 INFO L78 Accepts]: Start accepts. Automaton has 2601 states and 3472 transitions. Word has length 132 [2022-11-25 15:41:05,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:41:05,051 INFO L495 AbstractCegarLoop]: Abstraction has 2601 states and 3472 transitions. [2022-11-25 15:41:05,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-25 15:41:05,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2601 states and 3472 transitions. [2022-11-25 15:41:05,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-25 15:41:05,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:41:05,054 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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-11-25 15:41:05,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 15:41:05,054 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:41:05,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:05,055 INFO L85 PathProgramCache]: Analyzing trace with hash 507009091, now seen corresponding path program 1 times [2022-11-25 15:41:05,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:05,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488057277] [2022-11-25 15:41:05,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:05,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:41:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:41:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:41:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:41:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:41:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:41:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:41:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:41:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:41:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:41:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:41:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:41:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:41:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:41:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:41:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:41:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 15:41:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 15:41:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 15:41:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 15:41:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 15:41:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:41:05,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:05,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488057277] [2022-11-25 15:41:05,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488057277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:05,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:05,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:41:05,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137251764] [2022-11-25 15:41:05,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:05,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:41:05,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:05,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:41:05,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:41:05,454 INFO L87 Difference]: Start difference. First operand 2601 states and 3472 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-25 15:41:08,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:41:14,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:41:14,067 INFO L93 Difference]: Finished difference Result 2607 states and 3475 transitions. [2022-11-25 15:41:14,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:41:14,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 138 [2022-11-25 15:41:14,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:41:14,085 INFO L225 Difference]: With dead ends: 2607 [2022-11-25 15:41:14,090 INFO L226 Difference]: Without dead ends: 2605 [2022-11-25 15:41:14,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:41:14,093 INFO L413 NwaCegarLoop]: 454 mSDtfsCounter, 2421 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 3501 mSolverCounterSat, 1351 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2509 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 4853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1351 IncrementalHoareTripleChecker+Valid, 3501 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:41:14,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2509 Valid, 1272 Invalid, 4853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1351 Valid, 3501 Invalid, 1 Unknown, 0 Unchecked, 8.1s Time] [2022-11-25 15:41:14,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2022-11-25 15:41:14,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 2599. [2022-11-25 15:41:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2599 states, 1746 states have (on average 1.1821305841924399) internal successors, (2064), 1803 states have internal predecessors, (2064), 628 states have call successors, (628), 215 states have call predecessors, (628), 211 states have return successors, (778), 602 states have call predecessors, (778), 626 states have call successors, (778) [2022-11-25 15:41:14,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2599 states and 3470 transitions. [2022-11-25 15:41:14,519 INFO L78 Accepts]: Start accepts. Automaton has 2599 states and 3470 transitions. Word has length 138 [2022-11-25 15:41:14,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:41:14,519 INFO L495 AbstractCegarLoop]: Abstraction has 2599 states and 3470 transitions. [2022-11-25 15:41:14,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-25 15:41:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 3470 transitions. [2022-11-25 15:41:14,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-25 15:41:14,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:41:14,522 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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-11-25 15:41:14,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 15:41:14,524 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:41:14,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:14,525 INFO L85 PathProgramCache]: Analyzing trace with hash 916022780, now seen corresponding path program 1 times [2022-11-25 15:41:14,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:14,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128776554] [2022-11-25 15:41:14,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:14,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:41:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:41:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:41:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:41:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:41:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:41:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:41:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:41:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:41:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:41:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:41:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:41:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:41:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:41:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:41:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:41:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 15:41:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 15:41:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 15:41:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 15:41:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 15:41:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:14,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-25 15:41:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:15,008 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:41:15,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:15,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128776554] [2022-11-25 15:41:15,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128776554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:15,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:15,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:41:15,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560355220] [2022-11-25 15:41:15,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:15,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:41:15,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:15,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:41:15,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:41:15,013 INFO L87 Difference]: Start difference. First operand 2599 states and 3470 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-25 15:41:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:41:21,769 INFO L93 Difference]: Finished difference Result 2599 states and 3470 transitions. [2022-11-25 15:41:21,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:41:21,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2022-11-25 15:41:21,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:41:21,778 INFO L225 Difference]: With dead ends: 2599 [2022-11-25 15:41:21,778 INFO L226 Difference]: Without dead ends: 2597 [2022-11-25 15:41:21,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:41:21,780 INFO L413 NwaCegarLoop]: 453 mSDtfsCounter, 2452 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 2515 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2538 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 3889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 2515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:41:21,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2538 Valid, 1269 Invalid, 3889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 2515 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-11-25 15:41:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2022-11-25 15:41:22,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2597. [2022-11-25 15:41:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2597 states, 1745 states have (on average 1.1816618911174785) internal successors, (2062), 1801 states have internal predecessors, (2062), 628 states have call successors, (628), 215 states have call predecessors, (628), 211 states have return successors, (778), 602 states have call predecessors, (778), 626 states have call successors, (778) [2022-11-25 15:41:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 3468 transitions. [2022-11-25 15:41:22,118 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 3468 transitions. Word has length 144 [2022-11-25 15:41:22,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:41:22,119 INFO L495 AbstractCegarLoop]: Abstraction has 2597 states and 3468 transitions. [2022-11-25 15:41:22,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-25 15:41:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 3468 transitions. [2022-11-25 15:41:22,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-11-25 15:41:22,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:41:22,123 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-11-25 15:41:22,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 15:41:22,124 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:41:22,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:22,124 INFO L85 PathProgramCache]: Analyzing trace with hash 223518197, now seen corresponding path program 1 times [2022-11-25 15:41:22,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:22,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034288238] [2022-11-25 15:41:22,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:22,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:41:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:41:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:41:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:41:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:41:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:41:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:41:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:41:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:41:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:41:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:41:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:41:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:41:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:41:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:41:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:41:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 15:41:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 15:41:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 15:41:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 15:41:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 15:41:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-25 15:41:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-25 15:41:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:41:22,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:22,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034288238] [2022-11-25 15:41:22,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034288238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:22,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:22,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:41:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784403336] [2022-11-25 15:41:22,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:22,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:41:22,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:22,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:41:22,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:41:22,869 INFO L87 Difference]: Start difference. First operand 2597 states and 3468 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-25 15:41:25,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:41:31,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:41:31,984 INFO L93 Difference]: Finished difference Result 2603 states and 3471 transitions. [2022-11-25 15:41:31,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:41:31,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2022-11-25 15:41:31,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:41:31,994 INFO L225 Difference]: With dead ends: 2603 [2022-11-25 15:41:31,994 INFO L226 Difference]: Without dead ends: 2601 [2022-11-25 15:41:31,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:41:31,996 INFO L413 NwaCegarLoop]: 454 mSDtfsCounter, 2409 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 3493 mSolverCounterSat, 1351 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2495 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 4845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1351 IncrementalHoareTripleChecker+Valid, 3493 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:41:31,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2495 Valid, 1272 Invalid, 4845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1351 Valid, 3493 Invalid, 1 Unknown, 0 Unchecked, 8.5s Time] [2022-11-25 15:41:32,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2022-11-25 15:41:32,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 2595. [2022-11-25 15:41:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2595 states, 1744 states have (on average 1.1811926605504588) internal successors, (2060), 1799 states have internal predecessors, (2060), 628 states have call successors, (628), 215 states have call predecessors, (628), 211 states have return successors, (778), 602 states have call predecessors, (778), 626 states have call successors, (778) [2022-11-25 15:41:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 3466 transitions. [2022-11-25 15:41:32,375 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 3466 transitions. Word has length 150 [2022-11-25 15:41:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:41:32,376 INFO L495 AbstractCegarLoop]: Abstraction has 2595 states and 3466 transitions. [2022-11-25 15:41:32,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-25 15:41:32,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3466 transitions. [2022-11-25 15:41:32,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-25 15:41:32,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:41:32,380 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1] [2022-11-25 15:41:32,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 15:41:32,381 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:41:32,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:32,381 INFO L85 PathProgramCache]: Analyzing trace with hash -320656802, now seen corresponding path program 1 times [2022-11-25 15:41:32,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:32,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240721060] [2022-11-25 15:41:32,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:32,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:41:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:41:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:41:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:41:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:41:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:41:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:41:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:41:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:41:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:41:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:41:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:41:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:41:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:41:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:41:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:41:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 15:41:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 15:41:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 15:41:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 15:41:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 15:41:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-25 15:41:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-25 15:41:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-25 15:41:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:32,812 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:41:32,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:32,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240721060] [2022-11-25 15:41:32,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240721060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:32,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:32,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:41:32,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365953604] [2022-11-25 15:41:32,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:32,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:41:32,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:32,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:41:32,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:41:32,814 INFO L87 Difference]: Start difference. First operand 2595 states and 3466 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-25 15:41:35,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:41:37,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:41:42,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:41:42,007 INFO L93 Difference]: Finished difference Result 2595 states and 3466 transitions. [2022-11-25 15:41:42,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:41:42,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2022-11-25 15:41:42,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:41:42,017 INFO L225 Difference]: With dead ends: 2595 [2022-11-25 15:41:42,018 INFO L226 Difference]: Without dead ends: 2593 [2022-11-25 15:41:42,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:41:42,020 INFO L413 NwaCegarLoop]: 453 mSDtfsCounter, 2440 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 2506 mSolverCounterSat, 1374 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2524 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 3881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 2506 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-11-25 15:41:42,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2524 Valid, 1269 Invalid, 3881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 2506 Invalid, 1 Unknown, 0 Unchecked, 8.7s Time] [2022-11-25 15:41:42,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2022-11-25 15:41:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2593. [2022-11-25 15:41:42,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2593 states, 1743 states have (on average 1.180722891566265) internal successors, (2058), 1797 states have internal predecessors, (2058), 628 states have call successors, (628), 215 states have call predecessors, (628), 211 states have return successors, (778), 602 states have call predecessors, (778), 626 states have call successors, (778) [2022-11-25 15:41:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 3464 transitions. [2022-11-25 15:41:42,494 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 3464 transitions. Word has length 156 [2022-11-25 15:41:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:41:42,495 INFO L495 AbstractCegarLoop]: Abstraction has 2593 states and 3464 transitions. [2022-11-25 15:41:42,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-25 15:41:42,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 3464 transitions. [2022-11-25 15:41:42,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-25 15:41:42,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:41:42,500 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:41:42,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 15:41:42,500 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:41:42,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:42,501 INFO L85 PathProgramCache]: Analyzing trace with hash 123775354, now seen corresponding path program 1 times [2022-11-25 15:41:42,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:42,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780829711] [2022-11-25 15:41:42,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:42,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:41:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:41:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:41:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:41:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:41:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:41:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:41:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:41:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:41:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:41:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:41:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:41:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:41:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:41:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:41:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:41:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 15:41:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 15:41:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 15:41:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 15:41:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 15:41:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-25 15:41:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-25 15:41:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-25 15:41:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-25 15:41:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:41:42,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:42,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780829711] [2022-11-25 15:41:42,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780829711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:42,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:42,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:41:42,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943344449] [2022-11-25 15:41:42,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:42,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:41:42,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:42,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:41:42,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:41:42,975 INFO L87 Difference]: Start difference. First operand 2593 states and 3464 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-25 15:41:46,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:41:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:41:50,915 INFO L93 Difference]: Finished difference Result 2593 states and 3464 transitions. [2022-11-25 15:41:50,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:41:50,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 162 [2022-11-25 15:41:50,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:41:50,922 INFO L225 Difference]: With dead ends: 2593 [2022-11-25 15:41:50,922 INFO L226 Difference]: Without dead ends: 2591 [2022-11-25 15:41:50,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:41:50,924 INFO L413 NwaCegarLoop]: 453 mSDtfsCounter, 2434 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 2502 mSolverCounterSat, 1374 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2517 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 3877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 2502 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:41:50,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2517 Valid, 1269 Invalid, 3877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 2502 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2022-11-25 15:41:50,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2022-11-25 15:41:51,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2591. [2022-11-25 15:41:51,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2591 states, 1742 states have (on average 1.1802525832376578) internal successors, (2056), 1795 states have internal predecessors, (2056), 628 states have call successors, (628), 215 states have call predecessors, (628), 211 states have return successors, (778), 602 states have call predecessors, (778), 626 states have call successors, (778) [2022-11-25 15:41:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 3462 transitions. [2022-11-25 15:41:51,363 INFO L78 Accepts]: Start accepts. Automaton has 2591 states and 3462 transitions. Word has length 162 [2022-11-25 15:41:51,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:41:51,363 INFO L495 AbstractCegarLoop]: Abstraction has 2591 states and 3462 transitions. [2022-11-25 15:41:51,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-25 15:41:51,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 3462 transitions. [2022-11-25 15:41:51,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-25 15:41:51,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:41:51,369 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 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] [2022-11-25 15:41:51,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 15:41:51,369 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:41:51,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:41:51,370 INFO L85 PathProgramCache]: Analyzing trace with hash -709309929, now seen corresponding path program 1 times [2022-11-25 15:41:51,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:41:51,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401269252] [2022-11-25 15:41:51,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:41:51,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:41:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:41:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:41:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:41:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:41:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:41:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:41:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:41:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:41:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:41:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:41:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:41:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:41:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:41:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:41:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 15:41:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 15:41:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:41:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:41:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:41:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-25 15:41:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-25 15:41:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-25 15:41:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-25 15:41:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 15:41:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 15:41:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-25 15:41:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-25 15:41:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:41:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:41:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-25 15:41:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-25 15:41:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:41:51,962 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2022-11-25 15:41:51,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:41:51,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401269252] [2022-11-25 15:41:51,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401269252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:41:51,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:41:51,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 15:41:51,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159840933] [2022-11-25 15:41:51,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:41:51,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 15:41:51,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:41:51,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 15:41:51,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:41:51,967 INFO L87 Difference]: Start difference. First operand 2591 states and 3462 transitions. Second operand has 10 states, 9 states have (on average 9.222222222222221) internal successors, (83), 4 states have internal predecessors, (83), 3 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (28), 2 states have call predecessors, (28), 3 states have call successors, (28) [2022-11-25 15:41:55,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:42:06,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:42:06,793 INFO L93 Difference]: Finished difference Result 2824 states and 3965 transitions. [2022-11-25 15:42:06,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 15:42:06,794 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.222222222222221) internal successors, (83), 4 states have internal predecessors, (83), 3 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (28), 2 states have call predecessors, (28), 3 states have call successors, (28) Word has length 189 [2022-11-25 15:42:06,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:42:06,805 INFO L225 Difference]: With dead ends: 2824 [2022-11-25 15:42:06,805 INFO L226 Difference]: Without dead ends: 2822 [2022-11-25 15:42:06,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2022-11-25 15:42:06,808 INFO L413 NwaCegarLoop]: 478 mSDtfsCounter, 2789 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 7098 mSolverCounterSat, 2391 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2789 SdHoareTripleChecker+Valid, 2641 SdHoareTripleChecker+Invalid, 9490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2391 IncrementalHoareTripleChecker+Valid, 7098 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2022-11-25 15:42:06,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2789 Valid, 2641 Invalid, 9490 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2391 Valid, 7098 Invalid, 1 Unknown, 0 Unchecked, 13.9s Time] [2022-11-25 15:42:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2022-11-25 15:42:07,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2638. [2022-11-25 15:42:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2638 states, 1774 states have (on average 1.1764374295377678) internal successors, (2087), 1824 states have internal predecessors, (2087), 634 states have call successors, (634), 227 states have call predecessors, (634), 221 states have return successors, (780), 608 states have call predecessors, (780), 632 states have call successors, (780) [2022-11-25 15:42:07,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2638 states and 3501 transitions. [2022-11-25 15:42:07,265 INFO L78 Accepts]: Start accepts. Automaton has 2638 states and 3501 transitions. Word has length 189 [2022-11-25 15:42:07,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:42:07,266 INFO L495 AbstractCegarLoop]: Abstraction has 2638 states and 3501 transitions. [2022-11-25 15:42:07,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.222222222222221) internal successors, (83), 4 states have internal predecessors, (83), 3 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (28), 2 states have call predecessors, (28), 3 states have call successors, (28) [2022-11-25 15:42:07,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2638 states and 3501 transitions. [2022-11-25 15:42:07,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-11-25 15:42:07,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:42:07,271 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:42:07,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 15:42:07,272 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:42:07,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:07,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1536240615, now seen corresponding path program 1 times [2022-11-25 15:42:07,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:42:07,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443893550] [2022-11-25 15:42:07,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:07,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:42:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:42:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:42:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:42:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:42:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:42:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:42:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:42:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:42:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:42:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:42:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:42:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:42:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:42:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:42:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:42:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:42:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 15:42:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 15:42:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 15:42:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 15:42:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 15:42:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-25 15:42:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-25 15:42:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-25 15:42:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-25 15:42:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-25 15:42:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:42:07,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:42:07,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443893550] [2022-11-25 15:42:07,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443893550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:42:07,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:42:07,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:42:07,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790872332] [2022-11-25 15:42:07,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:42:07,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:42:07,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:42:07,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:42:07,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:42:07,752 INFO L87 Difference]: Start difference. First operand 2638 states and 3501 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-25 15:42:09,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:42:11,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:42:15,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:42:15,833 INFO L93 Difference]: Finished difference Result 2638 states and 3501 transitions. [2022-11-25 15:42:15,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:42:15,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2022-11-25 15:42:15,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:42:15,843 INFO L225 Difference]: With dead ends: 2638 [2022-11-25 15:42:15,843 INFO L226 Difference]: Without dead ends: 2636 [2022-11-25 15:42:15,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:42:15,846 INFO L413 NwaCegarLoop]: 453 mSDtfsCounter, 2422 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 1374 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2504 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 3869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:42:15,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2504 Valid, 1269 Invalid, 3869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 2494 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2022-11-25 15:42:15,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2022-11-25 15:42:16,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2022-11-25 15:42:16,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 1773 states have (on average 1.1759729272419628) internal successors, (2085), 1822 states have internal predecessors, (2085), 634 states have call successors, (634), 227 states have call predecessors, (634), 221 states have return successors, (780), 608 states have call predecessors, (780), 632 states have call successors, (780) [2022-11-25 15:42:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3499 transitions. [2022-11-25 15:42:16,354 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3499 transitions. Word has length 168 [2022-11-25 15:42:16,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:42:16,355 INFO L495 AbstractCegarLoop]: Abstraction has 2636 states and 3499 transitions. [2022-11-25 15:42:16,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-25 15:42:16,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3499 transitions. [2022-11-25 15:42:16,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-11-25 15:42:16,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:42:16,361 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:42:16,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 15:42:16,361 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:42:16,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:16,362 INFO L85 PathProgramCache]: Analyzing trace with hash -531282183, now seen corresponding path program 1 times [2022-11-25 15:42:16,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:42:16,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435789891] [2022-11-25 15:42:16,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:16,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:42:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:42:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:42:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:42:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:42:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:42:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:42:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:42:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:42:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:42:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:42:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:42:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:42:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:42:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:42:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:42:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:42:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 15:42:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 15:42:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 15:42:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 15:42:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 15:42:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-25 15:42:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-25 15:42:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-25 15:42:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-25 15:42:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-25 15:42:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-25 15:42:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:42:16,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:42:16,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435789891] [2022-11-25 15:42:16,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435789891] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:42:16,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:42:16,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:42:16,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949975348] [2022-11-25 15:42:16,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:42:16,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:42:16,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:42:16,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:42:16,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:42:16,820 INFO L87 Difference]: Start difference. First operand 2636 states and 3499 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-25 15:42:19,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:42:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:42:24,561 INFO L93 Difference]: Finished difference Result 2636 states and 3499 transitions. [2022-11-25 15:42:24,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:42:24,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2022-11-25 15:42:24,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:42:24,572 INFO L225 Difference]: With dead ends: 2636 [2022-11-25 15:42:24,572 INFO L226 Difference]: Without dead ends: 2634 [2022-11-25 15:42:24,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:42:24,575 INFO L413 NwaCegarLoop]: 453 mSDtfsCounter, 2416 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 1374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2497 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 3865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1374 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:42:24,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2497 Valid, 1269 Invalid, 3865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1374 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-11-25 15:42:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2022-11-25 15:42:25,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2634. [2022-11-25 15:42:25,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 1772 states have (on average 1.175507900677201) internal successors, (2083), 1820 states have internal predecessors, (2083), 634 states have call successors, (634), 227 states have call predecessors, (634), 221 states have return successors, (780), 608 states have call predecessors, (780), 632 states have call successors, (780) [2022-11-25 15:42:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 3497 transitions. [2022-11-25 15:42:25,143 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 3497 transitions. Word has length 174 [2022-11-25 15:42:25,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:42:25,144 INFO L495 AbstractCegarLoop]: Abstraction has 2634 states and 3497 transitions. [2022-11-25 15:42:25,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-25 15:42:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 3497 transitions. [2022-11-25 15:42:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-11-25 15:42:25,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:42:25,150 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 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-11-25 15:42:25,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 15:42:25,151 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:42:25,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:25,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2088348826, now seen corresponding path program 1 times [2022-11-25 15:42:25,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:42:25,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682725133] [2022-11-25 15:42:25,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:25,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:42:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:42:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:42:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:42:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:42:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:42:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:42:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:42:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:42:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:42:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 15:42:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:42:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 15:42:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 15:42:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 15:42:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:42:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:42:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 15:42:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 15:42:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 15:42:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 15:42:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 15:42:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-25 15:42:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-25 15:42:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-25 15:42:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-25 15:42:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-25 15:42:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-25 15:42:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-11-25 15:42:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:25,674 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:42:25,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:42:25,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682725133] [2022-11-25 15:42:25,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682725133] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:42:25,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:42:25,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:42:25,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099981827] [2022-11-25 15:42:25,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:42:25,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:42:25,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:42:25,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:42:25,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:42:25,677 INFO L87 Difference]: Start difference. First operand 2634 states and 3497 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-25 15:42:28,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:42:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:42:34,745 INFO L93 Difference]: Finished difference Result 2638 states and 3499 transitions. [2022-11-25 15:42:34,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:42:34,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 180 [2022-11-25 15:42:34,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:42:34,756 INFO L225 Difference]: With dead ends: 2638 [2022-11-25 15:42:34,757 INFO L226 Difference]: Without dead ends: 2482 [2022-11-25 15:42:34,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:42:34,761 INFO L413 NwaCegarLoop]: 454 mSDtfsCounter, 2362 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 3474 mSolverCounterSat, 1351 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2443 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 4826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1351 IncrementalHoareTripleChecker+Valid, 3474 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:42:34,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2443 Valid, 1272 Invalid, 4826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1351 Valid, 3474 Invalid, 1 Unknown, 0 Unchecked, 8.4s Time] [2022-11-25 15:42:34,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2482 states. [2022-11-25 15:42:35,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 2478. [2022-11-25 15:42:35,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 1678 states have (on average 1.1829558998808105) internal successors, (1985), 1723 states have internal predecessors, (1985), 593 states have call successors, (593), 207 states have call predecessors, (593), 201 states have return successors, (739), 569 states have call predecessors, (739), 591 states have call successors, (739) [2022-11-25 15:42:35,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 3317 transitions. [2022-11-25 15:42:35,102 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 3317 transitions. Word has length 180 [2022-11-25 15:42:35,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:42:35,103 INFO L495 AbstractCegarLoop]: Abstraction has 2478 states and 3317 transitions. [2022-11-25 15:42:35,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-25 15:42:35,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 3317 transitions. [2022-11-25 15:42:35,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-11-25 15:42:35,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:42:35,107 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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] [2022-11-25 15:42:35,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 15:42:35,108 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:42:35,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:35,108 INFO L85 PathProgramCache]: Analyzing trace with hash 704086945, now seen corresponding path program 1 times [2022-11-25 15:42:35,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:42:35,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710769013] [2022-11-25 15:42:35,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:35,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:42:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:35,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:42:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:35,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:42:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:35,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:42:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:35,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:42:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:35,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:42:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:42:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:42:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 15:42:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:42:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:42:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:42:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:42:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-25 15:42:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:42:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 15:42:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 15:42:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:42:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-25 15:42:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-25 15:42:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-25 15:42:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-25 15:42:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-25 15:42:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-25 15:42:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:42:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:42:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-25 15:42:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-25 15:42:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:42:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:42:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-25 15:42:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:42:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:42:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-11-25 15:42:36,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:42:36,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710769013] [2022-11-25 15:42:36,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710769013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:42:36,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:42:36,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 15:42:36,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992508672] [2022-11-25 15:42:36,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:42:36,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 15:42:36,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:42:36,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 15:42:36,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-25 15:42:36,316 INFO L87 Difference]: Start difference. First operand 2478 states and 3317 transitions. Second operand has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (27), 7 states have call predecessors, (27), 2 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2022-11-25 15:42:39,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:42:41,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:42:43,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:42:44,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:42:46,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:42:54,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:42:56,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:42:58,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:43:00,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:43:28,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:43:28,430 INFO L93 Difference]: Finished difference Result 7460 states and 11043 transitions. [2022-11-25 15:43:28,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 15:43:28,430 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (27), 7 states have call predecessors, (27), 2 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 205 [2022-11-25 15:43:28,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:43:28,459 INFO L225 Difference]: With dead ends: 7460 [2022-11-25 15:43:28,460 INFO L226 Difference]: Without dead ends: 7458 [2022-11-25 15:43:28,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=283, Invalid=839, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 15:43:28,465 INFO L413 NwaCegarLoop]: 724 mSDtfsCounter, 9555 mSDsluCounter, 3538 mSDsCounter, 0 mSdLazyCounter, 16975 mSolverCounterSat, 7318 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9630 SdHoareTripleChecker+Valid, 4262 SdHoareTripleChecker+Invalid, 24300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7318 IncrementalHoareTripleChecker+Valid, 16975 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:43:28,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9630 Valid, 4262 Invalid, 24300 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7318 Valid, 16975 Invalid, 7 Unknown, 0 Unchecked, 50.0s Time] [2022-11-25 15:43:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7458 states. [2022-11-25 15:43:29,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7458 to 7185. [2022-11-25 15:43:29,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7185 states, 4888 states have (on average 1.2037643207855975) internal successors, (5884), 5029 states have internal predecessors, (5884), 1785 states have call successors, (1785), 508 states have call predecessors, (1785), 506 states have return successors, (2821), 1720 states have call predecessors, (2821), 1783 states have call successors, (2821) [2022-11-25 15:43:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7185 states to 7185 states and 10490 transitions. [2022-11-25 15:43:29,798 INFO L78 Accepts]: Start accepts. Automaton has 7185 states and 10490 transitions. Word has length 205 [2022-11-25 15:43:29,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:43:29,799 INFO L495 AbstractCegarLoop]: Abstraction has 7185 states and 10490 transitions. [2022-11-25 15:43:29,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (27), 7 states have call predecessors, (27), 2 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2022-11-25 15:43:29,799 INFO L276 IsEmpty]: Start isEmpty. Operand 7185 states and 10490 transitions. [2022-11-25 15:43:29,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-11-25 15:43:29,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:43:29,804 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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] [2022-11-25 15:43:29,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 15:43:29,804 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:43:29,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:43:29,805 INFO L85 PathProgramCache]: Analyzing trace with hash 194613855, now seen corresponding path program 1 times [2022-11-25 15:43:29,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:43:29,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030936459] [2022-11-25 15:43:29,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:43:29,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:43:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:43:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:43:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:43:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:43:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:43:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:43:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 15:43:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:43:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:43:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:43:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-25 15:43:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:43:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 15:43:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 15:43:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-25 15:43:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-25 15:43:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-25 15:43:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-25 15:43:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-25 15:43:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-25 15:43:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-25 15:43:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-25 15:43:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-25 15:43:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:30,949 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-11-25 15:43:30,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:43:30,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030936459] [2022-11-25 15:43:30,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030936459] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:43:30,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474000613] [2022-11-25 15:43:30,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:43:30,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:43:30,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:43:30,955 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:43:30,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 15:43:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:31,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 2357 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-25 15:43:31,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:43:31,984 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-11-25 15:43:31,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:43:31,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474000613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:43:31,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:43:31,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 10 [2022-11-25 15:43:31,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97795707] [2022-11-25 15:43:31,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:43:31,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:43:31,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:43:31,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:43:31,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:43:31,987 INFO L87 Difference]: Start difference. First operand 7185 states and 10490 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-25 15:43:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:43:34,191 INFO L93 Difference]: Finished difference Result 13836 states and 21164 transitions. [2022-11-25 15:43:34,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:43:34,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) Word has length 205 [2022-11-25 15:43:34,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:43:34,232 INFO L225 Difference]: With dead ends: 13836 [2022-11-25 15:43:34,233 INFO L226 Difference]: Without dead ends: 7253 [2022-11-25 15:43:34,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 267 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:43:34,306 INFO L413 NwaCegarLoop]: 1380 mSDtfsCounter, 7 mSDsluCounter, 5503 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 6883 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 15:43:34,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 6883 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 15:43:34,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7253 states. [2022-11-25 15:43:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7253 to 7220. [2022-11-25 15:43:35,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7220 states, 4916 states have (on average 1.2026037428803906) internal successors, (5912), 5057 states have internal predecessors, (5912), 1785 states have call successors, (1785), 508 states have call predecessors, (1785), 513 states have return successors, (2828), 1727 states have call predecessors, (2828), 1783 states have call successors, (2828) [2022-11-25 15:43:35,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7220 states to 7220 states and 10525 transitions. [2022-11-25 15:43:35,528 INFO L78 Accepts]: Start accepts. Automaton has 7220 states and 10525 transitions. Word has length 205 [2022-11-25 15:43:35,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:43:35,529 INFO L495 AbstractCegarLoop]: Abstraction has 7220 states and 10525 transitions. [2022-11-25 15:43:35,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-25 15:43:35,529 INFO L276 IsEmpty]: Start isEmpty. Operand 7220 states and 10525 transitions. [2022-11-25 15:43:35,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-11-25 15:43:35,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:43:35,534 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:43:35,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 15:43:35,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-25 15:43:35,744 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_assert_linux_kernel_sched_completion__wait_without_initErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:43:35,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:43:35,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2074587313, now seen corresponding path program 1 times [2022-11-25 15:43:35,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:43:35,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273654995] [2022-11-25 15:43:35,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:43:35,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:43:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:43:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:43:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:43:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:43:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:43:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:43:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:43:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:43:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:43:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:43:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:43:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:43:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 15:43:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 15:43:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:43:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:43:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-25 15:43:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-25 15:43:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 15:43:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 15:43:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 15:43:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 15:43:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:43:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 15:43:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:43:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:43:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 15:43:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 15:43:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:43:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:36,544 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-11-25 15:43:36,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:43:36,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273654995] [2022-11-25 15:43:36,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273654995] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:43:36,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:43:36,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-25 15:43:36,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272342643] [2022-11-25 15:43:36,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:43:36,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 15:43:36,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:43:36,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 15:43:36,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-11-25 15:43:36,548 INFO L87 Difference]: Start difference. First operand 7220 states and 10525 transitions. Second operand has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (34), 8 states have call predecessors, (34), 3 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) [2022-11-25 15:43:41,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:43:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:43:57,456 INFO L93 Difference]: Finished difference Result 8601 states and 12919 transitions. [2022-11-25 15:43:57,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 15:43:57,457 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (34), 8 states have call predecessors, (34), 3 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) Word has length 213 [2022-11-25 15:43:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:43:57,480 INFO L225 Difference]: With dead ends: 8601 [2022-11-25 15:43:57,480 INFO L226 Difference]: Without dead ends: 7812 [2022-11-25 15:43:57,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2022-11-25 15:43:57,486 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 2305 mSDsluCounter, 3617 mSDsCounter, 0 mSdLazyCounter, 11130 mSolverCounterSat, 2295 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2313 SdHoareTripleChecker+Valid, 4058 SdHoareTripleChecker+Invalid, 13426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2295 IncrementalHoareTripleChecker+Valid, 11130 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:43:57,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2313 Valid, 4058 Invalid, 13426 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2295 Valid, 11130 Invalid, 1 Unknown, 0 Unchecked, 19.2s Time] [2022-11-25 15:43:57,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7812 states. [2022-11-25 15:43:58,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7812 to 7260. [2022-11-25 15:43:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7260 states, 4944 states have (on average 1.2014563106796117) internal successors, (5940), 5085 states have internal predecessors, (5940), 1789 states have call successors, (1789), 508 states have call predecessors, (1789), 521 states have return successors, (2871), 1739 states have call predecessors, (2871), 1787 states have call successors, (2871) [2022-11-25 15:43:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7260 states to 7260 states and 10600 transitions. [2022-11-25 15:43:58,936 INFO L78 Accepts]: Start accepts. Automaton has 7260 states and 10600 transitions. Word has length 213 [2022-11-25 15:43:58,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:43:58,937 INFO L495 AbstractCegarLoop]: Abstraction has 7260 states and 10600 transitions. [2022-11-25 15:43:58,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (34), 8 states have call predecessors, (34), 3 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) [2022-11-25 15:43:58,937 INFO L276 IsEmpty]: Start isEmpty. Operand 7260 states and 10600 transitions. [2022-11-25 15:43:58,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-11-25 15:43:58,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:43:58,943 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:43:58,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-25 15:43:58,944 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_assert_linux_kernel_sched_completion__wait_without_initErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:43:58,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:43:58,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1179614861, now seen corresponding path program 1 times [2022-11-25 15:43:58,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:43:58,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063164409] [2022-11-25 15:43:58,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:43:58,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:43:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:43:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:43:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:43:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:43:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:43:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:43:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:43:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:43:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:43:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:43:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:43:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:43:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 15:43:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 15:43:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:43:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:43:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-25 15:43:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-25 15:43:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 15:43:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 15:43:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 15:43:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 15:43:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:43:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 15:43:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:43:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 15:43:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 15:43:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-25 15:43:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:43:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:43:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:43:59,948 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-11-25 15:43:59,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:43:59,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063164409] [2022-11-25 15:43:59,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063164409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:43:59,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:43:59,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-25 15:43:59,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013825061] [2022-11-25 15:43:59,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:43:59,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 15:43:59,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:43:59,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 15:43:59,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-11-25 15:43:59,953 INFO L87 Difference]: Start difference. First operand 7260 states and 10600 transitions. Second operand has 15 states, 15 states have (on average 6.866666666666666) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (35), 8 states have call predecessors, (35), 3 states have return successors, (34), 4 states have call predecessors, (34), 3 states have call successors, (34) [2022-11-25 15:44:05,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:44:07,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:44:09,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:44:11,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:44:12,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:44:14,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:44:16,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:44:18,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:44:20,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:44:31,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:44:38,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:38,290 INFO L93 Difference]: Finished difference Result 8681 states and 13042 transitions. [2022-11-25 15:44:38,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 15:44:38,291 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.866666666666666) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (35), 8 states have call predecessors, (35), 3 states have return successors, (34), 4 states have call predecessors, (34), 3 states have call successors, (34) Word has length 221 [2022-11-25 15:44:38,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:38,317 INFO L225 Difference]: With dead ends: 8681 [2022-11-25 15:44:38,317 INFO L226 Difference]: Without dead ends: 7852 [2022-11-25 15:44:38,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2022-11-25 15:44:38,324 INFO L413 NwaCegarLoop]: 446 mSDtfsCounter, 2582 mSDsluCounter, 3658 mSDsCounter, 0 mSdLazyCounter, 11414 mSolverCounterSat, 2554 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2590 SdHoareTripleChecker+Valid, 4104 SdHoareTripleChecker+Invalid, 13975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2554 IncrementalHoareTripleChecker+Valid, 11414 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.6s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:38,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2590 Valid, 4104 Invalid, 13975 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2554 Valid, 11414 Invalid, 7 Unknown, 0 Unchecked, 36.6s Time] [2022-11-25 15:44:38,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7852 states. [2022-11-25 15:44:39,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7852 to 7264. [2022-11-25 15:44:39,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7264 states, 4948 states have (on average 1.2012934518997576) internal successors, (5944), 5089 states have internal predecessors, (5944), 1789 states have call successors, (1789), 508 states have call predecessors, (1789), 521 states have return successors, (2871), 1739 states have call predecessors, (2871), 1787 states have call successors, (2871) [2022-11-25 15:44:39,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7264 states to 7264 states and 10604 transitions. [2022-11-25 15:44:39,529 INFO L78 Accepts]: Start accepts. Automaton has 7264 states and 10604 transitions. Word has length 221 [2022-11-25 15:44:39,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:39,530 INFO L495 AbstractCegarLoop]: Abstraction has 7264 states and 10604 transitions. [2022-11-25 15:44:39,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.866666666666666) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (35), 8 states have call predecessors, (35), 3 states have return successors, (34), 4 states have call predecessors, (34), 3 states have call successors, (34) [2022-11-25 15:44:39,530 INFO L276 IsEmpty]: Start isEmpty. Operand 7264 states and 10604 transitions. [2022-11-25 15:44:39,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2022-11-25 15:44:39,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:39,535 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 9, 9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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-11-25 15:44:39,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-25 15:44:39,536 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:44:39,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:39,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1715393912, now seen corresponding path program 1 times [2022-11-25 15:44:39,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:39,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143561834] [2022-11-25 15:44:39,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:39,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:44:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:44:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:44:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:44:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:44:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 15:44:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:44:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:44:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-25 15:44:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:44:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 15:44:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-25 15:44:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-25 15:44:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 15:44:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 15:44:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-25 15:44:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-25 15:44:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-25 15:44:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:44:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-25 15:44:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-25 15:44:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-25 15:44:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 15:44:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:44:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 15:44:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-11-25 15:44:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 15:44:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-11-25 15:44:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-11-25 15:44:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-11-25 15:44:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-11-25 15:44:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-11-25 15:44:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-11-25 15:44:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2022-11-25 15:44:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:40,987 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2022-11-25 15:44:40,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:40,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143561834] [2022-11-25 15:44:40,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143561834] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:44:40,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39247345] [2022-11-25 15:44:40,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:40,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:44:40,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:44:41,006 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:44:41,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 15:44:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:41,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 2807 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 15:44:41,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:44:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2022-11-25 15:44:42,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:44:42,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39247345] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:42,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:44:42,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [12] total 25 [2022-11-25 15:44:42,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47381061] [2022-11-25 15:44:42,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:42,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 15:44:42,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:42,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 15:44:42,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2022-11-25 15:44:42,423 INFO L87 Difference]: Start difference. First operand 7264 states and 10604 transitions. Second operand has 15 states, 14 states have (on average 9.714285714285714) internal successors, (136), 13 states have internal predecessors, (136), 6 states have call successors, (44), 2 states have call predecessors, (44), 5 states have return successors, (41), 7 states have call predecessors, (41), 6 states have call successors, (41) [2022-11-25 15:44:44,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:44,624 INFO L93 Difference]: Finished difference Result 14666 states and 21468 transitions. [2022-11-25 15:44:44,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 15:44:44,625 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 9.714285714285714) internal successors, (136), 13 states have internal predecessors, (136), 6 states have call successors, (44), 2 states have call predecessors, (44), 5 states have return successors, (41), 7 states have call predecessors, (41), 6 states have call successors, (41) Word has length 306 [2022-11-25 15:44:44,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:44,651 INFO L225 Difference]: With dead ends: 14666 [2022-11-25 15:44:44,651 INFO L226 Difference]: Without dead ends: 7984 [2022-11-25 15:44:44,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2022-11-25 15:44:44,679 INFO L413 NwaCegarLoop]: 1475 mSDtfsCounter, 466 mSDsluCounter, 18525 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 20000 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:44,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 20000 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 15:44:44,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7984 states. [2022-11-25 15:44:45,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7984 to 7383. [2022-11-25 15:44:45,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7383 states, 5032 states have (on average 1.197933227344992) internal successors, (6028), 5173 states have internal predecessors, (6028), 1817 states have call successors, (1817), 508 states have call predecessors, (1817), 528 states have return successors, (2913), 1774 states have call predecessors, (2913), 1815 states have call successors, (2913) [2022-11-25 15:44:45,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7383 states to 7383 states and 10758 transitions. [2022-11-25 15:44:45,777 INFO L78 Accepts]: Start accepts. Automaton has 7383 states and 10758 transitions. Word has length 306 [2022-11-25 15:44:45,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:45,777 INFO L495 AbstractCegarLoop]: Abstraction has 7383 states and 10758 transitions. [2022-11-25 15:44:45,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 9.714285714285714) internal successors, (136), 13 states have internal predecessors, (136), 6 states have call successors, (44), 2 states have call predecessors, (44), 5 states have return successors, (41), 7 states have call predecessors, (41), 6 states have call successors, (41) [2022-11-25 15:44:45,778 INFO L276 IsEmpty]: Start isEmpty. Operand 7383 states and 10758 transitions. [2022-11-25 15:44:45,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-11-25 15:44:45,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:45,783 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:44:45,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 15:44:45,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:44:45,994 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:44:45,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:45,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1413000975, now seen corresponding path program 1 times [2022-11-25 15:44:45,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:45,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063755083] [2022-11-25 15:44:45,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:45,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:44:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:44:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:44:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:44:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:44:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 15:44:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:44:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:44:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-25 15:44:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:44:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 15:44:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 15:44:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 15:44:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:44:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 15:44:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 15:44:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-25 15:44:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-25 15:44:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-25 15:44:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-25 15:44:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-25 15:44:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:47,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:47,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:47,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-25 15:44:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:47,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-25 15:44:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:47,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:47,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:47,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-25 15:44:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:47,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:47,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:47,255 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2022-11-25 15:44:47,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:47,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063755083] [2022-11-25 15:44:47,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063755083] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:44:47,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669271868] [2022-11-25 15:44:47,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:47,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:44:47,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:44:47,258 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:44:47,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 15:44:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:48,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 2409 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-25 15:44:48,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:44:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 99 proven. 3 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-11-25 15:44:48,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:44:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2022-11-25 15:44:49,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669271868] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:44:49,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:44:49,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 23 [2022-11-25 15:44:49,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758297653] [2022-11-25 15:44:49,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:44:49,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 15:44:49,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:49,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 15:44:49,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2022-11-25 15:44:49,035 INFO L87 Difference]: Start difference. First operand 7383 states and 10758 transitions. Second operand has 23 states, 22 states have (on average 8.681818181818182) internal successors, (191), 15 states have internal predecessors, (191), 5 states have call successors, (77), 6 states have call predecessors, (77), 7 states have return successors, (73), 8 states have call predecessors, (73), 5 states have call successors, (73) [2022-11-25 15:44:55,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:45:18,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:18,036 INFO L93 Difference]: Finished difference Result 14936 states and 23011 transitions. [2022-11-25 15:45:18,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 15:45:18,037 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 8.681818181818182) internal successors, (191), 15 states have internal predecessors, (191), 5 states have call successors, (77), 6 states have call predecessors, (77), 7 states have return successors, (73), 8 states have call predecessors, (73), 5 states have call successors, (73) Word has length 221 [2022-11-25 15:45:18,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:18,060 INFO L225 Difference]: With dead ends: 14936 [2022-11-25 15:45:18,060 INFO L226 Difference]: Without dead ends: 7570 [2022-11-25 15:45:18,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=184, Invalid=1222, Unknown=0, NotChecked=0, Total=1406 [2022-11-25 15:45:18,096 INFO L413 NwaCegarLoop]: 469 mSDtfsCounter, 1939 mSDsluCounter, 5122 mSDsCounter, 0 mSdLazyCounter, 16353 mSolverCounterSat, 1576 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2004 SdHoareTripleChecker+Valid, 5591 SdHoareTripleChecker+Invalid, 17930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1576 IncrementalHoareTripleChecker+Valid, 16353 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.9s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:18,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2004 Valid, 5591 Invalid, 17930 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1576 Valid, 16353 Invalid, 1 Unknown, 0 Unchecked, 26.9s Time] [2022-11-25 15:45:18,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7570 states. [2022-11-25 15:45:19,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7570 to 7404. [2022-11-25 15:45:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7404 states, 5047 states have (on average 1.1971468198930058) internal successors, (6042), 5187 states have internal predecessors, (6042), 1817 states have call successors, (1817), 508 states have call predecessors, (1817), 534 states have return successors, (2927), 1780 states have call predecessors, (2927), 1815 states have call successors, (2927) [2022-11-25 15:45:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7404 states to 7404 states and 10786 transitions. [2022-11-25 15:45:19,297 INFO L78 Accepts]: Start accepts. Automaton has 7404 states and 10786 transitions. Word has length 221 [2022-11-25 15:45:19,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:19,298 INFO L495 AbstractCegarLoop]: Abstraction has 7404 states and 10786 transitions. [2022-11-25 15:45:19,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 8.681818181818182) internal successors, (191), 15 states have internal predecessors, (191), 5 states have call successors, (77), 6 states have call predecessors, (77), 7 states have return successors, (73), 8 states have call predecessors, (73), 5 states have call successors, (73) [2022-11-25 15:45:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 7404 states and 10786 transitions. [2022-11-25 15:45:19,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-11-25 15:45:19,302 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:19,302 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 15:45:19,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:19,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-25 15:45:19,503 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:45:19,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:19,504 INFO L85 PathProgramCache]: Analyzing trace with hash 479611154, now seen corresponding path program 1 times [2022-11-25 15:45:19,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:19,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416755941] [2022-11-25 15:45:19,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:19,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:45:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:45:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:45:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:45:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:45:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:45:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:45:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 15:45:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:45:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:45:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:45:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:45:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 15:45:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:45:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 15:45:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:45:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-25 15:45:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:45:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 15:45:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:45:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 15:45:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 15:45:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-25 15:45:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-25 15:45:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-25 15:45:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-25 15:45:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-25 15:45:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:45:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:45:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 15:45:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:45:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 15:45:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-25 15:45:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-25 15:45:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:45:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:45:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-11-25 15:45:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:45:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:45:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 15:45:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:45:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 15:45:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2022-11-25 15:45:21,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:21,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416755941] [2022-11-25 15:45:21,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416755941] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:45:21,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497682708] [2022-11-25 15:45:21,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:21,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:21,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:45:21,759 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:45:21,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 15:45:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:24,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 2531 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-25 15:45:24,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:24,514 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-11-25 15:45:24,514 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:45:24,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497682708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:24,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:45:24,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 15 [2022-11-25 15:45:24,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858903253] [2022-11-25 15:45:24,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:24,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:45:24,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:24,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:45:24,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-25 15:45:24,516 INFO L87 Difference]: Start difference. First operand 7404 states and 10786 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (34), 4 states have call predecessors, (34), 2 states have call successors, (34) [2022-11-25 15:45:25,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:25,904 INFO L93 Difference]: Finished difference Result 14194 states and 21669 transitions. [2022-11-25 15:45:25,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:45:25,905 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (34), 4 states have call predecessors, (34), 2 states have call successors, (34) Word has length 257 [2022-11-25 15:45:25,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:25,926 INFO L225 Difference]: With dead ends: 14194 [2022-11-25 15:45:25,926 INFO L226 Difference]: Without dead ends: 7431 [2022-11-25 15:45:25,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 336 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-11-25 15:45:25,947 INFO L413 NwaCegarLoop]: 1374 mSDtfsCounter, 5 mSDsluCounter, 9605 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 10979 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:25,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 10979 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:45:25,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2022-11-25 15:45:26,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 7425. [2022-11-25 15:45:26,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7425 states, 5065 states have (on average 1.1964461994076998) internal successors, (6060), 5202 states have internal predecessors, (6060), 1817 states have call successors, (1817), 508 states have call predecessors, (1817), 537 states have return successors, (2935), 1786 states have call predecessors, (2935), 1815 states have call successors, (2935) [2022-11-25 15:45:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7425 states to 7425 states and 10812 transitions. [2022-11-25 15:45:27,030 INFO L78 Accepts]: Start accepts. Automaton has 7425 states and 10812 transitions. Word has length 257 [2022-11-25 15:45:27,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:27,031 INFO L495 AbstractCegarLoop]: Abstraction has 7425 states and 10812 transitions. [2022-11-25 15:45:27,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (34), 4 states have call predecessors, (34), 2 states have call successors, (34) [2022-11-25 15:45:27,031 INFO L276 IsEmpty]: Start isEmpty. Operand 7425 states and 10812 transitions. [2022-11-25 15:45:27,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-11-25 15:45:27,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:27,037 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:27,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:27,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:27,262 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:45:27,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:27,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1444429410, now seen corresponding path program 1 times [2022-11-25 15:45:27,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:27,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321845788] [2022-11-25 15:45:27,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:27,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:45:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:45:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:45:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:45:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:45:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:45:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:45:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 15:45:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:45:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:45:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:45:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:45:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 15:45:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:45:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 15:45:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 15:45:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-25 15:45:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:45:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 15:45:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:45:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 15:45:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 15:45:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-25 15:45:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-25 15:45:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-25 15:45:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-25 15:45:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-25 15:45:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:45:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:45:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 15:45:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:45:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 15:45:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-25 15:45:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-25 15:45:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:45:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:30,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:45:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:30,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 15:45:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:30,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:45:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:30,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 15:45:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:30,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-11-25 15:45:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:30,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:45:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:30,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:45:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:30,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 15:45:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:30,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:45:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:30,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 15:45:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:30,075 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2022-11-25 15:45:30,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:30,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321845788] [2022-11-25 15:45:30,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321845788] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:45:30,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728274288] [2022-11-25 15:45:30,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:30,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:30,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:45:30,079 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:45:30,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 15:45:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:31,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 2583 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-25 15:45:31,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:31,649 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 208 proven. 3 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2022-11-25 15:45:31,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:45:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2022-11-25 15:45:32,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728274288] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:45:32,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:45:32,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 8] total 26 [2022-11-25 15:45:32,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430790487] [2022-11-25 15:45:32,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:45:32,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 15:45:32,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:32,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 15:45:32,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2022-11-25 15:45:32,354 INFO L87 Difference]: Start difference. First operand 7425 states and 10812 transitions. Second operand has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 17 states have internal predecessors, (139), 5 states have call successors, (55), 7 states have call predecessors, (55), 7 states have return successors, (47), 9 states have call predecessors, (47), 5 states have call successors, (47) [2022-11-25 15:45:40,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:45:42,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:45:44,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:45:46,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:45:48,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:45:50,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:45:52,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:45:53,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:45:55,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:45:57,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:45:59,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:46:00,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:46:02,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:46:04,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:46:05,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:46:07,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:46:09,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:46:26,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:46:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:46:40,938 INFO L93 Difference]: Finished difference Result 12747 states and 19774 transitions. [2022-11-25 15:46:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 15:46:40,939 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 17 states have internal predecessors, (139), 5 states have call successors, (55), 7 states have call predecessors, (55), 7 states have return successors, (47), 9 states have call predecessors, (47), 5 states have call successors, (47) Word has length 273 [2022-11-25 15:46:40,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:46:40,965 INFO L225 Difference]: With dead ends: 12747 [2022-11-25 15:46:40,965 INFO L226 Difference]: Without dead ends: 5963 [2022-11-25 15:46:40,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 623 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=255, Invalid=1725, Unknown=0, NotChecked=0, Total=1980 [2022-11-25 15:46:41,000 INFO L413 NwaCegarLoop]: 390 mSDtfsCounter, 1498 mSDsluCounter, 5769 mSDsCounter, 0 mSdLazyCounter, 20208 mSolverCounterSat, 1263 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 6159 SdHoareTripleChecker+Invalid, 21481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1263 IncrementalHoareTripleChecker+Valid, 20208 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:46:41,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 6159 Invalid, 21481 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1263 Valid, 20208 Invalid, 10 Unknown, 0 Unchecked, 66.5s Time] [2022-11-25 15:46:41,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5963 states. [2022-11-25 15:46:41,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5963 to 5891. [2022-11-25 15:46:41,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5891 states, 4015 states have (on average 1.1835616438356165) internal successors, (4752), 4122 states have internal predecessors, (4752), 1401 states have call successors, (1401), 445 states have call predecessors, (1401), 469 states have return successors, (2452), 1371 states have call predecessors, (2452), 1399 states have call successors, (2452) [2022-11-25 15:46:41,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5891 states to 5891 states and 8605 transitions. [2022-11-25 15:46:41,949 INFO L78 Accepts]: Start accepts. Automaton has 5891 states and 8605 transitions. Word has length 273 [2022-11-25 15:46:41,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:46:41,949 INFO L495 AbstractCegarLoop]: Abstraction has 5891 states and 8605 transitions. [2022-11-25 15:46:41,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 17 states have internal predecessors, (139), 5 states have call successors, (55), 7 states have call predecessors, (55), 7 states have return successors, (47), 9 states have call predecessors, (47), 5 states have call successors, (47) [2022-11-25 15:46:41,949 INFO L276 IsEmpty]: Start isEmpty. Operand 5891 states and 8605 transitions. [2022-11-25 15:46:41,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2022-11-25 15:46:41,952 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:41,952 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:41,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:42,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:46:42,154 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_assert_linux_kernel_sched_completion__wait_without_initErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:46:42,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:42,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1404230444, now seen corresponding path program 1 times [2022-11-25 15:46:42,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:42,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426665504] [2022-11-25 15:46:42,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:42,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:46:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:46:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:46:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:46:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:46:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:46:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:46:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:46:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:46:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:46:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:46:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:46:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:46:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:46:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 15:46:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 15:46:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:46:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:46:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:46:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-25 15:46:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-25 15:46:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 15:46:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:46:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 15:46:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:46:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 15:46:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 15:46:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:46:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 15:46:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:46:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:46:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:46:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 15:46:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 15:46:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:46:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:46:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:46:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:46:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 15:46:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:46:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:46:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:46:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 15:46:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:46:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:46:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2022-11-25 15:46:43,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:46:43,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426665504] [2022-11-25 15:46:43,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426665504] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:43,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:43,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 15:46:43,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767733858] [2022-11-25 15:46:43,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:43,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 15:46:43,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:46:43,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 15:46:43,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:46:43,018 INFO L87 Difference]: Start difference. First operand 5891 states and 8605 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 4 states have internal predecessors, (109), 3 states have call successors, (39), 8 states have call predecessors, (39), 3 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) [2022-11-25 15:46:48,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:46:50,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:46:52,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:46:54,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:47:06,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:06,806 INFO L93 Difference]: Finished difference Result 11896 states and 18449 transitions. [2022-11-25 15:47:06,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 15:47:06,806 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 4 states have internal predecessors, (109), 3 states have call successors, (39), 8 states have call predecessors, (39), 3 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) Word has length 265 [2022-11-25 15:47:06,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:06,831 INFO L225 Difference]: With dead ends: 11896 [2022-11-25 15:47:06,831 INFO L226 Difference]: Without dead ends: 6179 [2022-11-25 15:47:06,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-11-25 15:47:06,853 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 1990 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 6275 mSolverCounterSat, 1552 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1990 SdHoareTripleChecker+Valid, 2305 SdHoareTripleChecker+Invalid, 7831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1552 IncrementalHoareTripleChecker+Valid, 6275 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:06,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1990 Valid, 2305 Invalid, 7831 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1552 Valid, 6275 Invalid, 4 Unknown, 0 Unchecked, 22.2s Time] [2022-11-25 15:47:06,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6179 states. [2022-11-25 15:47:07,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6179 to 5904. [2022-11-25 15:47:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5904 states, 4028 states have (on average 1.182969215491559) internal successors, (4765), 4135 states have internal predecessors, (4765), 1401 states have call successors, (1401), 445 states have call predecessors, (1401), 469 states have return successors, (2452), 1371 states have call predecessors, (2452), 1399 states have call successors, (2452) [2022-11-25 15:47:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5904 states to 5904 states and 8618 transitions. [2022-11-25 15:47:07,794 INFO L78 Accepts]: Start accepts. Automaton has 5904 states and 8618 transitions. Word has length 265 [2022-11-25 15:47:07,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:07,795 INFO L495 AbstractCegarLoop]: Abstraction has 5904 states and 8618 transitions. [2022-11-25 15:47:07,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 4 states have internal predecessors, (109), 3 states have call successors, (39), 8 states have call predecessors, (39), 3 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) [2022-11-25 15:47:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 5904 states and 8618 transitions. [2022-11-25 15:47:07,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2022-11-25 15:47:07,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:07,800 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:07,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-25 15:47:07,801 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_assert_linux_kernel_sched_completion__wait_without_initErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:47:07,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:07,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1671756682, now seen corresponding path program 1 times [2022-11-25 15:47:07,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:07,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734752373] [2022-11-25 15:47:07,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:07,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:47:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:47:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:47:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:47:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:47:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:47:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:47:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:47:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:47:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:47:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:47:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 15:47:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 15:47:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:47:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:47:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-25 15:47:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-25 15:47:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 15:47:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:47:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 15:47:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 15:47:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:47:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 15:47:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:47:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:47:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 15:47:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 15:47:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:47:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:47:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 15:47:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:47:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 15:47:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 15:47:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:47:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,832 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2022-11-25 15:47:08,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:08,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734752373] [2022-11-25 15:47:08,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734752373] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:47:08,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328485657] [2022-11-25 15:47:08,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:08,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:47:08,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:47:08,834 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:47:08,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 15:47:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:09,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 2194 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 15:47:09,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:47:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 72 proven. 1 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-11-25 15:47:09,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:47:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-11-25 15:47:10,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328485657] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 15:47:10,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:47:10,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 8] total 19 [2022-11-25 15:47:10,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079595988] [2022-11-25 15:47:10,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:10,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:47:10,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:10,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:47:10,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2022-11-25 15:47:10,503 INFO L87 Difference]: Start difference. First operand 5904 states and 8618 transitions. Second operand has 6 states, 5 states have (on average 22.0) internal successors, (110), 6 states have internal predecessors, (110), 3 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2022-11-25 15:47:11,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:11,689 INFO L93 Difference]: Finished difference Result 11658 states and 17772 transitions. [2022-11-25 15:47:11,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:47:11,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.0) internal successors, (110), 6 states have internal predecessors, (110), 3 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 266 [2022-11-25 15:47:11,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:11,721 INFO L225 Difference]: With dead ends: 11658 [2022-11-25 15:47:11,721 INFO L226 Difference]: Without dead ends: 5958 [2022-11-25 15:47:11,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 606 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2022-11-25 15:47:11,746 INFO L413 NwaCegarLoop]: 1363 mSDtfsCounter, 3 mSDsluCounter, 4055 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5418 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:11,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5418 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 15:47:11,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2022-11-25 15:47:12,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 5958. [2022-11-25 15:47:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5958 states, 4064 states have (on average 1.1828248031496063) internal successors, (4807), 4177 states have internal predecessors, (4807), 1407 states have call successors, (1407), 451 states have call predecessors, (1407), 481 states have return successors, (2473), 1377 states have call predecessors, (2473), 1405 states have call successors, (2473) [2022-11-25 15:47:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5958 states to 5958 states and 8687 transitions. [2022-11-25 15:47:12,697 INFO L78 Accepts]: Start accepts. Automaton has 5958 states and 8687 transitions. Word has length 266 [2022-11-25 15:47:12,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:12,698 INFO L495 AbstractCegarLoop]: Abstraction has 5958 states and 8687 transitions. [2022-11-25 15:47:12,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.0) internal successors, (110), 6 states have internal predecessors, (110), 3 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2022-11-25 15:47:12,698 INFO L276 IsEmpty]: Start isEmpty. Operand 5958 states and 8687 transitions. [2022-11-25 15:47:12,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-11-25 15:47:12,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:12,703 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:12,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 15:47:12,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-25 15:47:12,914 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ldv_assert_linux_kernel_sched_completion__wait_without_initErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:47:12,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:12,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1648669533, now seen corresponding path program 1 times [2022-11-25 15:47:12,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:12,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128223088] [2022-11-25 15:47:12,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:12,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:47:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:47:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:47:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:47:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:47:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:47:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:47:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:47:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:47:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:47:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:47:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 15:47:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 15:47:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:47:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:47:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-25 15:47:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-25 15:47:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 15:47:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:47:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 15:47:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 15:47:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:47:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 15:47:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:47:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:13,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:47:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:14,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 15:47:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:14,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 15:47:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:14,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:14,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:47:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:14,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:47:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:14,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:14,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-25 15:47:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:14,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:14,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:47:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:14,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-25 15:47:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:14,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-25 15:47:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:14,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:14,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:47:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-11-25 15:47:14,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:14,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128223088] [2022-11-25 15:47:14,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128223088] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:47:14,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327765934] [2022-11-25 15:47:14,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:14,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:47:14,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:47:14,087 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:47:14,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 15:47:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:15,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 2315 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 15:47:15,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:47:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 72 proven. 1 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-11-25 15:47:15,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:47:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-11-25 15:47:15,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327765934] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 15:47:15,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:47:15,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11, 5] total 15 [2022-11-25 15:47:15,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212749314] [2022-11-25 15:47:15,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:15,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:47:15,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:15,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:47:15,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-11-25 15:47:15,515 INFO L87 Difference]: Start difference. First operand 5958 states and 8687 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-11-25 15:47:16,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:16,715 INFO L93 Difference]: Finished difference Result 11718 states and 17829 transitions. [2022-11-25 15:47:16,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:47:16,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 267 [2022-11-25 15:47:16,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:16,739 INFO L225 Difference]: With dead ends: 11718 [2022-11-25 15:47:16,739 INFO L226 Difference]: Without dead ends: 5964 [2022-11-25 15:47:16,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 614 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-11-25 15:47:16,759 INFO L413 NwaCegarLoop]: 1378 mSDtfsCounter, 4 mSDsluCounter, 2743 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4121 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:16,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4121 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 15:47:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2022-11-25 15:47:17,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 5964. [2022-11-25 15:47:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5964 states, 4070 states have (on average 1.1825552825552825) internal successors, (4813), 4183 states have internal predecessors, (4813), 1407 states have call successors, (1407), 451 states have call predecessors, (1407), 481 states have return successors, (2473), 1377 states have call predecessors, (2473), 1405 states have call successors, (2473) [2022-11-25 15:47:17,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5964 states to 5964 states and 8693 transitions. [2022-11-25 15:47:17,670 INFO L78 Accepts]: Start accepts. Automaton has 5964 states and 8693 transitions. Word has length 267 [2022-11-25 15:47:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:17,670 INFO L495 AbstractCegarLoop]: Abstraction has 5964 states and 8693 transitions. [2022-11-25 15:47:17,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-11-25 15:47:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 5964 states and 8693 transitions. [2022-11-25 15:47:17,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-11-25 15:47:17,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:17,674 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:17,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-25 15:47:17,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-25 15:47:17,874 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ldv_assert_linux_kernel_sched_completion__wait_without_initErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:47:17,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:17,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1874115816, now seen corresponding path program 1 times [2022-11-25 15:47:17,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:17,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034038087] [2022-11-25 15:47:17,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:17,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:47:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:47:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 15:47:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 15:47:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 15:47:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:47:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 15:47:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:47:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:47:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:47:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:47:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 15:47:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 15:47:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:47:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:47:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-25 15:47:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-25 15:47:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 15:47:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:47:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 15:47:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 15:47:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:47:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 15:47:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:47:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:47:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 15:47:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 15:47:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:47:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:47:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:18,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:19,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-25 15:47:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:19,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:19,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:47:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:19,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-25 15:47:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:19,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 15:47:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:19,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:19,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:47:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:19,052 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-11-25 15:47:19,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:19,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034038087] [2022-11-25 15:47:19,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034038087] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:47:19,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850574803] [2022-11-25 15:47:19,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:19,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:47:19,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:47:19,055 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:47:19,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 15:47:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:20,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 2334 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-25 15:47:20,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:47:20,350 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 123 proven. 3 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-11-25 15:47:20,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:47:20,933 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2022-11-25 15:47:20,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850574803] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:47:20,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:47:20,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 17] total 29 [2022-11-25 15:47:20,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124397455] [2022-11-25 15:47:20,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:47:20,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 15:47:20,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:20,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 15:47:20,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=750, Unknown=0, NotChecked=0, Total=812 [2022-11-25 15:47:20,937 INFO L87 Difference]: Start difference. First operand 5964 states and 8693 transitions. Second operand has 29 states, 28 states have (on average 8.142857142857142) internal successors, (228), 21 states have internal predecessors, (228), 8 states have call successors, (89), 8 states have call predecessors, (89), 6 states have return successors, (86), 8 states have call predecessors, (86), 8 states have call successors, (86) [2022-11-25 15:47:26,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:48:05,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:48:05,971 INFO L93 Difference]: Finished difference Result 11964 states and 18459 transitions. [2022-11-25 15:48:05,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 15:48:05,972 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 8.142857142857142) internal successors, (228), 21 states have internal predecessors, (228), 8 states have call successors, (89), 8 states have call predecessors, (89), 6 states have return successors, (86), 8 states have call predecessors, (86), 8 states have call successors, (86) Word has length 268 [2022-11-25 15:48:05,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:48:06,003 INFO L225 Difference]: With dead ends: 11964 [2022-11-25 15:48:06,003 INFO L226 Difference]: Without dead ends: 6152 [2022-11-25 15:48:06,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 609 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=379, Invalid=2591, Unknown=0, NotChecked=0, Total=2970 [2022-11-25 15:48:06,027 INFO L413 NwaCegarLoop]: 386 mSDtfsCounter, 1762 mSDsluCounter, 7485 mSDsCounter, 0 mSdLazyCounter, 27617 mSolverCounterSat, 1408 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 7871 SdHoareTripleChecker+Invalid, 29026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1408 IncrementalHoareTripleChecker+Valid, 27617 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.6s IncrementalHoareTripleChecker+Time [2022-11-25 15:48:06,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1762 Valid, 7871 Invalid, 29026 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1408 Valid, 27617 Invalid, 1 Unknown, 0 Unchecked, 42.6s Time] [2022-11-25 15:48:06,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6152 states. [2022-11-25 15:48:06,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6152 to 5975. [2022-11-25 15:48:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5975 states, 4082 states have (on average 1.1817736403723664) internal successors, (4824), 4195 states have internal predecessors, (4824), 1406 states have call successors, (1406), 451 states have call predecessors, (1406), 481 states have return successors, (2472), 1376 states have call predecessors, (2472), 1404 states have call successors, (2472) [2022-11-25 15:48:06,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5975 states to 5975 states and 8702 transitions. [2022-11-25 15:48:06,967 INFO L78 Accepts]: Start accepts. Automaton has 5975 states and 8702 transitions. Word has length 268 [2022-11-25 15:48:06,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:48:06,967 INFO L495 AbstractCegarLoop]: Abstraction has 5975 states and 8702 transitions. [2022-11-25 15:48:06,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 8.142857142857142) internal successors, (228), 21 states have internal predecessors, (228), 8 states have call successors, (89), 8 states have call predecessors, (89), 6 states have return successors, (86), 8 states have call predecessors, (86), 8 states have call successors, (86) [2022-11-25 15:48:06,967 INFO L276 IsEmpty]: Start isEmpty. Operand 5975 states and 8702 transitions. [2022-11-25 15:48:06,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2022-11-25 15:48:06,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:48:06,972 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 9, 9, 4, 4, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 15:48:06,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 15:48:07,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-25 15:48:07,173 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:48:07,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:07,174 INFO L85 PathProgramCache]: Analyzing trace with hash -345043255, now seen corresponding path program 1 times [2022-11-25 15:48:07,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:07,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339903414] [2022-11-25 15:48:07,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:07,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:48:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:48:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:48:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:48:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:48:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:48:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 15:48:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:48:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:48:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:48:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 15:48:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:48:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 15:48:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 15:48:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:48:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:48:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 15:48:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 15:48:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-25 15:48:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-25 15:48:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-25 15:48:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-25 15:48:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-25 15:48:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:48:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:48:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-25 15:48:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-25 15:48:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-25 15:48:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-11-25 15:48:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:48:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:48:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:48:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 15:48:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:48:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 15:48:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 15:48:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 15:48:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 15:48:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:48:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 15:48:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:48:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2022-11-25 15:48:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2022-11-25 15:48:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:08,850 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2022-11-25 15:48:08,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:48:08,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339903414] [2022-11-25 15:48:08,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339903414] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:48:08,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240748180] [2022-11-25 15:48:08,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:08,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:48:08,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:08,853 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:48:08,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 15:48:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:10,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 3041 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-25 15:48:10,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:48:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 3 proven. 165 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2022-11-25 15:48:10,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:48:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-11-25 15:48:11,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240748180] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 15:48:11,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:48:11,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13, 16] total 27 [2022-11-25 15:48:11,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119179721] [2022-11-25 15:48:11,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:48:11,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:48:11,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:48:11,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:48:11,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2022-11-25 15:48:11,903 INFO L87 Difference]: Start difference. First operand 5975 states and 8702 transitions. Second operand has 8 states, 8 states have (on average 18.25) internal successors, (146), 7 states have internal predecessors, (146), 5 states have call successors, (46), 5 states have call predecessors, (46), 3 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2022-11-25 15:48:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:48:14,662 INFO L93 Difference]: Finished difference Result 5975 states and 8702 transitions. [2022-11-25 15:48:14,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:48:14,662 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 7 states have internal predecessors, (146), 5 states have call successors, (46), 5 states have call predecessors, (46), 3 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) Word has length 327 [2022-11-25 15:48:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:48:14,681 INFO L225 Difference]: With dead ends: 5975 [2022-11-25 15:48:14,682 INFO L226 Difference]: Without dead ends: 5973 [2022-11-25 15:48:14,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 762 GetRequests, 733 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2022-11-25 15:48:14,685 INFO L413 NwaCegarLoop]: 1312 mSDtfsCounter, 1778 mSDsluCounter, 2767 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1796 SdHoareTripleChecker+Valid, 4079 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:48:14,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1796 Valid, 4079 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-25 15:48:14,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2022-11-25 15:48:16,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 5973. [2022-11-25 15:48:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5973 states, 4081 states have (on average 1.1805929919137466) internal successors, (4818), 4193 states have internal predecessors, (4818), 1406 states have call successors, (1406), 451 states have call predecessors, (1406), 481 states have return successors, (2472), 1376 states have call predecessors, (2472), 1404 states have call successors, (2472) [2022-11-25 15:48:16,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5973 states to 5973 states and 8696 transitions. [2022-11-25 15:48:16,104 INFO L78 Accepts]: Start accepts. Automaton has 5973 states and 8696 transitions. Word has length 327 [2022-11-25 15:48:16,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:48:16,105 INFO L495 AbstractCegarLoop]: Abstraction has 5973 states and 8696 transitions. [2022-11-25 15:48:16,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 7 states have internal predecessors, (146), 5 states have call successors, (46), 5 states have call predecessors, (46), 3 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2022-11-25 15:48:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 5973 states and 8696 transitions. [2022-11-25 15:48:16,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2022-11-25 15:48:16,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:48:16,110 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:48:16,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-25 15:48:16,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-25 15:48:16,310 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:48:16,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:16,311 INFO L85 PathProgramCache]: Analyzing trace with hash 570904925, now seen corresponding path program 1 times [2022-11-25 15:48:16,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:16,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276828366] [2022-11-25 15:48:16,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:16,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:48:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:48:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:48:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:48:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:48:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:48:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 15:48:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:48:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:48:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:48:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 15:48:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:48:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 15:48:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 15:48:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:48:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:48:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 15:48:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:48:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 15:48:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 15:48:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 15:48:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 15:48:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 15:48:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 15:48:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:48:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-25 15:48:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-25 15:48:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-25 15:48:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:16,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-11-25 15:48:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:17,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-11-25 15:48:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:17,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-25 15:48:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:17,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-11-25 15:48:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:17,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-11-25 15:48:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:17,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-11-25 15:48:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:17,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-11-25 15:48:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:17,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:17,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-11-25 15:48:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:17,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-11-25 15:48:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:17,065 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2022-11-25 15:48:17,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:48:17,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276828366] [2022-11-25 15:48:17,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276828366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:48:17,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:48:17,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 15:48:17,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289374958] [2022-11-25 15:48:17,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:48:17,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 15:48:17,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:48:17,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 15:48:17,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:48:17,068 INFO L87 Difference]: Start difference. First operand 5973 states and 8696 transitions. Second operand has 10 states, 10 states have (on average 10.7) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (38), 7 states have call predecessors, (38), 2 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2022-11-25 15:48:21,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:48:37,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:48:37,683 INFO L93 Difference]: Finished difference Result 6106 states and 9090 transitions. [2022-11-25 15:48:37,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 15:48:37,684 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (38), 7 states have call predecessors, (38), 2 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) Word has length 261 [2022-11-25 15:48:37,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:48:37,703 INFO L225 Difference]: With dead ends: 6106 [2022-11-25 15:48:37,703 INFO L226 Difference]: Without dead ends: 6088 [2022-11-25 15:48:37,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2022-11-25 15:48:37,705 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 3236 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 6309 mSolverCounterSat, 2362 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3260 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 8672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2362 IncrementalHoareTripleChecker+Valid, 6309 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2022-11-25 15:48:37,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3260 Valid, 2080 Invalid, 8672 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2362 Valid, 6309 Invalid, 1 Unknown, 0 Unchecked, 18.8s Time] [2022-11-25 15:48:37,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6088 states. [2022-11-25 15:48:38,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6088 to 5972. [2022-11-25 15:48:38,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5972 states, 4081 states have (on average 1.1796128399901984) internal successors, (4814), 4192 states have internal predecessors, (4814), 1405 states have call successors, (1405), 451 states have call predecessors, (1405), 481 states have return successors, (2471), 1376 states have call predecessors, (2471), 1403 states have call successors, (2471) [2022-11-25 15:48:38,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5972 states to 5972 states and 8690 transitions. [2022-11-25 15:48:38,639 INFO L78 Accepts]: Start accepts. Automaton has 5972 states and 8690 transitions. Word has length 261 [2022-11-25 15:48:38,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:48:38,640 INFO L495 AbstractCegarLoop]: Abstraction has 5972 states and 8690 transitions. [2022-11-25 15:48:38,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (38), 7 states have call predecessors, (38), 2 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2022-11-25 15:48:38,640 INFO L276 IsEmpty]: Start isEmpty. Operand 5972 states and 8690 transitions. [2022-11-25 15:48:38,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2022-11-25 15:48:38,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:48:38,646 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 15:48:38,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-25 15:48:38,646 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ldv_assert_linux_kernel_sched_completion__wait_without_initErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:48:38,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:48:38,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2088380433, now seen corresponding path program 1 times [2022-11-25 15:48:38,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:48:38,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524198047] [2022-11-25 15:48:38,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:38,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:48:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:48:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:48:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:48:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:48:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:48:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:48:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 15:48:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:48:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:48:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:48:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 15:48:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:48:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-25 15:48:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 15:48:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-25 15:48:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 15:48:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-25 15:48:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-25 15:48:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 15:48:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:48:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:48:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-25 15:48:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-25 15:48:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:48:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:48:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-25 15:48:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-25 15:48:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-25 15:48:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 15:48:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 15:48:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 15:48:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:48:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 15:48:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:48:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:48:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 15:48:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 15:48:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:48:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:48:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-25 15:48:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:48:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-25 15:48:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 15:48:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:48:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:48:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2022-11-25 15:48:39,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:48:39,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524198047] [2022-11-25 15:48:39,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524198047] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:48:39,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362818605] [2022-11-25 15:48:39,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:48:39,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:48:39,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:48:39,920 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:48:39,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 15:48:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:48:40,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 2596 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-25 15:48:41,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:48:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 88 proven. 4 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2022-11-25 15:48:41,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:48:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2022-11-25 15:48:41,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362818605] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:48:41,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:48:41,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 7] total 24 [2022-11-25 15:48:41,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851924663] [2022-11-25 15:48:41,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:48:41,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 15:48:41,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:48:41,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 15:48:41,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2022-11-25 15:48:41,968 INFO L87 Difference]: Start difference. First operand 5972 states and 8690 transitions. Second operand has 24 states, 22 states have (on average 8.318181818181818) internal successors, (183), 17 states have internal predecessors, (183), 5 states have call successors, (70), 9 states have call predecessors, (70), 7 states have return successors, (61), 4 states have call predecessors, (61), 5 states have call successors, (61) [2022-11-25 15:48:45,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:48:47,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:48:49,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:48:51,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:48:53,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:48:55,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:48:57,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:48:58,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:49:01,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:49:02,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:49:29,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:49:29,898 INFO L93 Difference]: Finished difference Result 12029 states and 18619 transitions. [2022-11-25 15:49:29,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-25 15:49:29,899 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 8.318181818181818) internal successors, (183), 17 states have internal predecessors, (183), 5 states have call successors, (70), 9 states have call predecessors, (70), 7 states have return successors, (61), 4 states have call predecessors, (61), 5 states have call successors, (61) Word has length 328 [2022-11-25 15:49:29,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:49:29,923 INFO L225 Difference]: With dead ends: 12029 [2022-11-25 15:49:29,923 INFO L226 Difference]: Without dead ends: 6174 [2022-11-25 15:49:29,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 807 GetRequests, 756 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=470, Invalid=2080, Unknown=0, NotChecked=0, Total=2550 [2022-11-25 15:49:29,945 INFO L413 NwaCegarLoop]: 396 mSDtfsCounter, 2417 mSDsluCounter, 4146 mSDsCounter, 0 mSdLazyCounter, 14547 mSolverCounterSat, 2220 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2417 SdHoareTripleChecker+Valid, 4542 SdHoareTripleChecker+Invalid, 16773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2220 IncrementalHoareTripleChecker+Valid, 14547 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:49:29,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2417 Valid, 4542 Invalid, 16773 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2220 Valid, 14547 Invalid, 6 Unknown, 0 Unchecked, 45.2s Time] [2022-11-25 15:49:29,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6174 states. [2022-11-25 15:49:30,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6174 to 6003. [2022-11-25 15:49:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6003 states, 4112 states have (on average 1.1811770428015564) internal successors, (4857), 4223 states have internal predecessors, (4857), 1405 states have call successors, (1405), 451 states have call predecessors, (1405), 481 states have return successors, (2465), 1376 states have call predecessors, (2465), 1403 states have call successors, (2465) [2022-11-25 15:49:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6003 states to 6003 states and 8727 transitions. [2022-11-25 15:49:30,892 INFO L78 Accepts]: Start accepts. Automaton has 6003 states and 8727 transitions. Word has length 328 [2022-11-25 15:49:30,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:49:30,892 INFO L495 AbstractCegarLoop]: Abstraction has 6003 states and 8727 transitions. [2022-11-25 15:49:30,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 8.318181818181818) internal successors, (183), 17 states have internal predecessors, (183), 5 states have call successors, (70), 9 states have call predecessors, (70), 7 states have return successors, (61), 4 states have call predecessors, (61), 5 states have call successors, (61) [2022-11-25 15:49:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 6003 states and 8727 transitions. [2022-11-25 15:49:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2022-11-25 15:49:30,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:49:30,899 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 15:49:30,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 15:49:31,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-25 15:49:31,099 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ldv_assert_linux_kernel_sched_completion__wait_without_initErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:49:31,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:49:31,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1004444826, now seen corresponding path program 2 times [2022-11-25 15:49:31,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:49:31,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994787264] [2022-11-25 15:49:31,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:49:31,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:49:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:49:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:49:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:49:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:49:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:49:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:49:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:49:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 15:49:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:49:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:49:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:49:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:49:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 15:49:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:49:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-25 15:49:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 15:49:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-25 15:49:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:49:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 15:49:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-25 15:49:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-25 15:49:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 15:49:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:49:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:49:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:49:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-25 15:49:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-25 15:49:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:49:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:49:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:49:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-25 15:49:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:31,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-25 15:49:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-25 15:49:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:49:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:49:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:49:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 15:49:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 15:49:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:49:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 15:49:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:49:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:49:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:49:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 15:49:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 15:49:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:49:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:49:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:49:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:49:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 15:49:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:49:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:49:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 15:49:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 15:49:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:49:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:49:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:49:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2022-11-25 15:49:32,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:49:32,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994787264] [2022-11-25 15:49:32,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994787264] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:49:32,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084279203] [2022-11-25 15:49:32,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:49:32,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:49:32,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:49:32,733 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:49:32,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 15:49:33,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:49:33,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:49:33,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 2732 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 15:49:33,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:49:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 88 proven. 9 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2022-11-25 15:49:34,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:49:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2022-11-25 15:49:35,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084279203] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:49:35,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:49:35,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 8] total 28 [2022-11-25 15:49:35,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799077563] [2022-11-25 15:49:35,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:49:35,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 15:49:35,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:49:35,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 15:49:35,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-11-25 15:49:35,114 INFO L87 Difference]: Start difference. First operand 6003 states and 8727 transitions. Second operand has 28 states, 26 states have (on average 7.1923076923076925) internal successors, (187), 21 states have internal predecessors, (187), 5 states have call successors, (70), 9 states have call predecessors, (70), 7 states have return successors, (61), 4 states have call predecessors, (61), 5 states have call successors, (61) [2022-11-25 15:49:38,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:49:40,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:49:42,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:49:44,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:49:46,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:49:47,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:49:49,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:49:51,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:49:53,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:49:56,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:49:58,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:49:59,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:50:01,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:50:38,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:50:38,756 INFO L93 Difference]: Finished difference Result 12101 states and 18708 transitions. [2022-11-25 15:50:38,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-25 15:50:38,757 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 7.1923076923076925) internal successors, (187), 21 states have internal predecessors, (187), 5 states have call successors, (70), 9 states have call predecessors, (70), 7 states have return successors, (61), 4 states have call predecessors, (61), 5 states have call successors, (61) Word has length 330 [2022-11-25 15:50:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:50:38,787 INFO L225 Difference]: With dead ends: 12101 [2022-11-25 15:50:38,787 INFO L226 Difference]: Without dead ends: 6251 [2022-11-25 15:50:38,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 757 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=583, Invalid=2957, Unknown=0, NotChecked=0, Total=3540 [2022-11-25 15:50:38,821 INFO L413 NwaCegarLoop]: 396 mSDtfsCounter, 2542 mSDsluCounter, 5287 mSDsCounter, 0 mSdLazyCounter, 18733 mSolverCounterSat, 2505 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2542 SdHoareTripleChecker+Valid, 5683 SdHoareTripleChecker+Invalid, 21246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 2505 IncrementalHoareTripleChecker+Valid, 18733 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.7s IncrementalHoareTripleChecker+Time [2022-11-25 15:50:38,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2542 Valid, 5683 Invalid, 21246 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [2505 Valid, 18733 Invalid, 8 Unknown, 0 Unchecked, 60.7s Time] [2022-11-25 15:50:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2022-11-25 15:50:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 6080. [2022-11-25 15:50:39,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6080 states, 4179 states have (on average 1.184015314668581) internal successors, (4948), 4290 states have internal predecessors, (4948), 1407 states have call successors, (1407), 459 states have call predecessors, (1407), 489 states have return successors, (2476), 1378 states have call predecessors, (2476), 1405 states have call successors, (2476) [2022-11-25 15:50:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6080 states to 6080 states and 8831 transitions. [2022-11-25 15:50:39,953 INFO L78 Accepts]: Start accepts. Automaton has 6080 states and 8831 transitions. Word has length 330 [2022-11-25 15:50:39,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:50:39,953 INFO L495 AbstractCegarLoop]: Abstraction has 6080 states and 8831 transitions. [2022-11-25 15:50:39,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 7.1923076923076925) internal successors, (187), 21 states have internal predecessors, (187), 5 states have call successors, (70), 9 states have call predecessors, (70), 7 states have return successors, (61), 4 states have call predecessors, (61), 5 states have call successors, (61) [2022-11-25 15:50:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 6080 states and 8831 transitions. [2022-11-25 15:50:39,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2022-11-25 15:50:39,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:50:39,961 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 15:50:39,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 15:50:40,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:50:40,161 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ldv_assert_linux_kernel_sched_completion__wait_without_initErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-25 15:50:40,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:50:40,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2144489679, now seen corresponding path program 3 times [2022-11-25 15:50:40,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:50:40,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988234523] [2022-11-25 15:50:40,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:50:40,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:50:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:50:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:50:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:50:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 15:50:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:50:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:50:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:50:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 15:50:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:50:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:50:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:50:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:50:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 15:50:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:50:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-25 15:50:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 15:50:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-25 15:50:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:50:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 15:50:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-25 15:50:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-25 15:50:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 15:50:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:50:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:50:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:50:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-25 15:50:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-25 15:50:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:50:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:50:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:50:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-25 15:50:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-25 15:50:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-25 15:50:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:50:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:50:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:50:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 15:50:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 15:50:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:50:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 15:50:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:50:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:50:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:50:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 15:50:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 15:50:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:50:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:50:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:41,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 15:50:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:42,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:50:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:42,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 15:50:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:42,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:50:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:42,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 15:50:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:42,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-25 15:50:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:42,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-25 15:50:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:42,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:50:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:42,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 15:50:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:50:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2022-11-25 15:50:42,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:50:42,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988234523] [2022-11-25 15:50:42,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988234523] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:50:42,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922638497] [2022-11-25 15:50:42,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 15:50:42,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:50:42,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:50:42,103 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:50:42,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_590ffbec-84f4-4899-b556-c3881bb2151c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 15:50:44,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-25 15:50:44,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:50:44,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 2077 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 15:50:44,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:50:44,192 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 88 proven. 1 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2022-11-25 15:50:44,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:50:44,970 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2022-11-25 15:50:44,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922638497] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:50:44,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:50:44,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 7] total 24 [2022-11-25 15:50:44,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651994155] [2022-11-25 15:50:44,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:50:44,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 15:50:44,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:50:44,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 15:50:44,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2022-11-25 15:50:44,974 INFO L87 Difference]: Start difference. First operand 6080 states and 8831 transitions. Second operand has 24 states, 22 states have (on average 8.136363636363637) internal successors, (179), 17 states have internal predecessors, (179), 5 states have call successors, (70), 9 states have call predecessors, (70), 6 states have return successors, (60), 4 states have call predecessors, (60), 5 states have call successors, (60) [2022-11-25 15:50:48,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:50:51,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:50:53,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:50:57,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:50:59,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:51:00,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:51:03,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 15:51:04,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []